An Improved Analysis on Three Variants of the RSA Cryptosystem

DOI10.1007/978-3-319-54705-3_9zbMath1379.94047OpenAlexW2594022243MaRDI QIDQ2980851

Liqiang Peng, Lei Hu, Yao Lu, Hongyun Wei

Publication date: 5 May 2017

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_9

zbMATH Keywords

RSAcryptanalysisCoppersmith's method

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Cryptanalysis of RSA variants with primes sharing most significant bits ⋮ A new attack on some RSA variants ⋮ Further cryptanalysis of a type of RSA variants ⋮ A generalized attack on some variants of the RSA cryptosystem ⋮ Small CRT-exponent RSA revisited

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• The Magma algebra system. I: The user language
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• How to Generalize RSA Cryptanalyses
• Solving Linear Equations Modulo Unknown Divisors: Revisited
• A New Attack on Three Variants of the RSA Cryptosystem
• Cryptanalysis of short RSA secret exponents
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Public Key Cryptography – PKC 2004

This page was built for publication: An Improved Analysis on Three Variants of the RSA Cryptosystem