Paper 2009/123 Original: eprint.iacr.org/2009/123 ↗
On the Complexity of Integer Factorization
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
- Preprint.
- History
- 2009-03-20: last updated
- 2009-03-20: published
- Short URL
- https://ia.cr/2009/123
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2009/123}
}