Algebraic Attack Against Trivium - Archive ouverte HAL
Communication Dans Un Congrès Année : 2008

Algebraic Attack Against Trivium

Résumé

Trivium is a synchronous stream cipher designed to provide a flexible trade-off between speed and gate count in hardware, and reasonably efficient software implementation. It was designed in 2005 by C. De Cannière and B. Preneel for the European project eSTREAM. It has successfully moved into phase two of the selection process and is currently in the focus group under the hardware category. As of yet there has been no attack on Trivium faster than exhaustive search. Bivium-A and Bivium-B are truncated versions of Trivium that are built on the same design principles. These simplified versions are used for investigating Trivium-like ciphers with a reduced complexity. There have been successful attempts in the cryptanalysis of Bivium ciphers. The goal of this paper is to compare a basic Gröbner basis attack against these ciphers with other known methods. To do so, we present some experimental results.
Fichier non déposé

Dates et versions

hal-01305667 , version 1 (21-04-2016)

Identifiants

  • HAL Id : hal-01305667 , version 1

Citer

Ilaria Simonetti, Jean-Charles Faugère, Ludovic Perret. Algebraic Attack Against Trivium. First International Conference on Symbolic Computation and Cryptography, SCC 08, Apr 2008, Beijing, China. pp.95-102. ⟨hal-01305667⟩
124 Consultations
0 Téléchargements

Partager

More