Note on Integer Factoring Methods IV

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
20 Pages, New Version

Keywords

Number Theory, General Mathematics, 11Y05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/169804

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0802.4242
 http://arxiv.org/abs/0802.4242

Collections

arXiv