2013
DOI: 10.1016/j.camwa.2012.09.013
|View full text |Cite
|
Sign up to set email alerts
|

Novel strategies for searching RC4 key collisions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…A new state transition sequence of the key scheduling algorithm is shown which is used with a related key pair of an arbitrary fixed length, thus leading to key collision problems. Another key collision work on RC4 has been researched in [16], and attack on RC4 (n,m) has been shown in [17]. The authors show two attacks: one is based on non-randomness of internal state, and which allows it to be distinguishes from a truly random cipher.…”
Section: The Rc4 Methodsmentioning
confidence: 99%
“…A new state transition sequence of the key scheduling algorithm is shown which is used with a related key pair of an arbitrary fixed length, thus leading to key collision problems. Another key collision work on RC4 has been researched in [16], and attack on RC4 (n,m) has been shown in [17]. The authors show two attacks: one is based on non-randomness of internal state, and which allows it to be distinguishes from a truly random cipher.…”
Section: The Rc4 Methodsmentioning
confidence: 99%
“…The data of statistics show that the RC4 algorithm is used to protect 50% of TLS traffic as the most widely used secure communication protocol on the internet nowadays [21]. RC4 has a secret internal state and works by generating the pseudorandom stream of bits [22]. The internal state of RC4 consists of an S-box array permutation of 256 bytes from the number 0...., N -1 and two indices i, j ∈ {0,. .…”
Section: Introductionmentioning
confidence: 99%