Factoring multi-power RSA modulus N = p^r q with partial known bits
From MaRDI portal
Publication:5300936
DOI10.1007/978-3-642-39059-3_5zbMATH Open1285.94078OpenAlexW6111282MaRDI QIDQ5300936FDOQ5300936
Authors: Yao Lu, Rui Zhang, Dongdai Lin 
Publication date: 28 June 2013
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39059-3_5
Recommendations
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Factoring RSA moduli with primes sharing bits in the middle
- Factoring unbalanced moduli with known bits
- A new partial key exposure attack on multi-power RSA
Cited In (16)
- Revisiting RSA-polynomial problem and semiprime factorization
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Small CRT-exponent RSA revisited
- On RSA moduli with half of the bits prescribed
- Factoring RSA modulus using prime reconstruction from random known bits
- Further results on implicit factoring in polynomial time
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Factoring multi power RSA moduli with a class of secret exponents
- Factoring unbalanced moduli with known bits
- An attack on \(N = p^2q\) with partially known bits on the multiple of the prime factors
- Small CRT-Exponent RSA Revisited
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Towards optimal bounds for implicit factorization problem
This page was built for publication: Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300936)
