The South Caicos factoring algorithm

MaRDI QIDQ5148802zbMATH OpenFDO

Authors Michael O. Rubinstein

Publication date 5 February 2021

Full work available at URL https://arxiv.org/abs/2005.07391, http://math.colgate.edu/~integers/v4/v4.pdf

zbMATH Keywords

probabilistic algorithmfactoring algorithm

Mathematics Subject Classification ID

Factorization (11Y05)

Abstract: Let $N=UV$, where $U,V$ are integers, with $1<U,V<N$, and $gcd(U,V)=1$. We describe a probabilistic algorithm for factoring $N$ using $O(max(U,V{)}^{1/2+epsilon})$ bit operations.

Recommendations

• A deterministic algorithm for integer factorization
• Asymptotically Fast Factorization of Integers
• scientific article; zbMATH DE number 475432
• scientific article; zbMATH DE number 475434
• scientific article; zbMATH DE number 3959522

Cites work

• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• The distribution of solutions to \(XN=N \pmod a\) with an application to factoring integers

This page was built for publication: The South Caicos factoring algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148802)