Prime factorization using square root approximation

DOI10.1016/J.CAMWA.2011.02.027zbMath1221.94074OpenAlexW2054570290MaRDI QIDQ639053

Joseph Hajj-Boutros, Joseph Zalaket

Publication date: 18 September 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.02.027

zbMATH Keywords

RSAcryptographyinteger factorizationprime factorization

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (1)

Prime Factorization without Using Any Approximations

Cites Work

• Unnamed Item
• Factoring integers with elliptic curves
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• A p + 1 Method of Factoring
• A monte carlo method for factorization
• Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve

This page was built for publication: Prime factorization using square root approximation