Revisiting prime power RSA

DOI10.1016/J.DAM.2015.10.003MaRDI QIDQ260044zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Small secret exponent attack on RSA variant with modulus N=p^rq
• New Attacks on RSA with Moduli N = p r q
• Improved results on cryptanalysis of prime power RSA
• A new partial key exposure attack on multi-power RSA
• A generalized attack on the multi-prime power RSA

Cites work

• scientific article; zbMATH DE number 177609 (Why is no real title available?)
• scientific article; zbMATH DE number 1302812 (Why is no real title available?)
• scientific article; zbMATH DE number 1302856 (Why is no real title available?)
• scientific article; zbMATH DE number 1303131 (Why is no real title available?)
• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1418303 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of short RSA secret exponents
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• On the importance of eliminating errors in cryptographic computations
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Public Key Cryptography – PKC 2004
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• Small secret exponent attack on RSA variant with modulus N=p^rq
• 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

Cited in

(14)

• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Generalized cryptanalysis of small CRT-exponent RSA
• How to generalize RSA cryptanalyses
• Small secret exponent attack on RSA variant with modulus N=p^rq
• A new public key cryptosystem based on Edwards curves
• Small CRT-exponent RSA revisited
• Improved results on cryptanalysis of prime power RSA
• Exploiting the security of \(N= p^r q^s\) through approximation of \(\varphi(N)\)
• Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
• Fast rebalanced RSA signature scheme with typical prime generation
• New finding on factoring prime power RSA modulus \(N = {p^r}q\)
• Small CRT-Exponent RSA Revisited
• A generalized attack on the multi-prime power RSA
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents

This page was built for publication: Revisiting prime power RSA

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