Factorization patterns in 3-SAT : Analysis of clause ordering for reductions of the integer factorization problem
Dividing a large integer into factors is a well-known difficult problem that is heavily used in modern cryptography. One approach to achieve faster factorizations is to reduce the Integer factorization problem to another difficult problem, for example the Boolean satisfiability problem. Many studies...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2015
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166431 |