• DocumentCode
    2206829
  • Title

    Distinguishing Attack on Bivium

  • Author

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

  • Author_Institution
    Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran
  • fYear
    2010
  • fDate
    June 29 2010-July 1 2010
  • Firstpage
    1075
  • Lastpage
    1078
  • Abstract
    Bivium is a simplified version of Trivium, a hardware profile finalist of eSTREAM project. Bivium has an internal state of size 177 bits and a key length of 80 bits. In this paper we introduce a distinguishing attack on this cipher. In this method we first find the best linear approximation for the updating function. Then by using this approximation, and optimizing the time delay, we find the distinguisher. The complexity of the attack is O(230.79), which is an improvement to the previous distinguishing attack with a complexity of order O(232).
  • Keywords
    computational complexity; cryptography; Bivium; Trivium; cipher; distinguishing attack; eSTREAM project; linear approximation; time delay; Complexity theory; Cryptography; Delay effects; Hardware; Linear approximation; Bivium; distinguishing attack; eSTREAM; stream cipher;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
  • Conference_Location
    Bradford
  • Print_ISBN
    978-1-4244-7547-6
  • Type

    conf

  • DOI
    10.1109/CIT.2010.196
  • Filename
    5578599
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2206829