Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles

By Christophe De Cannière. Information Security Conference, 2006

397 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Extending SAT Solvers to Cryptographic Problems (2009, background): “Using Gaussian elimination, solving Bivium and Trivium is faster by 1-5% if we restrict the search depth to between 1 and 8, depending on the number of guessed bits.”
spongent: A Lightweight Hash Function (2011, background): “Once this research problem was identified, the cryptographic community designed a number of tailored lightweight cryptographic algorithms to specifically address this challenge: stream ciphers like Trivium [12,10], Grain [13,14], and Mickey [2] as well as block ciphers like SEA [26], DESL, DESXL [21”
Cube Attacks on Tweakable Black Box Polynomials (2009, methodology): “Other types of stream ciphers such as Trivium (see [21]) include a small amount of nonlinearity in the feedback of the shift register, and thus the degree of the output polynomial grows slowly over time.”