Converse results to the Wiener attack on RSA

Lecture Notes in Computer Science

Volumn 3386, Issue , 2005, Pages 184-198

  Steinfeld, Ron ^a   Contini, Scott ^a   Wang, Huaxiong ^a   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILITY; RANDOM PROCESSES;

EXPONENTIAL TIME; RANDOM CHOICE; RUN-TIME; SECRET EXPONENTS;

SECURITY OF DATA;

EID: 24144496203     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30580-4_13     Document Type: Conference Paper

References (10)

1. J. Blömer and A. May. Low Secret Exponent RSA Revisited. In CaLC 2001, volume 2146 of LNCS, pages 110-125, Berlin, 2001. Springer-Verlag.
2. .292. IEEE Trans. on Info. Theory, 46(4): 1339-1349, 2000.
3. A. Dujella. Continued Fractions and RSA with Small Secret Exponents. Tatra Mt. Math. Publ. (to appear), 2004. Available at http://www.math.hr/duje/papers1.html.
4. G.H. Hardy and E.M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, London, 1965.
5. W. J. LeVeque. Fundamentals of Number Theory. Dover Publications, New York, 1996.
6. L. Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity. Society for Industrial and Applied Mathematics, Philadelphia, 1986.
7. J.B. Rosser and L. Schoenfeld. Approximate Formulas for Some Functions of Prime Numbers. Illinois. J. Math., 6:64-94, 1962.
8. E. Verheul and H. van Tilborg. Cryptanalysis of 'Less Short' RSA Secret Exponents. Applicable Algebra in Engineering, Communication and Computing, 8:425-435, 1997.
9. I.M. Vinogradov. Elements of Number Theory. Dover Publications, New York, 1954.
10. M.J. Wiener. Cryptanalysis of Short RSA Secret Exponents. IEEE Trans. on Information Theory, 36:553-558, 1990.