Cryptanalysis of Dual RSA
From MaRDI portal
Publication:517262
Recommendations
Cites work
- scientific article; zbMATH DE number 1302781 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A method for obtaining digital signatures and public-key cryptosystems
- An Introduction to Mathematical Cryptography
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Dual RSA and Its Security Analysis
- Factoring estimates for a 1024-bit RSA modulus
- Factoring polynomials with rational coefficients
- Factorization of a 768-Bit RSA Modulus
- Further improvement of factoring RSA moduli with implicit hint
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- On RSA moduli with prescribed bit patterns
- On the security of multi-prime RSA
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Predicting Lattice Reduction
- Progress in Cryptology – Mycrypt 2005
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Short RSA keys and their generation
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The LLL algorithm. Survey and applications
- The Magma algebra system. I: The user language
Cited in
(6)
This page was built for publication: Cryptanalysis of Dual RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517262)