Note on Integer Factoring Methods IV
Number Theory
2008-09-26 v2 General Mathematics
Abstract
This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.
Cite
@article{arxiv.0802.4242,
title = {Note on Integer Factoring Methods IV},
author = {N. A. Carella},
journal= {arXiv preprint arXiv:0802.4242},
year = {2008}
}
Comments
20 Pages, New Version