Content deleted Content added
m Citation maintenance. Formatted: journal. You can use this bot yourself! Please report any bugs. |
m Fix page after move |
||
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 A. Wagner|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==
| |||