Cryptanalysis of an RSA variant with moduli N=p^r q^l
From MaRDI portal
Publication:2628124
DOI10.1515/JMC-2016-0025zbMATH Open1365.94447OpenAlexW2615279577MaRDI QIDQ2628124FDOQ2628124
Santanu Sarkar, Yao Lu, Liqiang Peng
Publication date: 12 June 2017
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2016-0025
Recommendations
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Factoring multi power RSA moduli with a class of secret exponents
- Cryptanalysis of RSA variants with primes sharing most significant bits
- New Attacks on RSA with Moduli N = p r q
Cites Work
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- 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?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Title not available (Why is that?)
- Small Secret Key Attack on a Variant of RSA (Due to Takagi)
- Public Key Cryptography – PKC 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- Efficient Factoring Based on Partial Information
- Factoring $$N=p^rq^s$$ for Large r and s
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- A Unified Framework for Small Secret Exponent Attack on RSA
Cited In (14)
- Revisiting RSA-polynomial problem and semiprime factorization
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- New Attacks on RSA with Moduli N = p r q
- Title not available (Why is that?)
- On RSA moduli with half of the bits prescribed
- Title not available (Why is that?)
- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- Cryptanalysis of RSA for a special case with \(d > e\)
- Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
- A generalized attack on the multi-prime power RSA
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of the multi-power RSA cryptosystem variant
This page was built for publication: Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628124)
