Journal ArticleOPEN ACCESS

A deterministic algorithm for integer factorization

  • Hiary G
Mathematics of Computation (2015) 85(300) 2065-2069
DOI: 10.1090/mcom3037
6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division. The algorithm is implemented.

Cite

CITATION STYLE

APA

Hiary, G. A. (2015). A deterministic algorithm for integer factorization. Mathematics of Computation, 85(300), 2065–2069. https://doi.org/10.1090/mcom3037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free