Algorithm for factoring some RSA and Rabin moduli

DOI10.1080/09720529.2008.10698205zbMath1172.94579arXiv1303.5226OpenAlexW2963015039MaRDI QIDQ3637783

Omar Khadir

Publication date: 14 July 2009

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

RSARabin cryptosystemFactorization problem

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (2)

The improvement of initial value closer to the target for Fermat’s factorization algorithm ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

Cites Work

• Unnamed Item
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Factoring integers with elliptic curves
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Selecting cryptographic key sizes

This page was built for publication: Algorithm for factoring some RSA and Rabin moduli