Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / Integer Factorization, LLL Algorithm, Polynomial Equations

Date: received 10 Feb 2009

Contact author: pobox5050 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20090320:135355 (All versions of this report)

Short URL: ia.cr/2009/123

Discussion forum: Show discussion | Start new discussion