Optimising Gröbner bases on Bivium
From MaRDI portal
Publication:626947
DOI10.1007/s11786-009-0016-7zbMath1205.94081OpenAlexW2079597561MaRDI QIDQ626947
Enrico Pilz, Tobias Eibach, Gunnar Völkel
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-009-0016-7
Cryptography (94A60) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (5)
Stream/block ciphers, difference equations and algebraic attacks ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Attacking Bivium and Trivium with the Characteristic Set Method ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New stream cipher designs. The eSTREAM finalists
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- Slimgb: Gröbner bases with slim polynomials
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Attacking Bivium Using SAT Solvers
- New State Recovery Attack on RC4
- Cube Attacks on Tweakable Black Box Polynomials
- SINGULAR
- The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
- Two Trivial Attacks on Trivium
- Selected Areas in Cryptography
This page was built for publication: Optimising Gröbner bases on Bivium