An Algebraic analysis of trivium ciphers based on the boolean satisfiability problem

Cameron Mcdonald, Chris Charnes, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationBFCA'08
Subtitle of host publicationProceedings of Fourth International Workshop on Boolean Functions : Cryptography and Applications
EditorsO. Masnyk-Hansen, J-F. Michon, P. Valarcher, J-B. Yunès
Pages173-184
Number of pages12
Publication statusPublished - 2008
EventInternational Workshop on Boolean Functions : Cryptography and Applications (4th : 2008) - Copenhagen
Duration: 19 May 200821 May 2008

Workshop

WorkshopInternational Workshop on Boolean Functions : Cryptography and Applications (4th : 2008)
CityCopenhagen
Period19/05/0821/05/08

Keywords

  • algebraic analysis
  • boolean satisfiability
  • trivium
  • eStream

Fingerprint

Dive into the research topics of 'An Algebraic analysis of trivium ciphers based on the boolean satisfiability problem'. Together they form a unique fingerprint.

Cite this