A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium
From MaRDI portal
Publication:6597203
DOI10.1016/J.FFA.2024.102452MaRDI QIDQ6597203
Roberto La Scala, Federico Pintore, Andrea Visconti, Sharwan K. Tiwari
Publication date: 3 September 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Difference algebra (12H10) Solving polynomial systems; resultants (13P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characteristic set algorithms for equation solving in finite fields
- Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals
- Correcting errors and erasures via the syndrome variety
- Stream/block ciphers, difference equations and algebraic attacks
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Involutive bases of polynomial ideals
- Polynomial automorphisms and the Jacobian conjecture
- On the discrete logarithm problem for prime-field elliptic curves
- On the complexity of solving quadratic Boolean systems
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Attacking Bivium and Trivium with the Characteristic Set Method
- SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
- Introduction to Mathematics of Satisfiability
- Hybrid approach for solving multivariate systems over finite fields
- The Structure of Polynomial Ideals and Gröbner Bases
- Algebraic Cryptanalysis
- Cube Attacks on Tweakable Black Box Polynomials
- A note on Nullstellensatz over finite fields
- Solving polynomial systems over finite fields
- Advances in Cryptology - CRYPTO 2003
- Algebraic Cryptanalysis of the Data Encryption Standard
- Stretching cube attacks: improved methods to recover massive superpolies
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)