An algebraic analysis of trivium ciphers based on the boolean satisfiability problem
McDonald, Cameron, Charnes, Chris, & Pieprzyk, Josef (2008) An algebraic analysis of trivium ciphers based on the boolean satisfiability problem. In Masnyk-Hansen, Olga, Michon, Jean-Francis, Valarcher, Pierre, & Yunes, Jean-Baptiste (Eds.) Proceedings of the 4th International Workshop on Boolean Functions : Cryptography and Applications, Copenhagen, Denmark, pp. 173-184.
Trivium is a stream cipher candidate of the eStream project. It has successfully moved into phase three of the selection process under the hardware category. No attacks faster than the exhaustive search have so far been reported on Trivium. Bivium-A and Bivium-B are simplified versions of Trivium that are built on the same design principles but with two registers. The simplified design is useful in investigating Trivium type ciphers with a reduced complexity and provides insight into effective attacks which could be extended to Trivium. This paper focuses on an algebraic analysis which uses the boolean satisfiability problem in propositional logic. For reduced variants of the cipher, this analysis recovers the internal state with a minimal amount of keystream observations.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Conference Paper|
|Keywords:||Algebraic analysis, Boolean satisfiability|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DATA FORMAT (080400)|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2008 Please consult the authors|
|Deposited On:||22 Apr 2014 04:42|
|Last Modified:||30 Apr 2014 01:48|
Repository Staff Only: item control page