Cryptanalysis of MV3 Stream Cipher

Orumiehchi, M.A.; Mohebbipoor, S. Fahimeh; Ghodosi, Hossein

doi:10.1007/978-3-540-89641-8_17

Cited by 1 publication

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we extended the technique, allowing it to handle more complicated update and output rules, and used it to mount a distinguishing attack on the cipher mv3 [9], requiring less than 2 82 words of output. 10 The values of the 22 optimal quadruples (i 1 , i 1 + l, i 2 , i 2 + l) are: (0, 1, 14, 15), (0, 1, 18, 19), (1,2,15,16), (3,4,21,22), (4,5,18,19), (4,5,22,23), (5,6,19,20), (5,6,23,24), (6,7,20,21), (6,7,24,25), (7,8,21,22), (7,8,25,26), (8,9,22,23), (8,9,26,27), (9,10,…”

Section: Discussionmentioning

confidence: 99%

“…The material in Section 4 concerns an attack on the mv3 stream cipher. After writing up a description of our results, we learned that essentially identical arguments -but with important miscalculations -had simultaneously been published in [15]. For the sake of completeness we include an appendix reconciling the two attacks.…”

Section: Introductionmentioning

confidence: 94%

“…In this appendix we examine the attacks on sn3 and mv3 presented in [14] and [15], respectively, and show that their correct data complexities are 2 …”

Section: A Appendixmentioning

confidence: 99%

“…footnote on the first page, this attack was independently codiscovered in [15], but with a mistaken complexity estimate. No other cryptographic attacks on the cipher have been presented thus far.…”

mentioning

confidence: 99%

“…In Section 4 we present the attack on mv3. In the appendix we discuss the flaws in the attacks presented in [14] and [15].…”

mentioning

confidence: 99%

See 4 more Smart Citations

Distinguishing attacks on stream ciphers based on arrays of pseudo-random words

Keller

Miller

2010

Information Processing Letters

View full text Add to dashboard Cite

In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In [16], it was heuristically shown that in various cases this structure may lead to distinguishing attacks on the cipher. In this paper we further investigate this structural attack. We present a rigorous proof of the main probabilistic claim used in the attack in the basic cases, and demonstrate by examining a concrete example (the cipher sn3 [11]) that the heuristic assumptions of the attack are remarkably precise in more complicated cases. Furthermore, we use the general technique to devise a distinguishing attack on the stream cipher mv3 [9] requiring 2 82 words of key-stream. Unlike the attacks in [16], our attack does not concentrate on the least significant bits of the words, thus allowing to handle the combination of more operations (xors, modular additions and multiplications, and rotations by a fixed number of bits) in the update and output rules of the cipher. * This is the full version of a paper submitted for publication in a journal, which contains only Sections 1, 2, and 3. The material in Section 4 concerns an attack on the mv3 stream cipher. After writing up a description of our results, we learned that essentially identical arguments -but with important miscalculations -had simultaneously been published in [15]. For the sake of completeness we include an appendix reconciling the two attacks. See footnote 2 for similar comments on the sn3 stream cipher.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 94%

“…In this appendix we examine the attacks on sn3 and mv3 presented in [14] and [15], respectively, and show that their correct data complexities are 2 …”

Section: A Appendixmentioning

confidence: 99%

mentioning

confidence: 99%

“…In Section 4 we present the attack on mv3. In the appendix we discuss the flaws in the attacks presented in [14] and [15].…”

mentioning

confidence: 99%

See 3 more Smart Citations