A deterministic algorithm for integer factorization

DOI10.1090/mcom3037zbMath1345.11087arXiv1408.2608OpenAlexW2962972839MaRDI QIDQ2796032

Ghaith Ayesh Hiary

Publication date: 23 March 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2608

zbMATH Keywords

computational complexitycontinued fractionsdeterministic algorithminteger factorization

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55) Factorization; primality (11A51) Factorization (11Y05)

Related Items (1)

A log-log speedup for exponent one-fifth deterministic integer factorisation

Uses Software

• Mathematica

Cites Work

• Some results on computational complexity
• Faster deterministic integer factorization
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Divisors in Residue Classes
• Efficient Factoring Based on Partial Information
• Factoring Large Integers
• Turning Euler's Factoring Method into a Factoring Algorithm
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A deterministic algorithm for integer factorization