You are looking at a specific version 20090320:135355 of this paper.
See the latest version.
Paper 2009/123
On the Complexity of Integer Factorization
N. A. Carella, CUNY, N.Y.
Abstract
This note presents a deterministic integer factorization algorithm based on a system of polynomial equations. The main result establishes a new deterministic time complexity bench mark.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Integer FactorizationLLL AlgorithmPolynomial Equations
- Contact author(s)
- pobox5050 @ gmail com
- History
- 2009-03-20: received
- Short URL
- https://ia.cr/2009/123
- License
-
CC BY
