A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery
From MaRDI portal
Publication:3455484
DOI10.1007/978-3-642-35999-6_2zbMath1327.94051OpenAlexW1418908168MaRDI QIDQ3455484
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
Boolean equationsAESserpentMax-PoSSocharacteristic set methodcold boot attackpolynomial system with noise
Related Items (3)
On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
Cites Work
- Characteristic set algorithms for equation solving in finite fields
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Minimal achievable approximation ratio for MAX-MQ in finite fields
- Basic principles of mechanical theorem proving in elementary geometries
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Attacking Bivium and Trivium with the Characteristic Set Method
- Satisfying Degree-d Equations over GF[2 n]
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
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