Mod n cryptanalysis: Difference between revisions

Revision as of 01:12, 19 May 2019

Latest revision as of 17:18, 19 December 2024

(4 intermediate revisions by 4 users not shown)

Line 1:

{{DISPLAYTITLE:Mod {{Mvar|n}} cryptanalysis}}

{{Short description|Attack applicable to block and stream ciphers}}

{{no footnotes|date=August 2017}}

In [[cryptography]], '''mod ''{{Mvar|n''}} cryptanalysis''' is an [[cryptanalysis|attack]] applicable to [[block cipher|block]] and [[stream cipher]]s. It is a form of [[partitioning cryptanalysis]] that exploits unevenness in how the [[cipher]] operates over [[equivalence class]]es (congruence classes) [[modular arithmetic|modulo ''{{Mvar|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==

Line 11 ⟶ 13:

: <math>2^{32} \equiv 1\pmod 3,\,</math>

weit can deducefollows that

: <math>X \lll 1 \equiv 2X\pmod 3.</math>

Line 30 ⟶ 32:

| url = http://www.schneier.com/paper-mod3.html

| format = [[PDF]]/[[PostScript]]

| accessdateaccess-date = 2007-02-12 }}

* {{cite journal

| author = [[Vincent Rijmen]]

Line 38 ⟶ 40:

| date = 2003-12-01

| url = http://www.cryptico.com/Files/filer/wp_modn_analysis.pdf

| formataccess-date = PDF2007-02-12 }}

| accessdate = 2007-02-12 }}

* {{cite journal

|author1=Toshio Tokita |author2=Tsutomu Matsumoto | title = On Applicability of Differential Cryptanalysis, Linear Cryptanalysis and Mod n Cryptanalysis to an Encryption Algorithm [[M8 (cipher)|M8]] (ISO9979-20)