The South Caicos factoring algorithm

zbMATH Open1454.11224arXiv2005.07391MaRDI QIDQ5148802FDOQ5148802

Authors: Michael O. Rubinstein 

Publication date: 5 February 2021

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.

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

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

zbMATH Keywords

probabilistic algorithmfactoring algorithm

Mathematics Subject Classification ID

Factorization (11Y05)

Cites Work

• Title not available (Why is that?)
• 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)