Cryptanalysis of Dual RSA
From MaRDI portal
Publication:517262
DOI10.1007/s10623-016-0196-5zbMath1379.94048OpenAlexW2303920657MaRDI QIDQ517262
Liqiang Peng, Zhangjie Huang, Lei Hu, Jun Xu, Yao Lu
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0196-5
Related Items (2)
Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Small CRT-exponent RSA revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The LLL algorithm. Survey and applications
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Short RSA keys and their generation
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- On RSA moduli with prescribed bit patterns
- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
- Cryptanalysis of short RSA secret exponents
- On the security of multi-prime RSA
- Dual RSA and Its Security Analysis
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- Factorization of a 768-Bit RSA Modulus
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Further Improvement of Factoring RSA Moduli with Implicit Hint
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Predicting Lattice Reduction
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- An Introduction to Mathematical Cryptography
- Progress in Cryptology – Mycrypt 2005
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Cryptanalysis of Dual RSA
