A deterministic algorithm for integer factorization
classification
🧮 math.NT
keywords
algorithmintegerdeterministicdivisibilitydivisionfactoringfactorizationimplemented
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.