@article {IOPORT.05853504,
    author       = {Eibach, Tobias and V\"olkel, Gunnar and Pilz, Enrico},
    title        = {Optimising Gr\"obner bases on Bivium.},
    year         = {2010},
    journal      = {Mathematics in Computer Science},
    volume       = {3},
    number       = {2},
    issn         = {1661-8270},
    pages        = {159-172},
    publisher    = {Birkh\"auser (Springer), Basel},
    doi          = {10.1007/s11786-009-0016-7},
    abstract     = {Summary: Bivium is a reduced version of the stream cipher Trivium. In this paper we investigate how fast a key recovery attack on Bivium using Gr\"obner bases is. First we explain the attack scenario and the cryptographic background. Then we identify the factors that have impact on the computation time and show how to optimise them. As a side effect these experiments benchmark several Gr\"obner basis implementations. The optimised version of the Gr\"obner attack has an expected running time of $2^{39.12}$ s, beating the attack time of our previous SAT solver attack by a factor of more than 330. Furthermore this approach is faster than an attack based on BDDs, an exhaustive key search, a generic time-memory trade-off attack and a guess-and-determine strategy.},
    identifier   = {05853504},
}