SavedAdd your journal

Journals / Turkish Journal of Electrical Engineering and Computer Science / 2012 / Cilt: 20 - Sayı: 4

Improved square properties of IDEA

Mete AKGÜN
Hüseyin DEMİRCİ
Mahmut Şamil SAĞIROĞLU
Pages
493–506
Publication Date
2012-04-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Furthermore, this approach enables us to propose the first four and five round square distinguishers of IDEA.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Block cipher encryption algorithms generally process on word structures of fixed length such as 8 or 16-bits.
📊
Key Findings & Data:IDEA is one of the most widely used block ciphers and operates on 16-bit words.
💡
Conclusion & Impact:Furthermore, this approach enables us to propose the first four and five round square distinguishers of IDEA.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:IDEA · block cipher · cryptanalysis

Abstract

Block cipher encryption algorithms generally process on word structures of fixed length such as 8 or 16-bits. IDEA is one of the most widely used block ciphers and operates on 16-bit words. Square analysis is a method that exploits the word structure of block ciphers. Some square distinguishers of IDEA are given in previous studies. The best attacks against IDEA use square-like techniques. In this paper, we focus on the square properties of the IDEA block cipher. We consider all fixed word combinations of the plaintext to investigate the structural behavior of the algorithm. We observe that the cipher can be distinguished from a random permutation by fixing one, two or three subblocks of the cipher for 2 and 3 rounds. We find out novel 3-round distinguishers that require 216 chosen plaintexts. Furthermore, this approach enables us to propose the first four and five round square distinguishers of IDEA.

Özet

Block cipher encryption algorithms generally process on word structures of fixed length such as 8 or 16-bits. IDEA is one of the most widely used block ciphers and operates on 16-bit words. Square analysis is a method that exploits the word structure of block ciphers. Some square distinguishers of IDEA are given in previous studies. The best attacks against IDEA use square-like techniques. In this paper, we focus on the square properties of the IDEA block cipher. We consider all fixed word combinations of the plaintext to investigate the structural behavior of the algorithm. We observe that the cipher can be distinguished from a random permutation by fixing one, two or three subblocks of the cipher for 2 and 3 rounds. We find out novel 3-round distinguishers that require 216 chosen plaintexts. Furthermore, this approach enables us to propose the first four and five round square distinguishers of IDEA.

🔖

Cite This Article

AKGÜN, M., DEMİRCİ, H., SAĞIROĞLU, M. Ş. (2012). Improved square properties of IDEA. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 20 - Sayı: 4, 493–506. https://ajindex.com/articles/188661

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (20)

  1. W. Meier, On the security of the IDEA block cipher, in: EUROCRYPT, 1993, pp. 371–385.
  2. J. Daemen, R. Govaerts, J. Vandewalle, Cryptanalysis of 2.5 rounds of IDEA (extended abstract), Tech. rep. (1993).
  3. J. Borst, L. R. Knudsen, V. Rijmen, Two attacks on reduced IDEA, in: EUROCRYPT, 1997, pp. 1–13.
  4. E. Biham, A. Biryukov, A. Shamir, Miss in the middle attacks on IDEA and Khufu, in: FSE, 1999, pp. 124–138.
  5. H. Demirci, Square-like attacks on reduced rounds of IDEA, in: Selected Areas in Cryptography, 2002, pp. 147–159.
  6. H. Demirci, A. A. Sel¸cuk, E. T¨ure, A new meet-in-the-middle attack on the IDEA block cipher, in: Selected Areas in Cryptography, 2003, pp. 117–129.
  7. A. Biryukov, J. N. Jr., B. Preneel, J. Vandewalle, New weak-key classes of IDEA, in: ICICS, 2002, pp. 315–326.
  8. E. Biham, O. Dunkelman, N. Keller, Related-key boomerang and rectangle attacks, in: EUROCRYPT, 2005, pp. –525. E. Biham, O. Dunkelman, N. Keller, New cryptanalytic results on IDEA, in: ASIACRYPT, 2006, pp. 412–427.
  9. E. Biham, O. Dunkelman, N. Keller, A new attack on 6-round IDEA, in: FSE, 2007, pp. 211–224.
  10. J. Daemen, R. Govaerts, J. Vandewalle, Weak keys for IDEA, in: CRYPTO, 1993, pp. 224–231.
  11. J. J. Nakahara, B. Preneel, J. Vandewalle, The Biryukov-Demirci attack on reduced-round versions of IDEA and MESH ciphers, in: ACISP, 2004, pp. 98–109.
  12. P. Junod, New attacks against reduced-round versions of IDEA, in: FSE, 2005, pp. 384–397.
  13. C. Clavier, B. Gierlichs, I. Verbauwhede, Fault analysis study of IDEA, in: CT-RSA, 2008, pp. 274–287.
  14. X. Sun, X. Lai, The key-dependent attack on block ciphers, in: ASIACRYPT, 2009, pp. 19–36.
  15. J. Daemen, L. R. Knudsen, V. Rijmen, The block cipher Square, in: FSE, 1997, pp. 149–165.
  16. S. Lucks, The saturation attack - a bait for TwoŞsh, in: FSE, 2001, pp. 1–15.
  17. L. R. Knudsen, D. Wagner, Integral cryptanalysis, in: FSE, 2002, pp. 112–127.
  18. X. Lai, J. L. Massey, A proposal for a new block encryption standard, in: EUROCRYPT, 1990, pp. 389–404.
  19. X. Lai, J. L. Massey, S. Murphy, Markov ciphers and differential cryptanalysis, in: EUROCRYPT, 1991, pp. 17–38.
  20. X. Lai, On the design and security of the block ciphers, in: ETH Series in Information Processing, Vol. 1, 1995.