Analysis of Trivium using compressed right hand side equations

DOI10.1007/978-3-642-31912-9_2MaRDI QIDQ3168614zbMATH OpenOpenAlexFDO

Authors Thorsten Ernst Schilling, Håvard Raddum

Publication date 1 November 2012

Published in Information Security and Cryptology - ICISC 2011 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1956/6192

zbMATH Keywords

algebraic cryptanalysisBDDmultivariate equation systemTrivium

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Solving compressed right hand side equation systems with linear absorption
• Algebraic attacks on Trivium-like stream ciphers
• Numerical solvers and cryptanalysis
• Advanced algebraic attack on Trivium
• Cube Attacks on Tweakable Black Box Polynomials

Cited in

(5)

• Solving compressed right hand side equation systems with linear absorption
• Hill climbing algorithms and Trivium
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Conditional Cube Searching and Applications on Trivium-Variant Ciphers
• Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath

Describes a project that uses

Uses Software

• FGb

This page was built for publication: Analysis of Trivium using compressed right hand side equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168614)