New Attacks on RSA with Moduli N = p r q

DOI10.1007/978-3-319-18681-8_28zbMath1441.94089OpenAlexW1906034323MaRDI QIDQ2947095

Abderrahmane Nitaj, Tajjeeddine Rachidi

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18681-8_28

zbMATH Keywords

RSAfactorizationcryptanalysisprime power RSACoppersmith's method

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Improved Results on Cryptanalysis of Prime Power RSA ⋮ A new public key cryptosystem based on Edwards curves

Cites Work

• Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
• The development of the number field sieve
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Cryptanalysis of RSA and Its Variants
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Public Key Cryptography – PKC 2004
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item

This page was built for publication: New Attacks on RSA with Moduli N = p r q