Algebraic Attacks Using IP-Solvers
From MaRDI portal
(Redirected from Algebraic Attacks Using IP-Solvers)
Recommendations
- Algebraic attacks using SAT-solvers
- Algebraic side-channel attacks
- Fast Software Encryption
- Cryptography and Coding
- Algebraic attacks on Rasta and Dasta using low-degree equations
- Guess-and-determine attack and algebraic attack
- Algebraic attacks from a Groebner basis perspective
- Algebraic attacks using binary decision diagrams
Cited in
(8)- MRHS solver based on linear algebra and exhaustive search
- Using SAT solvers in large scale distributed algebraic attacks against low entropy keys
- Algebraic attacks using binary decision diagrams
- Algebraic attacks using SAT-solvers
- A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
- scientific article; zbMATH DE number 7211469 (Why is no real title available?)
- Cryptography and Coding
- An enhanced binary characteristic set algorithm and its applications to algebraic cryptanalysis
This page was built for publication: Algebraic Attacks Using IP-Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168491)