Distinguishing Attack on Bivium

Noferesti, Zainab; Rohani, Neda; Mohajeri, Javad; Aref, Mohammad Reza

doi:10.1109/cit.2010.196

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2011

Publication Types

Select...

Article1

Other1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For applying their method, linear statistical methods are applied. In [13], Noferesti et al performed a distinguishing attack with a complexity of order O (2 30.79 ). The current attack is a guess and determine attack with a complexity of O (2 30 ) which is the best among all.…”

Section: Related Workmentioning

confidence: 99%

Guess and Determine Attack on Bivium

Rohani¹,

Noferesti²,

Mohajeri³

et al. 2011

Journal of Information Processing Systems

Self Cite

View full text Add to dashboard Cite

Bivium is a simplified version of Trivium, a hardware profile finalist of the eSTREAM project. Bivium has an internal state size of 177 bits and a key length of 80 bits. In this paper, a guess and determine attack on this cipher is introduced. In the proposed method, the best linear approximations for the updating functions are first defined. Then by using these calculated approximations, a system of linear equations is built. By guessing 30 bits of internal state, the system is solved and all the other 147 remaining bits are determined. The complexity of the attack is O (2 30), which is an improvement to the previous guess and determine attack with a complexity of order O(2 52.3).

show abstract

Section: Related Workmentioning

confidence: 99%