Integer factorization as subset-sum problem
This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer factorization to a specific instance of the multiple choice subset-su...
Saved in:
| Published in: | Journal of number theory Vol. 249; pp. 93 - 118 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.08.2023
|
| Subjects: | |
| ISSN: | 0022-314X, 1096-1658 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!