Paper 2009/123

On the Complexity of Integer Factorization

N. A. Carella

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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/123,
      author = {N.  A.  Carella},
      title = {On the Complexity of Integer Factorization},
      howpublished = {Cryptology ePrint Archive, Paper 2009/123},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/123}},
      url = {https://eprint.iacr.org/2009/123}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.