Integral cryptanalysis

In <a href="/facts/Cryptography/e94PEVau">cryptography</a>, integral cryptanalysis is a <a href="/facts/Cryptanalysis/7CPEQlJI">cryptanalytic attack</a> that is particularly applicable to <a href="/facts/Block_cipher/MJywAyfQ">block ciphers</a> based on <a href="/facts/Substitution%E2%80%93permutation_network/MLjdoC5j">substitution–permutation networks</a>. It was originally designed by <a href="/facts/Lars_Knudsen/ludw9nqB">Lars Knudsen</a> as a dedicated attack against <a href="/facts/Square_(cipher)/mQRozt3V">Square</a>, so it is commonly known as the Square attack. It was also extended to a few other ciphers related to Square: <a href="/facts/CRYPTON/Bz9VudGw">CRYPTON</a>, <a href="/facts/Rijndael/HdXGBY2Q">Rijndael</a>, and <a href="/facts/SHARK/8MffJfmL">SHARK</a>. <a href="/facts/Stefan_Lucks/C8E8YPgn">Stefan Lucks</a> generalized the attack to what he called a saturation attack and used it to attack <a href="/facts/Twofish/T1pjlttA">Twofish</a>, which is not at all similar to Square, having a radically different <a href="/facts/Feistel_network/CPtzaEET">Feistel network</a> structure. Forms of integral cryptanalysis have since been applied to a variety of ciphers, including <a href="/facts/Hierocrypt/j8cxzjfB">Hierocrypt</a>, <a href="/facts/International_Data_Encryption_Algorithm/HuRBKLQY">IDEA</a>, <a href="/facts/Camellia_(cipher)/XyJ1vnGn">Camellia</a>, <a href="/facts/Skipjack_(cipher)/pxHYFxTj">Skipjack</a>, <a href="/facts/MISTY1/hRDmX0Ad">MISTY1</a>, MISTY2, <a href="/facts/Secure_and_Fast_Encryption_Routine/gfWYnLDr">SAFER++</a>, <a href="/facts/KHAZAD/psk33D8r">KHAZAD</a>, and FOX (now called <a href="/facts/IDEA_NXT/DUWX7wYU">IDEA NXT</a>).
Unlike <a href="/facts/Differential_cryptanalysis/84yp0SDC">differential cryptanalysis</a>, which uses pairs of <a href="/facts/Chosen_plaintext_attack/uTJ0XCAN">chosen plaintexts</a> with a fixed <a href="/facts/XOR/FHyr7hGQ">XOR</a> difference, integral cryptanalysis uses <a href="/facts/Set_(mathematics)/BfucfHMq">sets</a> or even <a href="/facts/Multiset/bPFJGMDo">multisets</a> of chosen plaintexts of which part is held constant, and another part varies through all possibilities. For example, an attack might use 256 chosen plaintexts that have all but 8 of their bits the same, but all differ in those 8 bits. Such a set necessarily has an XOR sum of 0, and the XOR sums of the corresponding sets of ciphertexts provide information about the cipher's operation. This contrast between the differences of pairs of texts and the sums of larger sets of texts inspired the name "integral cryptanalysis", borrowing the terminology of <a href="/facts/Calculus/MEmUTYoz">calculus</a>.

