Revisiting prime power RSA

DOI10.1016/j.dam.2015.10.003zbMath1335.94077OpenAlexW1827261485MaRDI QIDQ260044

Santanu Sarkar

Publication date: 18 March 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.003

zbMATH Keywords

latticepartial key exposureprime power RSAsmall decryption exponent

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (9)

Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Fast rebalanced RSA signature scheme with typical prime generation ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Small CRT-Exponent RSA Revisited ⋮ A new public key cryptosystem based on Edwards curves ⋮ Small CRT-exponent RSA revisited ⋮ Generalized cryptanalysis of small CRT-exponent RSA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Solving Linear Equations Modulo Unknown Divisors: Revisited
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Advances in Cryptology - CRYPTO 2003
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• Public Key Cryptography – PKC 2004
• On the importance of eliminating errors in cryptographic computations

This page was built for publication: Revisiting prime power RSA