Andrej Dujella
- D. Boneh, G. Durfee, Cryptanalysis of RSA with private key d less than N0:292, Advances in Cryptology - Proceedings of Eurocrypt '99, Lecture Notes in Comput. Sci. 1952 (1999), 1--11. Google Scholar
Digital Library
- A. Dujella, Continued fractions and RSA with small secret exponent, Tatra Mt. Math. Publ. 29 (2004), 101--112.Google Scholar
- A. Dujella, B. Ibrahimpašič, On Worley's theorem in Diophantine approximations, preprint.Google Scholar
- J. Hinek, On the Security of Some Variants of RSA, Ph.D. Thesis, University of Waterloo, 2007. Google ScholarDigital Library
- R. Steinfeld, S. Contini, H. Wang, J. Pieprzyk, Converse results to the Wiener attack on RSA, Public Key Cryptography - PKC 2005, Lecture Notes in Comput. Sci. 3386 (2005), 184--198. Google ScholarDigital Library
- H.-M. Sun, M.-E. Wu, Y.-H. Chen, Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack, Applied Cryptography and Network Security, Lecture Notes in Comput. Sci. 4521 (2007), 116--128. Google ScholarDigital Library
- E. R. Verheul, H. C. A. van Tilborg, Cryptanalysis of 'less short' RSA secret exponents, Appl. Algebra Engrg. Comm. Computing 8 (1997), 425--435.Google ScholarCross Ref
- M. J. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Trans. Inform. Theory 36 (1990), 553--558.Google ScholarDigital Library
- R. T. Worley, Estimating |α -- p/q|, Austral. Math. Soc. Ser. A 31 (1981), 202--206.Google Scholar
Index Terms
- A variant of Wiener's attack on RSA with small secret exponent
Recommendations
A unified framework for small secret exponent attack on RSA
SAC'11: Proceedings of the 18th international conference on Selected Areas in CryptographyWe address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-...
Small CRT-Exponent RSA Revisited
AbstractSince May (Crypto’02) revealed the vulnerability of the small CRT-exponent RSA using Coppersmith’s lattice-based method, several papers have studied the problem and two major improvements have been made. (1) Bleichenbacher and May (PKC’06) ...
A variant of Wiener’s attack on RSA
Special Issue on the occasion of the 8th Central European Conference on CryptographyWiener’s attack is a well-known polynomial-time attack on a RSA cryptosystem with small secret decryption exponent d, which works if d < n 0.25, where n = pq is the modulus of the cryptosystem. Namely, in that case, d is the denominator of some ...
Comments