Mod n cryptanalysis

<p>In <a href="/facts/Cryptography/e94PEVau">cryptography</a>, mod n cryptanalysis is an <a href="/facts/Cryptanalysis/7CPEQlJI">attack</a> applicable to <a href="/facts/Block_cipher/MJywAyfQ">block</a> and <a href="/facts/Stream_cipher/BxU0aWmJ">stream ciphers</a>. It is a form of <a href="/facts/Partitioning_cryptanalysis/gu42vrEC">partitioning cryptanalysis</a> that exploits unevenness in how the <a href="/facts/Cipher/eJnuftYe">cipher</a> operates over <a href="/facts/Equivalence_class/1d2sh0TB">equivalence classes</a> (congruence classes) <a href="/facts/Modular_arithmetic/0wtRa5dU">modulo n</a>. The method was first suggested in 1999 by <a href="/facts/John_Kelsey_(cryptanalyst)/nI1QmqhJ">John Kelsey</a>, <a href="/facts/Bruce_Schneier/kWxPFPmQ">Bruce Schneier</a>, and <a href="/facts/David_A._Wagner/ewC269Uo">David Wagner</a> and applied to RC5P (a variant of <a href="/facts/RC5/RjIGUnNk">RC5</a>) and <a href="/facts/M6_(cipher)/P2DGS3df">M6</a> (a family of block ciphers used in the <a href="/facts/FireWire/XYdQlxfy">FireWire</a> standard). These attacks used the properties of binary addition and bit rotation modulo a <a href="/facts/Fermat_prime/SJT8fN9m">Fermat prime</a>.
</p>

Mod n cryptanalysis open-in-new

Mod n cryptanalysis