SAT and lattice reduction for integer factorization
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology – CRYPTO 2004
- Building bridges between symbolic computation and satisfiability checking
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Editorial: Symbolic computation and satisfiability checking
- Every Prime Has a Succinct Certificate
- Factoring as a service
- Factoring polynomials with rational coefficients
- Finding periodic apartments via Boolean satisfiability and orderly generation
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1113991 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 3325539 (Why is no real title available?)
- IPASIR-up: user propagators for CDCL
- Lattice-based integer factorisation: an introduction to Coppersmith's method
- Learning rate based branching heuristic for SAT solvers
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
- MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
- Mathematics of public key cryptography.
- Modern computer algebra
- New ways to multiply \(3 \times 3\)-matrices
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Reconstructing RSA Private Keys from Random Key Bits
- SAT-based generation of panar graphs
- Satisfiability checking and symbolic computation
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- The development of the number field sieve
- The Unique Factorization Theorem: From Euclid to Gauss
This page was built for publication: SAT and lattice reduction for integer factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033519)
