A Fast RSA-Type Public-Key Primitive Modulo pkq Using Hensel Lifting

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 1, 2004, Pages 94-101

  Takagi, Tsuyoshi ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Factoring; Fast decryption; Modular inverse; PKCS 1 version 2.1; RSA cryptosystem; Smart cards

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; INVERSE PROBLEMS; SMART CARDS; THEOREM PROVING;

FACTORING; FAST DECRYPTION; MODULAR INVERSE; PKCS #1 VERSION 2.1; RSA CRYPTOSYSTEM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0842267122     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (39)

1. L. Adleman and K. McCurley, "Open problems in number theoretic complexity, II," Proc. ANTS-I, LNCS 877, pp.291-322, 1994.
2. F. Bahr, J. Franke, T. Kleinjung, M. Lochter, and M. Böhm, RSA-160, http://www.loria.fr/̃zimmerma/records/rsa160.
3. G. Blakley and I. Borosh, "Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages," Comput. & Maths. with Appls., vol.5, pp.169-178, 1979.
4. rq for large r," Advances in Cryptology -CRYPTO'99, LNCS 1666, pp.326-337, 1999.
5. 0.292," IEEE Trans. Inf. Theory, vol.46, no.4, pp.1339-1349, 2000.
6. D. Boneh and H. Shacham, "Fast variants of RSA," CryptoBytes, vol.5, no.1, pp.1-9, 2002.
7. R. Brent, "Recent progress and prospects for integer factorisation algorithms," COCOON 2000, LNCS 1858, pp.3-22, 2000.
8. r × q for large r," IEICE Trans. Fundamentals, vol.E85-A, no.5, pp.1050-1053, May 2002.
9. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, "Low-exponent RSA with related messages," Advances in Cryptology - EUROCRYPT'96, LNCS 1070, pp.1-9, 1996.
10. D. Coppersmith, "Finding a small root of a univariate modular equation," Advances in Cryptology EUROCRYPT'96, LNCS 1070, pp.155-165, 1996.
11. 2 with the elliptic curve method," Technical Report, CORR 2002-02, CACR, the University of Waterloo, 2002.
12. J. Håstad, "Solving simultaneous modular equations of low degree," SIAM J. Comput., vol.17, pp.336-341, 1988.
13. J. Hinek, M. Low, and E. Teske, "On some attacks on multi-prime RSA," Selected Areas in Cryptography 2002, LNCS2595, pp.385-404, 2002.
14. B. Kaliski and M. Robshaw, "Secure use of RSA," CryptoBytes, vol.1, no.3, pp.7-13, 1995.
15. ECMNET Project, http://www.loria.fr/̃zimmerma/records/ecmnet.html
16. H.W. Lenstra, Jr., "Factoring integers with elliptic curves," Annals of Mathematics, vol.126, pp.649-673, 1987.
17. A. Lenstra and E. Verheul, "Selecting cryptographic key sizes, " J. Cryptology, vol.14, no.4, pp.255-293, 2001.
18. A.K. Lenstra and H.W. Lenstra, Jr., eds., "The development of the number field sieve," Lecture Notes in Mathematics, 1554, Springer, 1991.
19. LiDIA, A C++ Library for Computational Number Theory, Technische Universtät Darmstadt, http://www.informatik.tu-darmstadt.de/TI/LiDIA/
20. s," Progress in Cryptology-INDOCRYPT 2000, LNCS 1977, pp.283-294, 2002.
21. U.M. Maurer, "Fast generation of prime numbers and secure public-key cryptographic parameters," J. Cryptology, vol.8, pp.123-155, 1995.
22. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of applied cryptography, CRC Press, 1996.
23. T. Okamoto, "A fast signature scheme based on congruential polynomial operations," IEEE Trans. Inf. Theory, vol.36, no.1, pp.47-53, 1990.
24. T. Okamoto and S. Uchiyama, "A new public-key cryptosystem as secure as factoring," Advances in Cryptology EUROCRYPT'98, LNCS 1403, pp.308-318, 1998.
25. Public-Key Cryptography Standards, PKCS # 1, Version 2.1, RSA Laboratories, http://www.rsasecurity.com/rsalabs/pkcs/
26. S. Paulus and T. Takagi, "A new public-key cryptosystem over the quadratic order with quadratic decryption time," J. Cryptology, vol.13, pp.263-272, 2000.
27. R. Peralta and E. Okamoto, "Faster factoring of integers of a special form," IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.489-493, April 1996.
28. J.-J. Quisquater and C. Couvreur, "Fast decipherment algorithm for RSA public-key cryptosystem," Electron. Lett., vol.18, pp.905-907, 1982.
29. M. Rabin, "Digitalized signatures and public-key functions as intractable as factorization," Technical Report, no.212, pp.1-16, Laboratory of Computer Science, MIT, Cambridge, 1979.
30. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol.21, no.2, pp.120-126, 1978.
31. S. Cavallar, B. Dodson, A. Lenstra, W. Lioen, P. Montgomery, B. Murphy, H. te Riele, K. Aardal, J. Gilchrist, G. Guillerm, P. Leyland, J. Marchand, F. Morian, A. Muffett, C. Putnam, C. Putnam, and P. Zimmermann, "Factorization of a 512-bit RSA modulus," EUROCRYPT 2000, LNCS1807, pp.1-18, 2000.
32. R. Rivest and R.D. Silverman, "Are 'strong' primes needed for RSA," The 1997 RSA Laboratories Seminar Series, Seminars Proceedings, 1997.
33. A. Shamir, "RSA for paranoids," CryptoBytes, vol.1, pp.1-4, Autumn, 1995.
34. R. Silverman, "A cost-based security analysis of symmetric and asymmetric key lengths," RSA Laboratories Bulletin, no.13, 2000. http://www.rsasecurity.com/rsalabs/bulletins/bulletin13.html
35. T. Takagi, "Fast RSA-type cryptosystems using n-adic expansion," Advances in Cryptology - CRYPTO'97, LNCS 1294, pp.372-384, 1997.
36. kq," CRYPTO'98, LNCS 1462, pp.318-326, 1998.
37. E. Verheul and H. van Tilborg, "Cryptanalysis of 'less short' RSA secret exponents," Applicable Algebra in Engineering, Communication and Computing, vol.8, pp.425-435, 1997.
38. M.J. Wiener, "Cryptanalysis of short RSA secret exponents," IEEE Trans. Inf. Theory, vol.36, no.3, pp.553-558, 1990.
39. H.C. Williams and B. Schmid, "Some remarks concerning the M.I.T. public-key cryptosystem," BIT 19, pp.525-538, 1979.