Mod n cryptanalysis: Difference between revisions

Revision as of 18:58, 22 December 2006

Revision as of 05:03, 8 February 2007

Line 1:

In [[cryptography]], '''mod ''n'' cryptanalysis''' is an [[cryptanalysis|attack]] applicable to [[block cipher|block]] and [[stream cipher]]s. It is a form of [[partitioning cryptanalysis]] which exploits unevenness in how the [[cipher]] operates over [[equivalence class]]es (congruence classes) [[modular arithmetic|modulo ''n'']]. The method was first suggested in [[1999]] by [[John Kelsey (cryptanalyst)|John Kelsey]], [[Bruce Schneier]], and [[David Wagner]] and applied to RC5P (a variant of [[RC5]]) and [[M6 (cipher)|M6]] (a family of block ciphers used in the [[FireWire]] standard). These attacks used the properties of binary addition and bit rotation modulo a [[Fermat prime]].

==Mod 3 analysis of RC5P==

Line 19:

==References==

* [[John Kelsey]], [[Bruce Schneier]], [[David Wagner]]: Mod n Cryptanalysis, with Applications Against RC5P and M6. Fast Software Encryption 1999: pp139–155 [http://www.schneier.com/paper-mod3.html (PDF or PS)]

* [[Vincent Rijmen]], "mod n" Cryptanalysis of Rabbit, Whitepaper, Cryptico, December 1, 2003. [http://www.cryptico.com/Files/filer/wp_modn_analysis.pdf (PDF)]

* Toshio Tokita、Tsutomu Matsumoto, On Applicability of Differential Cryptanalysis, Linear Cryptanalysis and Mod n Cryptanalysis to an Encryption Algorithm M8 (ISO9979-20), IPSJ JOURNAL Vol.42 No.08.