The Round Functions of RIJNDAEL Generate the Alternating Group
نویسنده
چکیده
For the block cipher RIJNDAEL with a block length of 128 bits group theoretic properties of the round functions are derived. Especially it is shown that these round functions generate the alternating group.
منابع مشابه
Algebraic properties of generalized Rijndael-like ciphers
We provide conditions under which the set of Rijndael-like functions considered as permutations of the state space and based on operations of the finite field GF(p) (p ≥ 2) is not closed under functional composition. These conditions justify using a sequential multiple encryption to strengthen generalized Rijndael like ciphers. In [39], R. Sparr and R. Wernsdorf provided conditions under which ...
متن کاملOn the primitivity of PRESENT and other lightweight ciphers
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 consists of m-bit S-Boxes, with m = 3,4 or 5, we prove that such a group is the alternating group. As an immediate consequence, we deduce that the round function...
متن کاملThe One-Round Functions of the DES Generate the Alternating Group
hi c a d of thc 16 DES rounds we have a permutation of @-bitblocks. According to the corresponding key-block there are 248 possible permutations per round. In this paper we will prove that these permutations generate the alternating group. The main parts of the paper are the proof that the generated group is 3-transitive, and the application of a result from p. J. Cameron based on the classific...
متن کاملThe Round Functions of SERPENT Generate the Alternating Group
The results in the paper exclude several thinkable regularities of the SERPENT round functions. Thus they support the statement of the SERPENT authors that this algorithm has strong cryptographic properties.
متن کاملAES and the Wide Trail Design Strategy
Rijndael is an iterated block cipher that supports key and block lengths of 128 to 256 bits in steps of 32 bits. It transforms a plaintext block into a ciphertext block by iteratively applying a single round function alternated by the addition (XOR) of a round keys. The round keys are derived from the cipher key by means of a key schedule. As a result of the wide trail strategy, the round funct...
متن کامل