A deterministic algorithm for integer factorization

Ghaith A. Hiary

A deterministic algorithm for integer factorization

Number Theory 2016-08-01 v3

Authors: Ghaith A. Hiary

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.

Keywords

computational complexity matrix algorithms fast fourier transform

Cite

@article{arxiv.1408.2608,
  title  = {A deterministic algorithm for integer factorization},
  author = {Ghaith A. Hiary},
  journal= {arXiv preprint arXiv:1408.2608},
  year   = {2016}
}

Comments

5 pages

Related papers

View all related →