Factoring semi-primes with (quantum) SAT-solvers
Abstract The computational difficulty of factoring large integers forms the basis of security for RSA public-key cryptography. The best-known factoring algorithms for classical computers run in sub-exponential time. The integer factorization problem can be reduced to the Boolean Satisfiability probl...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Nature Portfolio
2022-05-01
|
| Seri Bilgileri: | Scientific Reports |
| Online Erişim: | https://doi.org/10.1038/s41598-022-11687-7 |