An iterated block cipher can be regarded as a means of pro- ducing a set of permutations of a message space. Some properties of the group generated by the round functions of such a cipher are known to be of cryptanalytic interest. It is shown here that if this group acts impri- mitively on the message space then there is an exploitable weakness in the cipher. It is demonstrated that a weakness of this type can be used to construct a trapdoor that may be dificult to detect. An example of a DES-like cipher, resistant to both linear and differential cryptanalysis that generates an imprimitive group and is easily broken, is given. Some implications for block cipher design are noted.
CITATION STYLE
Paterson, K. G. (1999). Imprimitive permutation groups and trapdoors in iterated block ciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1636, pp. 201–214). Springer Verlag. https://doi.org/10.1007/3-540-48519-8_15
Mendeley helps you to discover research relevant for your work.