A deterministic algorithm for integer factorization
Copyright policy )A deterministic algorithm for integer factorization
A deterministic algorithm for factoring n n using n 1 / 3 + o ( 1 ) n^{1/3+o(1)} bit operations is presented. The algorithm tests the divisibility of n n by all the integers in a short interval at once rather than integer by integer as in trial division. The algorithm is implemented.
- The Ohio State University United States
- The Ohio State University at Marion United States
computational complexity, Mathematics - Number Theory, Continued fractions, integer factorization, FOS: Mathematics, continued fractions, deterministic algorithm, Number Theory (math.NT), Factorization, Factorization; primality, Number-theoretic algorithms; complexity
computational complexity, Mathematics - Number Theory, Continued fractions, integer factorization, FOS: Mathematics, continued fractions, deterministic algorithm, Number Theory (math.NT), Factorization, Factorization; primality, Number-theoretic algorithms; complexity
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!