Cryptanalysis of RSA Using the Ratio of the Primes

DOI10.1007/978-3-642-02384-2_7zbMath1246.94037OpenAlexW1510583321MaRDI QIDQ3637134

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

RSAfactorizationcryptanalysiscontinued fractionCoppersmith's method

Mathematics Subject Classification ID

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

Related Items (1)

Attacking RSA Using an Arbitrary Parameter

Cites Work

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

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