In cryptography, integral cryptanalysis is a cryptanalytic attack that is particularly applicable to block ciphers based on substitution–permutation networks. It was originally designed by Lars Knudsen as a dedicated attack against Square, so it is commonly known as the Square attack. It was also extended to a few other ciphers related to Square: CRYPTON, Rijndael, and SHARK. Stefan Lucks generalized the attack to what he called a saturation attack and used it to attack Twofish, which is not at all similar to Square, having a radically different Feistel network structure. Forms of integral cryptanalysis have since been applied to a variety of ciphers, including Hierocrypt, IDEA, Camellia, Skipjack, MISTY1, MISTY2, SAFER++, KHAZAD, and FOX (now called IDEA NXT).

Unlike differential cryptanalysis, which uses pairs of chosen plaintexts with a fixed XOR difference, integral cryptanalysis uses sets or even multisets 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 calculus.

  • Joan Daemen, Lars Knudsen, Vincent Rijmen (January 1997). (PDF). 4th International Workshop on Fast Software Encryption (FSE '97), Volume 1267 of Lecture Notes in Computer Science. Haifa: Springer-Verlag. pp. 149–165.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  • Carl D'Halluin, Gert Bijnens, Vincent Rijmen, Bart Preneel (March 1999). (PDF/PostScript). 6th International Workshop on Fast Software Encryption (FSE '99). Rome: Springer-Verlag. pp. 46–59.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  • N. Ferguson, J. Kelsey, S. Lucks, B. Schneier, M. Stay, D. Wagner, D. Whiting (April 2000). (PDF/PostScript). 7th International Workshop on Fast Software Encryption (FSE 2000). New York City: Springer-Verlag. pp. 213–230.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  • Stefan Lucks (September 14, 2000). (PDF/PostScript). 8th International Workshop on Fast Software Encryption (FSE '01). Yokohama: Springer-Verlag. pp. 1–15.
  • Paulo S. L. M. Barreto, Vincent Rijmen, Jorge Nakahara, Jr., Bart Preneel, Joos Vandewalle, Hae Yong Kim (April 2001). (PDF). 8th International Workshop on Fast Software Encryption (FSE '01). Yokohama: Springer-Verlag. pp. 165–173.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  • Jorge Nakahara, Jr.; Paulo S.L.M. Barreto; Bart Preneel; Joos Vandewalle; Hae Y. Kim (2001). (PDF/PostScript). {{cite journal}}:Cite journal requires |journal= (help)
  • Yongjin Yeom; Sangwoo Park; Iljun Kim (February 2002). (PDF). 9th International Workshop on Fast Software Encryption (FSE '02). Leuven: Springer-Verlag. pp. 89–99.[permanent dead link]
  • Kyungdeok Hwang; Wonil Lee; Sungjae Lee; Sangjin Lee; Jongin Lim (February 2002). . 9th International Workshop on Fast Software Encryption (FSE '02). Leuven: Springer-Verlag. pp. 100–111. Archived from (PDF) on 2007-05-25.
  • Lars Knudsen; David Wagner (December 11, 2001). (PDF/PostScript). 9th International Workshop on Fast Software Encryption (FSE '02). Leuven: Springer-Verlag. pp. 112–127.
  • Gilles Piret, Jean-Jacques Quisquater (February 16, 2003). (PDF/PostScript). {{cite journal}}:Cite journal requires |journal= (help)
  • Frédéric Muller (December 2003). (PDF). Advances in Cryptology – ASIACRYPT 2003. Taipei: Springer-Verlag. pp. 347–358.{{cite conference}}: CS1 maint: deprecated archival service (link)
  • Wu Wenling; Zhang Wentao; Feng Dengguo (August 25, 2005). (PDF). {{cite journal}}:Cite journal requires |journal= (help)