Related papers: On the group generated by the round functions of t…

We define a cipher that is an extension of GOST, and study the permutation group generated by its round functions. We show that, under minimal assumptions on the components of the cipher, this group is the alternating group on the plaintext…

We provide two sufficient conditions to guarantee that the round functions of a translation based cipher generate a primitive group. Furthermore, under the same hypotheses, and assuming that a round of the cipher is strongly proper and…

We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a key-alternating block cipher are the translates of a linear subspace. Following up remarks of Paterson and Shamir, we…

In a previous paper, we had proved that the permutation group generated by the round functions of an AES-like cipher is primitive. Here we apply the O'Nan Scott classification of primitive groups to prove that this group is the alternating…

S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if $G$ is a nontrivial finite group which is…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution…

The group generated by the round functions of a block ciphers is a widely investigated problem. We identify a large class of block ciphers for which such group is easily guaranteed to be primitive. Our class includes the AES and the…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

The algebraic structure of the group generated by the encryption functions of a block cipher depends on the key schedule algorithm used for generating the round keys. For such a reason, in general, studying this group does not appear to be…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

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…

We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…

The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…

Building upon the author's previous work on primitivity testing of finite nilpotent linear groups over fields of characteristic zero, we describe precisely those finite nilpotent groups which arise as primitive linear groups over a given…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a…