A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium

DOI10.1016/J.FFA.2024.102452MaRDI QIDQ6597203zbMATH OpenFDO

Authors Roberto La Scala, Federico Pintore, Sharwan K. Tiwari, Andrea Visconti

Publication date 3 September 2024

Published in Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

finite fieldscryptanalysispolynomial system solving

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Difference algebra (12H10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Solving polynomial systems; resultants (13P15)

Recommendations

• Guess-and-determine attack and algebraic attack
• Hybrid approach for solving multivariate systems over finite fields
• Algebraic attacks on Trivium-like stream ciphers
• Attacking Bivium and Trivium with the characteristic set method
• Cube Attacks on Tweakable Black Box Polynomials

Cites work

• scientific article; zbMATH DE number 3586510 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• A note on Nullstellensatz over finite fields
• Advances in Cryptology - CRYPTO 2003
• Algebraic Cryptanalysis
• Algebraic Cryptanalysis of the Data Encryption Standard
• An algebraic attack to the Bluetooth stream cipher \textsc{E0}
• Attacking Bivium and Trivium with the characteristic set method
• Characteristic set algorithms for equation solving in finite fields
• Correcting errors and erasures via the syndrome variety
• Cube Attacks on Tweakable Black Box Polynomials
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Hybrid approach for solving multivariate systems over finite fields
• Introduction to Mathematics of Satisfiability
• Introduction to modern cryptography
• Involutive bases of polynomial ideals
• Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals
• On the complexity of solving quadratic Boolean systems
• On the discrete logarithm problem for prime-field elliptic curves
• Polynomial automorphisms and the Jacobian conjecture
• Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
• Solving multivariate polynomial systems and an invariant from commutative algebra
• Solving polynomial systems over finite fields: improved analysis of the hybrid approach
• Stream/block ciphers, difference equations and algebraic attacks
• Stretching cube attacks: improved methods to recover massive superpolies
• The Structure of Polynomial Ideals and Gröbner Bases

This page was built for publication: A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium

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