Cryptanalysis of an RSA variant with moduli N=p^r q^l
From MaRDI portal
Publication:2628124
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
- scientific article; zbMATH DE number 1583953 (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 1088247 (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?)
- A unified framework for small secret exponent attack on RSA
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Efficient Factoring Based on Partial Information
- Factoring $$N=p^rq^s$$ for Large r and s
- Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
- Factoring polynomials with rational coefficients
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- 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 Divisors: On Factoring Given Any Bits
- Solving linear equations modulo unknown divisors: revisited
Cited in
(22)- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- Revisiting RSA-polynomial problem and semiprime factorization
- On RSA moduli with half of the bits prescribed
- Factoring multi power RSA moduli with a class of secret exponents
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
- Cryptanalysis of RSA variants with primes sharing most significant bits
- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
- Small Secret Key Attack on a Variant of RSA (Due to Takagi)
- scientific article; zbMATH DE number 1583953 (Why is no real title available?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- scientific article; zbMATH DE number 7528065 (Why is no real title available?)
- Cryptanalysis of the multi-power RSA cryptosystem variant
- Cryptanalysis of RSA for a special case with \(d > e\)
- A generalized attack on the multi-prime power RSA
- Improved factorization of \(N=p^rq^s\)
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Certifying variant of RSA with generalized moduli
- New Attacks on RSA with Moduli N = p r q
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
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)
