Note on Integer Factoring Algorithms II
| dc.creator | Carella, N. A. | |
| dc.date | 2007-02-08 | |
| dc.date.accessioned | 2026-07-07T07:45:37Z | |
| dc.date.available | 2026-07-07T07:45:37Z | |
| dc.description | This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed. | |
| dc.description | 23 Pages | |
| dc.identifier | https://arxiv.org/abs/math/0702227 | |
| dc.identifier | http://arxiv.org/abs/math/0702227 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/123586 | |
| dc.subject | Number Theory | |
| dc.subject | General Mathematics | |
| dc.subject | 11Y05, 11D09 | |
| dc.title | Note on Integer Factoring Algorithms II | |
| dc.type | text |