1999
DOI: 10.1007/3-540-48519-8_2
|View full text |Cite
|
Sign up to set email alerts
|

Linear Cryptanalysis of RC5 and RC6

Abstract: Abstract. In this paper we evaluate the resistance of the block cipher RC5 against linear cryptanalysis. We describe a known plaintext attack that can break RC5-32 (blocksize 64) with 10 rounds and RC5-64 (blocksize 128) with 15 rounds. In order to do this we use techniques related to the use of multiple linear approximations. Furthermore the success of the attack is largely based on the linear hull-effect. To our knowledge, at this moment these are the best known plaintext attacks on RC5, which have negligibl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
26
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 31 publications
(29 citation statements)
references
References 13 publications
3
26
0
Order By: Relevance
“…practical) block sizes. We note that it is not necessarily the case for block ciphers with a more "exotic" structure, as illustrated in the case of RC5 and RC6 in [4,30,31]. On the other hand, experiments by Selçuk [31] on SP-structured Feistel ciphers seem to match ours.…”
Section: Testing the Key Equivalence Hypothesissupporting
confidence: 54%
“…practical) block sizes. We note that it is not necessarily the case for block ciphers with a more "exotic" structure, as illustrated in the case of RC5 and RC6 in [4,30,31]. On the other hand, experiments by Selçuk [31] on SP-structured Feistel ciphers seem to match ours.…”
Section: Testing the Key Equivalence Hypothesissupporting
confidence: 54%
“…An estimate of the number of plaintexts required to mount an attack on RC5 and RC6 with varying number of rounds can be used to quantify security strength [27], [28]. time and resources required for the attacker to successfully mount a cryptanalysis attack on the system should be considerably (often, exponentially) more than the time and resources required for encryption/decryption.…”
Section: Tablementioning
confidence: 99%
“…Coefficients α i and ω i are constants and depend on the importance of each application (determined by the system designer) as well as the word size [27] and the length of the encryption key [23], [28]. Motivated by the results in Table 1 [27]- [29], and as shown graphically in Figure 2, the exponent (α i r i + ω i ) is modeled as a linear function of r i .…”
Section: Tablementioning
confidence: 99%
See 2 more Smart Citations