Welcome to the resource topic for 2009/123
Title:
On the Complexity of Integer Factorization
Authors: 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.
ePrint: https://eprint.iacr.org/2009/123
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .