Advertisement

Security of a Wide Trail Design

  • Joan Daemen
  • Vincent Rijmen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2551)

Abstract

The wide trail design strategy claims to design ciphers that are both efficient and secure against linear and differential cryptanalysis. Rijndael, the AES, was designed along the principles of this strategy. We survey the recent results on Rijndael and examine whether the design strategy has fulfilled its promise.

Keywords

Boolean Function Propagation Probability Block Cipher Advance Encryption Standard Algebraic Attack 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBS99]
    Eli Biham, Alex Biryukov, and Adi Shamir. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials. In Jacques Stern, editor, Advances in Cryptology, Proceedings of Eurocrypt’ 99, volume 1592 of Lecture Notes in Computer Science, pages12–24. Springer-Verlag, 1999.Google Scholar
  2. [BDK02]
    Eli Biham, Orr Dunkelmann, and Nathan Keller. New results on boomerang and rectangle attacks. In Daemen and Rijmen [DR02b], pages 1–16.Google Scholar
  3. [BS91]
    Eli Biham and Adi Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3–72, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [BS01]
    Alex Biryukov and Adi Shamir. Structural cryptanalysis of SASAS. In Birgit Pfitzmann, editor, Advances in Cryptology, Proceedings of Eurocrypt’ 01, volume 2045 of Lecture Notes in Computer Science, pages 394–405. Springer-Verlag, 2001.Google Scholar
  5. [ÇKKP01]
    David Naccache Çetin K. Koç and Christophe Paar, editors. CHES 2001, volume 2162 of Lecture Notes in Computer Science. Springer-Verlag, 2001.Google Scholar
  6. [CP]
    Nicolas T. Courtoisan and Josef Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. Available from IACR’s e-Print server.Google Scholar
  7. [DKR97]
    Joan Daemen, Lars R. Knudsen, and Vincent Rijmen. The block cipher Square. In Eli Biham, editor, Fast Software Encryption’ 97, volume 1267 of Lecture Notes in Computer Science, pages 149–165. Springer-Verlag, 1997.CrossRefGoogle Scholar
  8. [DR02a]
    Joan Daemen and Vincent Rijmen. The design of Rijndael, AES-the advanced encryption standard. Springer-Verlag, 2002.Google Scholar
  9. [DR02b]
    Joan Daemen and Vincent Rijmen, editors. Fast Software Encryption’ 02, volume 2365 of Lecture Notes in Computer Science. Springer-Verlag, 2002.Google Scholar
  10. [FKS+00]
    Niels Ferguson, John Kelsey, Bruce Schneier, Mike Stay, David Wagner, and Doug Whiting. Improved cryptanalysis of Rijndael. In AES3 [AES00], pages 213–231.Google Scholar
  11. [FM02]
    Joanne Fuller and William Millan. On linear redundancy in the AES S-box. draft, 2002.Google Scholar
  12. [FSW01]
    Niels Ferguson, Richard Schroeppel, and Doug Whiting. A simple algebraic representation of Rijndael. draft, 2001.Google Scholar
  13. [Jan01]
    Cees Jansen. Personal communication, 2001.Google Scholar
  14. [KV01]
    Henry Kuo and Ingrid Verbauwhede. Architectural optimization for a 1.82gbit/sec vlsi implementation of the AES Rijndael algorithm. In Çetin K. Koç and Paar [ÇKKP01], pages 51–64.Google Scholar
  15. [KW02]
    Lars Knudsen and David Wagner. Integral cryptanalysis. In Daemen and Rijmen [DR02b], pages 112–127.Google Scholar
  16. [LMM91]
    Xuija Lai, James Massey, and Sean Murphy. Markov ciphers and differential cryptanalysis. In Donald W. Davies, editor, Advances in Cryptology, Proceedings of Eurocrypt’ 91, volume 547 of Lecture Notes in Computer Science, pages 17–38. Springer-Verlag, 1991.Google Scholar
  17. [Luc00]
    Stefan Lucks. Attacking 7 rounds of Rijndael under 192-bit and 256-bit keys. In AES3 [AES00], pages 215–229.Google Scholar
  18. [MR00]
    Sean Murphy and Matt J. B. Robshaw. New observations on rijndael. http://www.isg.rhbnc.ac.uk/~sean/rijn newobs.pdf, August 2000.
  19. [MR02]
    Sean Murphy and Matt J. B. Robshaw. Essential algebraic structure within the aes. In Moti Yung, editor, Advances in Cryptology, Proceedings of Crypto 2002, Lecture Notes in Computer Science. Springer-Verlag, 2002.Google Scholar
  20. [RDJ+01]
    Atri Rudra, Pradeep K. Dubey, Charanjit S. Jutla, Vijay Kumar, Josyula R. Rao, and Pankaj Rohatgi. Efficient Rijndael encryption implementation with composite field arithmetic. In Çetin K. Koç and Paar [ÇKKP01], pages 171–184.Google Scholar
  21. [Rij00]
    Vincent Rijmen. Efficient implementation of the Rijndael S-box. http://www.esat.kuleuven.ac.be/∼rijmen/rijndael/sbox.pdf, 2000.
  22. [SMTM01]
    Akashi Satoh, Sumio Morioka, Kohji Takano, and Seiji Munetoh. A compact Rijndael hardware architecture with S-box optimization. In Colin Boyd, editor, Advances in Cryptology, Proceedings of Asiacrypt 2001, volume 2248 of Lecture Notes in Computer Science, pages 239–254. Springer-Verlag, 2001.Google Scholar
  23. [Wer02]
    Ralph Wernsdorf. The round functions of Rijndael generate the alternating group. In Daemen and Rijmen [DR02b], pages 143–148.Google Scholar
  24. [WOL02]
    Johannes Wolkerstorfer, Elisabeth Oswald, and Mario Lamberger. An ASIC implementation of the AES S-boxes. In Bart Preneel, editor, Topics in Cryptology-CT-RSA 2002, Lecture Notes in Computer Science, pages 67–78. Springer-Verlag, 2002.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Joan Daemen
    • 1
  • Vincent Rijmen
    • 2
    • 3
  1. 1.ERG Group—ProtonWorldBelgium
  2. 2.CryptomathicBelgium
  3. 3.IAIK, Graz University of TechnologyAustria

Personalised recommendations