Fast Factoring of Integers
| dc.creator | Chalmers, Gordon | |
| dc.date | 2005-03-18 | |
| dc.date | 2005-09-20 | |
| dc.date.accessioned | 2026-07-07T06:18:35Z | |
| dc.date.available | 2026-07-07T06:18:35Z | |
| dc.description | An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a further exponential speedup. | |
| dc.description | 8 pages, LaTeX, v1: correction to a_{C_N}\neq 1 and improved analysis to general case, v2: added addendum paper to original analysis | |
| dc.identifier | https://arxiv.org/abs/physics/0503159 | |
| dc.identifier | http://arxiv.org/abs/physics/0503159 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/94782 | |
| dc.subject | General Physics | |
| dc.title | Fast Factoring of Integers | |
| dc.type | text |