Guess and Determine Attack on Bivium


Neda Rohani, Zainab Noferesti, Javad Mohajeri, Mohammad Reza Aref, Journal of Information Processing Systems Vol. 7, No. 1, pp. 151-158, Mar. 2011  

10.3745/JIPS.2011.7.1.151
Keywords: Bivium, Guess and Determine Attack, Stream Ciphers, Linear Approximations, Entropy
Fulltext:

Abstract

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 (230), which is an improvement to the previous guess and determine attack with a complexity of order O(252.3).


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Neda Rohani, Zainab Noferesti, Javad Mohajeri, & Mohammad Reza Aref (2011). Guess and Determine Attack on Bivium. Journal of Information Processing Systems, 7(1), 151-158. DOI: 10.3745/JIPS.2011.7.1.151 .

[IEEE Style]
N. Rohani, Z. Noferesti, J. Mohajeri and M. R. Aref, "Guess and Determine Attack on Bivium," Journal of Information Processing Systems, vol. 7, no. 1, pp. 151-158, 2011. DOI: 10.3745/JIPS.2011.7.1.151 .

[ACM Style]
Neda Rohani, Zainab Noferesti, Javad Mohajeri, and Mohammad Reza Aref. 2011. Guess and Determine Attack on Bivium. Journal of Information Processing Systems, 7, 1, (2011), 151-158. DOI: 10.3745/JIPS.2011.7.1.151 .