The quadratic sieve factoring algorithm
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
How to fake an RSA signature by encoding modular root finding as a SAT problem
Discrete Applied Mathematics - The renesse issue on satisfiability
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
In this paper we start an investigation to check the best we can do with SAT encodings for solving two important hard arithmetic problems, integer factorization and discrete logarithm. Given the current success of using SAT encodings for solving problems with linear arithmetic constraints, studying the suitability of SAT for solving non-linear arithmetic problems was a natural step. However, our results indicate that these two problems are extremely hard for state-of-the-art SAT solvers, so they are good benchmarks for the research community interested in finding good SAT encodings for practical constraints.