Algorithm for factoring some RSA and Rabin moduli
From MaRDI portal
Abstract: In this paper we present a new efficient algorithm for factoring the RSA and the Rabin moduli in the particular case when the difference between their two prime factors is bounded. As an extension, we also give some theoretical results on factoring integers.
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A monte carlo method for factorization
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Factoring integers with elliptic curves
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Selecting cryptographic key sizes
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Cited in
(8)- A cubic RSA code equivalent to factorization
- Strategy of relations collection in factoring RSA modulus
- Breaking RSA may not be equivalent to factoring
- scientific article; zbMATH DE number 2162228 (Why is no real title available?)
- Forty years of attacks on the RSA cryptosystem: a brief survey
- The improvement of initial value closer to the target for Fermat's factorization algorithm
- scientific article; zbMATH DE number 2219412 (Why is no real title available?)
- scientific article; zbMATH DE number 2230939 (Why is no real title available?)
This page was built for publication: Algorithm for factoring some RSA and Rabin moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637783)