Revisiting wiener's attack - New weak keys in RSA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5222 LNCS, Issue , 2008, Pages 228-243

  Maitra, Subhamoy ^a   Sarkar, Santanu ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Cryptanalysis; Factorization; RSA; Weak Keys

Indexed keywords

CONTROL THEORY; KEYS (FOR LOCKS); SECURITY OF DATA;

CONTINUED FRACTIONS; CRYPTANALYSIS; DECRYPTION EXPONENTS; NEW RESULTS; RSA; UPPER AND LOWER BOUNDS; VALUE BASED; WEAK KEYS;

CRYPTOGRAPHY;

EID: 56649102112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85886-7_16     Document Type: Conference Paper

References (20)

1. Blömer, J., May, A.: A generalized Wiener attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 1-13. Springer, Heidelberg (2004)
2. Boneh, D.: Twenty Years of Attacks on the RSA Cryptosystem. Notices of the AMS 46(2), 203-213 (1999)
3. 0-292. IEEE Trans. on Information Theory 46(4), 1339-1349 (2000)
4. Copppersmith, D.: Small solutions to polynomial equations and low exponent vulnerabilities. Journal of Cryptology 10(4), 223-260 (1997)
5. Coron, J.-S., May, A.: Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring, J. Cryptology 20(1), 39-50 (2007)
6. Duejella, A.: Continued fractions and RSA with small secret exponent. Tatra Mt. Math. Publ. 29, 101-112 (2004)
7. Jochemsz, E.: Cryptanalysis of RSA variants using small roots of polynomials. Ph, D. thesis, Technische Universiteit Eindhoven (2007)
8. Hastad, J.: On using RSA with low exponent in public key network. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 403-408. Springer, Heidelberg (1986)
9. Ibrahim, D., Bahig, H.M., Bhery, A., Daoud, S.S.: A new RSA vulnerability using continued fractions. In: 6th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2008), Doha, Qatar, March 31-April 4 (2008)
10. 0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 395-411. Springer, Heidelberg (2007)
11. Pollard, J.M.: Theorems on factorization and primality testing. Proc. of Combridge Philos. Soc. 76, 521-528 (1974)
12. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of ACM 21(2), 158-164 (1978)
13. Rosen, K.H.: Elementary Number Theory. Addison-Wesley, Reading (1984)
14. Silverman, R.D.: Fast generation of random, strong RSA primes. Cryptobytes 3(1), 9-13 (1997)
15. Stinson, D.R.: Cryptography - Theory and Practice, 2nd edn. Chapman & Hall/CRC, Boca Raton (2002)
16. Steinfeld, R., Contini, S., Pieprzyk, J., Wang, H.: Converse results to the Wiener attack on RSA. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 184-198. Springer, Heidelberg (2005)
17. Verheul, E.R., van Tilborg, H.C.A.: Cryptanalysis of 'less short' RSA secret exponents. Applicable Algebra in Engineering, Communication and Computing 8, 425-435 (1997)
18. Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory 36(3), 553-558 (1990)
19. Williams, H.C.: A p+1 method of factoring. Mathematics of Computation 39(159), 225-234 (1982)
20. de Weger, B.: Cryptanalysis of RSA with small prime difference. Applicable Algebra in Engineering, Communication and Computing 13(1), 17-28 (2002)