Skip to main content

Cryptanalysis of Some AES Candidate Algorithms

  • Conference paper
Information and Communication Security (ICICS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1726))

Included in the following conference series:

Abstract

Decorrelated Fast Cipher(DFC),LOKI97 and MAGENTA are candidates for the Advanced Encryption Standard(AES). In this paper we analyze their security respectively. Since cryptographic properties of the confusion permutation of DFC are weak, its security depends on its subkey addition completely. It seems that LOKI97 is not stronger than LOKI89 and LOKI91. Because of characteristics of the round function, LOKI97 is susceptible to linear cryptanalysis for some keys. MAGENTA is a Feistel cipher with only 6 rounds and its key schedule is very simple. Based on these limitations, we present a chosen plaintext attack against it using 264 chosen plaintexts. In conclusion, we do not think DFC, LOKI97 and MAGENTA are qualified candidates for the AES.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. RSA Data Security Inc., http://www.rsa.com

  2. Vaudenay, S.: Decorrelated Fast Cipher, http://www.nist.gov/aes

  3. Brown, L., Pieprzyk, J.: LOKI97, http://www.nist.gov/aes

  4. Jacobson, M.J., Huber Jr., K.: MAGENTA, http://www.nist.gov/aes

  5. Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology 4(1), 3–72 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 368–397. Springer, Heidelberg (1994)

    Google Scholar 

  7. Biham, E., Shamir, A.: Differential Cryptanalysis Snefru, Kharfe, REDOC- II, LOKI and Lucifer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 156–171. Springer, Heidelberg (1992)

    Google Scholar 

  8. Tokita, T., Sorimachi, T., Matsui, M.: Linear cryptanalysis of LOKI and S2DES. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 363–366. Springer, Heidelberg (1995)

    Google Scholar 

  9. Pieprzy, J.: Bent Permutations. Lecture Notes in Pure and Applied Mathematics, vol. 141. Springer, Heidelberg (1992)

    Google Scholar 

  10. Wu, W., Feng, D., Qing, S.: Brief Commentary on the 15 AES Candidate Algorithms Issued by NIST of USA. Journal of Software 10(3), 225–230 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, W., Li, B., Feng, D., Qing, S. (1999). Cryptanalysis of Some AES Candidate Algorithms. In: Varadharajan, V., Mu, Y. (eds) Information and Communication Security. ICICS 1999. Lecture Notes in Computer Science, vol 1726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47942-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47942-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66682-0

  • Online ISBN: 978-3-540-47942-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics