Prime factorization without using any approximations

DOI10.1007/978-3-642-28926-2_61MaRDI QIDQ5867265zbMATH OpenOpenAlexFDO

Authors

Publication date 13 September 2022

Published in Mathematical Modelling and Scientific Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28926-2_61

zbMATH Keywords

cryptographyprime factorizationRSAsquare root approximation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Prime factorization using square root approximation
• One approach to factorization of positive integers
• A note on the prime factorization method by Nemec et al.
• The joy of factoring
• scientific article; zbMATH DE number 2066372

Cites work

• A monte carlo method for factorization
• Factoring integers with elliptic curves
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• Prime factorization using square root approximation
• Speeding the Pollard and Elliptic Curve Methods of Factorization

Cited in

(1)

• Prime factorization using square root approximation

This page was built for publication: Prime factorization without using any approximations

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