Revisiting prime power RSA
From MaRDI portal
Publication:260044
DOI10.1016/J.DAM.2015.10.003zbMATH Open1335.94077OpenAlexW1827261485MaRDI QIDQ260044FDOQ260044
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- 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
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
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
- New finding on factoring prime power RSA modulus \(N = {p^r}q\)
- Fast rebalanced RSA signature scheme with typical prime generation
- 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)