dorsal/arxiv
View SchemaFast Factoring of Integers
| Authors | Gordon Chalmers |
|---|---|
| Categories | |
| ArXiv ID | physics/0503159 |
| URL | https://arxiv.org/abs/physics/0503159 |
Abstract
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.
{
"annotation_id": "49b43621-2e3f-4f19-90f8-7002138156b4",
"date_created": "2026-03-02T18:00:57.377000Z",
"date_modified": "2026-03-02T18:00:57.377000Z",
"file_hash": "e6d298191bb2f2929e6851e388f5b84d1f09747a231c686392856541ab123fda",
"private": false,
"record": {
"abstract": "An algorithm is given to factor an integer with $N$ digits in $\\ln^m N$\nsteps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are\nexponentially slower. An improvement with the aid of an a particular function\nwould provide a further exponential speedup.",
"arxiv_id": "physics/0503159",
"authors": [
"Gordon Chalmers"
],
"categories": [
"physics.gen-ph"
],
"title": "Fast Factoring of Integers",
"url": "https://arxiv.org/abs/physics/0503159"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "34ff44e3-4b3f-4200-be13-244f6fa49657",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}