Related papers: Imprimitive permutations groups generated by the r…
Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…
We describe all Gaussian generating functionals on several easy quantum groups given by non-crossing partitions. This includes in particular the free unitary, orthogonal and symplectic quantum groups. We further characterize central…
We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens…
Let $G$ be a finite group and $p$ be a prime. We study the kernel of the map, between the Burnside ring of $G$ and the Grothendieck ring of $\mathbb{F}_p[G]$-modules, taking a $G$-set to its associated permutation module. We are able, for…
Recent results by Alagic and Russell have given some evidence that the Even-Mansour cipher may be secure against quantum adversaries with quantum queries, if considered over other groups than $(\mathbb{Z}/2)^n$. This prompts the question as…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
Facing the worldwide steady progress in building quantum computers, it is crucial for cryptographic community to design quantum-safe cryptographic primitives. To achieve this, we need to investigate the capability of cryptographic analysis…
This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the…
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
We consider compact matrix quantum groups whose fundamental corepresentation matrix has entries which are partial isometries with central support. We show that such quantum groups have a simple representation as semi-direct product quantum…
Recent results by Alagic and Russell have given some evidence that the Even-Mansour cipher may be secure against quantum adversaries with quantum queries, if considered over other groups than $(\mathbb{Z}/2)^n$. This prompts the question as…
Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes…
This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…
We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…
We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…