Cryptanalysis of short secret exponents modulo RSA primes.
From MaRDI portal
Publication:1429863
DOI10.1016/J.INS.2003.08.016zbMATH Open1043.94008OpenAlexW2085627488MaRDI QIDQ1429863FDOQ1429863
Authors: Chien-Yuan Chen, Cheng-Yuan Ku, David C. Yen
Publication date: 27 May 2004
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2003.08.016
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of short RSA secret exponents
- Public-key cryptosystems based on cubic finite field extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attacks on Shamir's `RSA for paranoids'
- Cryptanalysis of `less short' RSA secret exponents
- Factoring Large Integers
Cited In (7)
- Cryptanalysis of RSA Using the Ratio of the Primes
- Cryptanalysis of `less short' RSA secret exponents
- Title not available (Why is that?)
- Cryptanalysis of RSA with a small parameter revisited
- Title not available (Why is that?)
- Attacks of simple block ciphers via efficient heuristics
- Cryptanalysis of short RSA secret exponents
This page was built for publication: Cryptanalysis of short secret exponents modulo RSA primes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429863)