Tunable balancing of RSA

Lecture Notes in Computer Science

Volumn 3574, Issue , 2005, Pages 280-292

  Galbraith, Steven D ^a   Heneghan, Chris ^a   McKee, James F ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS;

CHINESE REMAINDER (CRT); RSA MODULI;

PUBLIC KEY CRYPTOGRAPHY;

EID: 26444467031     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506157_24     Document Type: Conference Paper

References (25)

1. 0.292, in J. Stern (ed.), Eurocrypt '99, Springer LNCS 1592 (1999) 1-11.
2. D. Boneh and H, Shacham, Fast variants of RSA, CryptoBytes, 5, No. 1 (2002) 1-9.
3. M. Ciet, F. Koeune, F. Laguillaumie and J.-J. Quisquater, Short private exponent attacks on fast variants of RSA, Louvain technical report CG-2003/4 (2003).
4. T. Collins, D. Hopkins, S. Langford and M. Sabin, Public key cryptographic apparatus and method. US Patent (1997).
5. D. Coppersmith, Small solutions to polynomial equations and low exponent RSA vulnerabilities, J. Crypt., 10 (1997) 233-260.
6. D. Coppersmith, Finding small solutions to small degree polynomials, in J. H. Silverman (ed.), CaLC 2001, Springer LNCS 2146 (2001) 20-31.
7. A. Dujella, Continued fractions and RSA with small secret exponent, Tatra Mt. Math. Publ., 29 (2004) 101-112.
8. G. Durfee and P. Nguyen, Cryptanalysis of the RSA scheme with short secret exponent from Asiacrypt '99, in T. Okamoto (ed.) Asiacrypt 2000, Springer LNCS 1976 (2000) 14-29.
9. G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 5th ed., Oxford (1979).
10. C. Heneghan, Ph.D. thesis, in preparation.
11. M. J. Hinek, M. K. Low and E. Teske, On some attacks on multi-prime RSA, in K. Nyberg and H. M. Heys (eds.), SAC 2002, Springer LNCS 2595 (2003) 385-404.
12. N. A. Howgrave-Graham, Finding small solutions of univariate modular equations revisited, in M. Darnell (ed.), Cryptography and Coding, Springer LNCS 1355 (1997) 131-142.
13. C. H. Lim and P. J. Lee, Sparse RSA secret keys and their generation, Proc. of 3rd Annual Workshop on Selected Areas in Cryptography (SAC'96), (1996) 117-131.
14. A. May, Cryptanalysis of unbalanced RSA with small CRT-exponent, in M. Yung (ed.) CRYPTO 2002, Springer LNCS 2442 (2002) 242-256.
15. C. A. M. Paixão, An efficient variant of the RSA cryptosystem, preprint (2003).
16. G. Qiao and K.-Y. Lam, RSA signature algorithm for microcontroller implementation, J.-J. Quisquater and B. Schneier (eds.), CARDIS '98, Springer LNCS 1820 (2000) 353-356.
17. D. Stinson, Some baby-step-giant-step algorithms for the low Hamming weight discrete logarithm problem, Math. Comp. 71, No. 237 (2001) 379-391.
18. H.-M. Sun and M.-E Wu, An Approach Towards Rebalanced RSA-CRT with Short Public Exponent, Cryptology ePrint Archive, 2005/053.
19. H.-M. Sun and C.-T. Yang, RSA with balanced short exponents and its application to entity authentication, in S. Vaudenay (ed.), PKC 2005, Springer LNCS 3386 (2005) 199-215.
20. H.-M. Sun, W.-C. Yang and C.-S. Laih, On the design of RSA with short secret exponent, in K. Y. Lam et al (eds.), ASIACRYPT '99, Springer LNCS 1716 (2000) 150-164.
21. kq, in H. Krawczyk (ed.), CRYPTO '98, Springer LNCS 1462 (1998) 318-326.
22. J. W. M. Turk, Fast arithmetic operations on numbers and polynomials, in H. W. Lenstra Jr. and R. Tijdeman (eds.), Computational methods in number theory, Part 1, Mathematical Centre Tracts 154, Amsterdam (1984).
23. E. R. Verheul and H. C. A. van Tilborg, Cryptanalysis of 'less short' RSA secret exponents, Applicable Algebra in Engineering, Communication and Computing, Vol. 8 (1997) 425-435.
24. M. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Trans. Inf. Th., 36 (1990) 553-558.
25. M.-E. Wu, A Study of RSA with Small CRT-Exponent, Thesis of Master Degree, Department of Applied Mathematics, National Chiao Tung University, Taiwan, June 2004.