Mod n cryptanalysis, with applications against RC5P and M6

40Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We demonstrate this attack with a mod 3 attack against RC5P, an RC5 variant that uses addition instead of XOR. We also show mod 5 and mod 257 attacks against some versions of a family of ciphers used in the FireWire standard. We expect mod n cryptanalysis to be applicable to many other ciphers, and that the general attack is extensible to other values of n.

References Powered by Scopus

Linear cryptanalysis method for DES cipher

1914Citations
N/AReaders
Get full text

Markov ciphers and differential cryptanalysis

428Citations
N/AReaders
Get full text

The RC5 encryption algorithm

386Citations
N/AReaders
Get full text

Cited by Powered by Scopus

How far can we go beyond linear cryptanalysis?

162Citations
N/AReaders
Get full text

Rotational cryptanalysis of ARX

89Citations
N/AReaders
Get full text

Multiplicative differentials

50Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kelsey, J., Schneier, B., & Wagner, D. (1999). Mod n cryptanalysis, with applications against RC5P and M6. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1636, pp. 139–155). Springer Verlag. https://doi.org/10.1007/3-540-48519-8_11

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 29

69%

Researcher 7

17%

Professor / Associate Prof. 3

7%

Lecturer / Post doc 3

7%

Readers' Discipline

Tooltip

Computer Science 35

85%

Engineering 3

7%

Mathematics 2

5%

Design 1

2%

Save time finding and organizing research with Mendeley

Sign up for free