<ul><li><a href="/facts/Joan_Daemen/cqdIFHHG">Joan Daemen</a>, <a href="/facts/Lars_Knudsen/ludw9nqB">Lars Knudsen</a>, <a href="/facts/Vincent_Rijmen/3S5n4f39">Vincent Rijmen</a> (January 1997). <a href="http://www.cosic.esat.kuleuven.be/publications/article-309.pdf">The Block Cipher Square</a> (PDF). 4th International Workshop on <a href="/facts/Fast_Software_Encryption/TgVIMDmb">Fast Software Encryption</a> (FSE '97), Volume 1267 of <a href="/facts/Lecture_Notes_in_Computer_Science/1UeA77BC">Lecture Notes in Computer Science</a>. <a href="/facts/Haifa/L3zIs1p1">Haifa</a>: <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a>. pp. 149–165. Retrieved 2007-02-15.{{cite conference}}: CS1 maint: multiple names: authors list (link)</li>
<li>Carl D'Halluin, Gert Bijnens, Vincent Rijmen, <a href="/facts/Bart_Preneel/eUzy4y6c">Bart Preneel</a> (March 1999). <a href="http://citeseer.ist.psu.edu/479905.html">Attack on Six Rounds of Crypton</a> (PDF/<a href="/facts/PostScript/h2XwbcmC">PostScript</a>). 6th International Workshop on Fast Software Encryption (FSE '99). <a href="/facts/Rome/bh1Ttx3T">Rome</a>: Springer-Verlag. pp. 46–59. Retrieved 2007-03-03.{{cite conference}}: CS1 maint: multiple names: authors list (link)</li>
<li><a href="/facts/Niels_Ferguson/hCX1IMQb">N. Ferguson</a>, <a href="/facts/John_Kelsey_(cryptanalyst)/nI1QmqhJ">J. Kelsey</a>, <a href="/facts/Stefan_Lucks/C8E8YPgn">S. Lucks</a>, <a href="/facts/Bruce_Schneier/kWxPFPmQ">B. Schneier</a>, M. Stay, <a href="/facts/David_A._Wagner/ewC269Uo">D. Wagner</a>, D. Whiting (April 2000). <a href="http://www.schneier.com/paper-rijndael.html">Improved Cryptanalysis of Rijndael</a> (PDF/PostScript). 7th International Workshop on Fast Software Encryption (FSE 2000). <a href="/facts/New_York_City/YlyvFmVC">New York City</a>: Springer-Verlag. pp. 213–230. Retrieved 2007-03-06.{{cite conference}}: CS1 maint: multiple names: authors list (link)</li>
<li>Stefan Lucks (September 14, 2000). <a href="http://eprint.iacr.org/2000/046">The Saturation Attack - a Bait for Twofish</a> (PDF/<a href="/facts/PostScript/h2XwbcmC">PostScript</a>). 8th International Workshop on Fast Software Encryption (FSE '01). <a href="/facts/Yokohama/q5RcVlLf">Yokohama</a>: Springer-Verlag. pp. 1–15. Retrieved 2006-11-30.</li>
<li><a href="/facts/Paulo_S._L._M._Barreto/57gGkRnU">Paulo S. L. M. Barreto</a>, Vincent Rijmen, Jorge Nakahara, Jr., Bart Preneel, Joos Vandewalle, Hae Yong Kim (April 2001). <a href="http://www.cosic.esat.kuleuven.be/publications/article-83.pdf">Improved SQUARE Attacks against Reduced-Round HIEROCRYPT</a> (PDF). 8th International Workshop on Fast Software Encryption (FSE '01). Yokohama: Springer-Verlag. pp. 165–173. Retrieved 2007-03-03.{{cite conference}}: CS1 maint: multiple names: authors list (link)</li>
<li>Jorge Nakahara, Jr.; Paulo S.L.M. Barreto; Bart Preneel; Joos Vandewalle; Hae Y. Kim (2001). <a href="http://citeseer.ist.psu.edu/548521.html">"SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers"</a> (PDF/PostScript). Retrieved 2007-03-03. {{cite journal}}: Cite journal requires |journal= (help)</li>
<li>Yongjin Yeom; Sangwoo Park; Iljun Kim (February 2002). <a href="http://maths.utime.cn:81/Crypt1998-2003/bibs/2365/23650089.htm">On the Security of CAMELLIA against the Square Attack</a> (PDF). 9th International Workshop on Fast Software Encryption (FSE '02). <a href="/facts/Leuven/zkKTDkzH">Leuven</a>: Springer-Verlag. pp. 89–99. Retrieved 2007-03-03.[permanent dead link‍]</li>
<li>Kyungdeok Hwang; Wonil Lee; Sungjae Lee; Sangjin Lee; Jongin Lim (February 2002). <a href="https://web.archive.org/web/20070525204822/http://maths.utime.cn:81/Crypt1998-2003/bibs/2365/23650100.htm">Saturation Attacks on Reduced Round Skipjack</a>. 9th International Workshop on Fast Software Encryption (FSE '02). Leuven: Springer-Verlag. pp. 100–111. Archived from <a href="http://maths.utime.cn:81/Crypt1998-2003/bibs/2365/23650100.htm">the original</a> (PDF) on 2007-05-25. Retrieved 2007-03-03.</li>
<li>Lars Knudsen; David Wagner (December 11, 2001). <a href="https://www.iacr.org/archive/fse2002/23650114/23650114.pdf">Integral cryptanalysis</a> (PDF/PostScript). 9th International Workshop on Fast Software Encryption (FSE '02). Leuven: Springer-Verlag. pp. 112–127. Retrieved 2006-11-30.</li>
<li>Gilles Piret, <a href="/facts/Jean-Jacques_Quisquater/hH6DUPH3">Jean-Jacques Quisquater</a> (February 16, 2003). <a href="http://citeseer.ist.psu.edu/559604.html">"Integral Cryptanalysis on reduced-round Safer++"</a> (PDF/PostScript). Retrieved 2007-03-03. {{cite journal}}: Cite journal requires |journal= (help)</li>
<li>Frédéric Muller (December 2003). <a href="https://archive.today/20070723200754/http://www.mathmagic.cn/Crypt1998-2003/bibs/2894/28940347.htm">A New Attack against Khazad</a>. Advances in Cryptology – <a href="/facts/ASIACRYPT/TgVIMDmb">ASIACRYPT</a> 2003. <a href="/facts/Taipei/uxB89v54">Taipei</a>: Springer-Verlag. pp. 347–358. Archived from <a href="http://www.mathmagic.cn/Crypt1998-2003/bibs/2894/28940347.htm">the original</a> (PDF) on 2007-07-23. Retrieved 2007-03-03.</li>
<li>Wu Wenling; Zhang Wentao; Feng Dengguo (August 25, 2005). <a href="http://eprint.iacr.org/2005/292.pdf">"Improved Integral Cryptanalysis of FOX Block Cipher"</a> (PDF). Retrieved 2007-03-03. {{cite journal}}: Cite journal requires |journal= (help)</li></ul>

Integral cryptanalysis open-in-new

Integral cryptanalysis