Solving Trivium-based Boolean Equations Using the Method of Syllogisms

Authors:
Pavol Zajac
Affiliations:
(Correspd.) Department of Applied Informatics and IT, Slovak University of Technology, Bratislava, Slovakia. pavol.zajac@stuba.sk
Venue:
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Year:
2012

Citing 3
Cited 0

Algebraic Cryptanalysis

Algebraic Cryptanalysis
Two trivial attacks on TRIVIUM

SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Improved algebraic cryptanalysis of QUAD, Bivium and Trivium via graph partitioning on equation systems

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

The article examines a practical application of the method of syllogisms to solve a system of Boolean equations arising in the cryptanalysis of the stream cipher Trivium. Experimental results show that different guessing strategies lead to significantly different complexities of generic attacks. A new experimental approach is presented that can be used to estimate lower bounds on the complexity of such attacks. (This material is based upon work supported under the grant NIL-I-004 from Iceland, Liechtenstein and Norway through the EEA Financial Mechanism and the Norwegian Financial Mechanism, and under the grant VEGA 1/0244/09.)