On RSA moduli with half of the bits prescribed
From MaRDI portal
(Redirected from Publication:1762295)
Recommendations
- On RSA moduli with almost half of the bits prescribed
- On RSA moduli with prescribed bit patterns
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Factoring RSA moduli with primes sharing bits in the middle
- scientific article; zbMATH DE number 5009188
- Factoring multi-power RSA modulus N = p^r q with partial known bits
- scientific article; zbMATH DE number 1302781
- Factoring estimates for a 1024-bit RSA modulus
- Factorization of a 768-Bit RSA Modulus
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
Cites work
- scientific article; zbMATH DE number 1302781 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- On RSA moduli with almost half of the bits prescribed
- On RSA moduli with prescribed bit patterns
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Short RSA keys and their generation
Cited in
(9)- On RSA moduli with almost half of the bits prescribed
- Squarefree polynomials with prescribed coefficients
- Certifying variant of RSA with generalized moduli
- On RSA moduli with prescribed bit patterns
- A generalization of the Siegel-Walfisz theorem and its application
- Some Considerations concerning the Selection of RSA Moduli
- scientific article; zbMATH DE number 1302781 (Why is no real title available?)
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- On the distribution of special multiplicative functions in sets of integers with restricted digits
This page was built for publication: On RSA moduli with half of the bits prescribed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762295)
