Proceedings of the 6th International Conference on Security of Information and Networks 2013
DOI: 10.1145/2523514.2523615
|View full text |Cite
|
Sign up to set email alerts
|

Cryptanalysis of RC4(n, m) stream cipher

Abstract: Abstract. RC4(n, m) is a stream cipher based on RC4 and is designed by G. Gong et al.. It can be seen as a generalization of the famous RC4 stream cipher designed by Ron Rivest. The authors of RC4(n, m) claim that the cipher resists all the attacks that are successful against the original RC4. The paper reveals cryptographic weaknesses of the RC4(n, m) stream cipher. We develop two attacks. The first one is based on non-randomness of internal state and allows to distinguish it from a truly random cipher by an … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…In [32], Jindal et al proposed three improved RC4 algorithms based on RC4+, which improve the randomness of key stream and shortened the encryption time. In [33], Orumiehchiha et al summarized the merits and demerits of RC4(n, m) algorithm and proposed a key recovery attack method to crack the RC4(n, m) state.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [32], Jindal et al proposed three improved RC4 algorithms based on RC4+, which improve the randomness of key stream and shortened the encryption time. In [33], Orumiehchiha et al summarized the merits and demerits of RC4(n, m) algorithm and proposed a key recovery attack method to crack the RC4(n, m) state.…”
Section: Related Workmentioning
confidence: 99%
“…With the development of distributed technology, the efficiency of brute force attacks will be further improved. MedSecrecy algorithm adopts a 512 bytes key length which is 2 times longer than that of RC4 [18], RC4(n, m) [33], RC4+ [31], RC4-M2 [32], RC4-2S [34]. Note that our algorithm employs the double S-box, double key scrambling and double key cross zigzag replacement methods.…”
Section: E: Brute Force Attackmentioning
confidence: 99%
“…The RC4 algorithm was proposed by Ron Rivest in 1987 and kept secret as a trade until it was leaked in 1994 [10]. It is a set of stream words of size n-bits [11]. RC4 starts with the permutation and uses a secret key to produce a random permutation with KSA.…”
Section: Description Of Rc4 Ciphermentioning
confidence: 99%
“…It is very fast and simple in design [16]. The internal state is an array S of (2n words) [17]. RC4 has a variable length of the key that ranges between (0 -255) bytes for initializing an array of 256 bytes in the initial state (State [0] to State [255]) [2].RC4 is carried out in two phases: The first is the key scheduling algorithm (KSA).…”
Section: Rc4 Descriptionmentioning
confidence: 99%