Cryptanalysis of RSA Using the Ratio of the Primes

DOI10.1007/978-3-642-02384-2_7MaRDI QIDQ3637134zbMATH OpenOpenAlexFDO

Authors Abderrahmane Nitaj

Publication date 7 July 2009

Published in Progress in Cryptology – AFRICACRYPT 2009 (Search for Journal in Brave)

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

zbMATH Keywords

RSAcontinued fractionfactorizationcryptanalysisCoppersmith's method

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Cryptanalysis of RSA with small prime difference
• Cryptanalysis of RSA variants with primes sharing most significant bits
• Cryptanalysis of RSA with small prime combination
• Cryptanalysis of multi-prime RSA with small prime difference
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
• Cryptanalysis of short RSA secret exponents
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
• Cryptanalysis of Dual RSA
• Cryptanalysis of short secret exponents modulo RSA primes.

Cites work

• scientific article; zbMATH DE number 475432 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• A Method of Factoring and the Factorization of F 7
• A method for obtaining digital signatures and public-key cryptosystems
• A monte carlo method for factorization
• Another Generalization of Wiener’s Attack on RSA
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Cryptanalysis of short RSA secret exponents
• Factoring Large Integers
• Factoring integers with elliptic curves
• Public Key Cryptography – PKC 2004
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Multiple Polynomial Quadratic Sieve

Cited in

(5)

• Attacking RSA using an arbitrary parameter
• Implications of the arithmetic ratio of prime numbers for RSA security
• Analyzing Standards for RSA Integers
• Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
• A note on the prime factorization method by Nemec et al.

This page was built for publication: Cryptanalysis of RSA Using the Ratio of the Primes

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