A new method for solving polynomial systems with noise over F₂ and its applications in cold boot key recovery
From MaRDI portal
Publication:3455484
DOI10.1007/978-3-642-35999-6_2zbMATH Open1327.94051OpenAlexW1418908168MaRDI QIDQ3455484FDOQ3455484
Authors: Zhenyu Huang, Dongdai Lin
Publication date: 4 December 2015
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35999-6_2
Recommendations
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- Solving polynomial systems over finite fields: improved analysis of the hybrid approach
- A crossbred algorithm for solving Boolean polynomial systems
- Algebraic Attacks Using IP-Solvers
AESserpentMax-PoSSocharacteristic set methodBoolean equationscold boot attackpolynomial system with noise
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Minimal achievable approximation ratio for MAX-MQ in finite fields
- Basic principles of mechanical theorem proving in elementary geometries
- Characteristic set algorithms for equation solving in finite fields
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^{n}\)
- Attacking Bivium and Trivium with the characteristic set method
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
Cited In (3)
This page was built for publication: A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455484)