Imprimitive permutation groups and trapdoors in iterated block ciphers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1636, Issue , 1999, Pages 201-214

  Paterson, Kenneth G ^a  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LYAPUNOV METHODS; SECURITY OF DATA;

BLOCK CIPHERS; DIFFERENTIAL CRYPTANALYSIS; MESSAGE SPACE; PERMUTATION GROUP; ROUND FUNCTIONS;

CRYPTOGRAPHY;

EID: 84957699140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48519-8_15     Document Type: Conference Paper

References (33)

1. C.M. Adams and S.E. Tavares, “The structured design of cryptographically good S-boxes,” Journal of Cryptology, 3, 27-41,1990.
2. E. Biham, A. Biryukov and A. Shamir, “Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials,” Proceedings of EUROCRYPT’99, LNCS, 1999.
3. E. Biham and A. Shamir, Differential cryptanalysis of the Data Encrpytion Standard, Springer-Verlag, New York, 1993.
4. K.W. Campbell and M. Wiener, “DES is not a group,” Proceedings of CRYPTO’92, LNCS 740, 512-520, 1993.
5. D. Coppersmith, “The Data Encryption Standard (DES) and its strength against attacks,” IBM Research Report, RC 18613, 1992.
6. D. Coppersmith and E. Grossman, “Generators for certain alternating groups with applications to cryptology,” SIAM Journal on Applied Mathematics, 29, 624-627, 1975.
7. Data Encryption Standard, National Bureau of Standards, Federal Information Processing Standards Publications No. 46, 1977.
8. S. Even and O. Goldreich, “DES-like functions can generate the alternating group,” IEEE Transactions on Information Theory, 29, 863-865, 1983.
9. J.-H. Evertse, “Linear structures in blockciphers,” Proceedings EUROCRYPT’87, LNCS 304, 249-266, 1988.
10. C. Harpes, Cryptanalysis of iterated block ciphers, ETH Series in Information Processing, Ed. J. L. Massey, Hartung-Gorre Verlag, Konstanz, 1996.
11. M. Hellman, R. Merkle, R. Schroeppel, L. Washington, W. Diffie, S. Pohlig and P. Schweitzer, “Results of an initial attempt to cryptanalyze the NBS Data Encryption Standard,” Information Systems Laboratory report, Stanford University, 1976.
12. G. Hornauer, W. Stephan and R. Wernsdorf, “Markov ciphers and alternating groups,” Presented at Rump Session, EUROCRYPT’93, 1993.
13. B.S. Kaliski Jr., R.L. Rivest and A.T. Sherman, “Is the Data Encryption Standard a group? (Results of cycling experiments on DES),” Journal of Cryptology, 1, 3-36, 1988.
14. K. Kim, “Construction of DES-like S-boxes based on boolean functions satisfying the SAC,” Proceedings of ASIACRYPT’91, LNCS 739, 59-72, 1992.
15. B. Kam and G.I. Davida, “A structured design of substitution-permutation encryption networks,” IEEE Transactions on Computers, 28, 747-753, 1979.
16. L.R. Knudsen, “Iterative characteristics of DES and s2-DES,” Proceedings of CRYPTO’92, LNCS 740, 497-511, 1993.
17. L.R. Knudsen, “Practically secure Feistel ciphers,” Fast Software Encryption, LNCS 809, 211-221, 1994.
18. L.R. Knudsen, “Applications of higher order differentials and partial differentials,” Fast Software Encryption, LNCS 1008, 196-211, 1995.
19. L.R. Knudsen, “DEAL - A 128-bit Block Cipher,” available online at http://www.ii.uib.no/larsr/papers/deal.ps Revised May 15, 1998.
20. X. Lai, J.L. Massey and S. Murphy, “Markov ciphers and differential cryptanalysis,” Proceedings of EUROCRYPT’91, LNCS 547, 17-38, 1991.
21. M. Matsui, “Linear cryptanalysis method for DES cipher,” Proceedings of EUROCRYPT’93, LNCS 765, 386-397, 1994.
22. W. Meier and O. Staffelbach, “Nonlinearity criteria for cryptographic functions,” Proceedings of EUROCRYPT’89, LNCS 434, 549-562, 1989.
23. J.H. Moore and G.J. Simmons, “Cycle structure of the DES with weak and semi- weak keys,” Proceedings of CRYPTO’86, LNCS 263, 9-32, 1987.
24. S. Murphy, “The cryptanalysis of FEAL-4 with 20 chosen plaintexts,” Journal of Cryptology, 2, 145-154, 1990.
25. S. Murphy, K. Paterson and P. Wild, “A weak cipher that generates the symmetric group,” Journal of Cryptology, 7, 61-65, 1994.
26. J. Pieprzyk and X.-M. Zhang, “Permutation generators of alternating groups,” Proceedings of A USCRYPT’90, LNCS 453, 237-244, 1990.
27. J.A. Reeds and J.L. Manferdelli, “DES has no per round linear factors,” Proceedings of CRYPTO’84, LNCS 196, 377-389, 1985.
28. V. Rijmen and B. Preneel, “A family of trapdoor ciphers,” Fast Software Encryption, LNCS 1267, 139-148, 1997.
29. D.J.S. Robinson, A course in the Theory of Groups, Graduate Texts in Mathematics, Springer, New York, 1982.
30. R. Wernsdorf, “The one-round functions of the DES generate the alternating group,” Proceedings of EUROCRYPT’92, LNCS 658, 99-112, 1993.
31. H. Wielandt, Finite Permutation Groups, Academic Press, New York and London, 1964.
32. H. Wu, F. Bao, R.H. Deng and Q.-Z. Ye, “Cryptanalysis of Rijmen-Preneel trapdoor ciphers,” Proceedings of ASIACRYPT’98, LNCS 1514, 126-132, 1998.
33. H. Wu, F. Bao, R.H. Deng and Q.-Z. Ye, “Cryptanalysis of Rijmen-Preneel trapdoor ciphers,” Proceedings of ASIACRYPT’98, LNCS 1514, 126-132, 1998.