Chenghuai Lu
ABSTRACT
Although smart cards are becoming used in an increasing number of applications, there is small literature of the implementation issues for smart cards. This paper describes the issues and considerations that need to be taken into account when implementing the key generation step of a cryptographic algorithm widely used nowadays, RSA.Smart cards are used in many applications that require a tamper resistant area. Therefore, smart cards that use cryptography have to provide encryption, decryption, as well as key generation inside its security perimeter. RSA key generation is a concern for on-card implementation of RSA cryptosystem, as it usually takes a long time. In this paper, two simple but efficient key generation algorithms are evaluated, in addition to a simple but not very efficient algorithm. The paper discusses in detail how to build fast implementations for the three algorithms presented, using smart cards with crypto-coprocessor.
- Blackburn, S., Black-Wilson, S., and Burmester, M. Shared Generation of Shared RSA Keys. Technical Report CORR 98-19, Dept. of C&O, Univ. of Waterloo, Canada, 1998.]]Google Scholar
- Bosma, W. Primality Proving with Cyclotomy. Doctoral Dissertation, University of Amsterdam, 1990.]]Google Scholar
- Bressoud, D. M. Factorizations and Primality Testing. Springer-Verlag, New York, 1989.]]Google ScholarCross Ref
- Chan, S. C. An Overview of Smart card Security, http://www.hkstar.com/~alanchan/papers/smartCardSecurity/.]]Google Scholar
- Dhem, J. F. Design of an Efficient Public-key Cryptographic Library for RISC-based Smart Cards. Universit Catholique de Louvain - Facultdes Sciences Appliqus - Laboratoire de microectronique, Louvain-la-Neuve, 1998.]]Google Scholar
- Diffie, W., and Hellman, M. Multiuser Cryptographic Techniques. Proceedings of AFIPS National Computer Conference, 1976, 109-112.]]Google ScholarDigital Library
- Diffie W., and Hellman, M. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22n. 6, Nov. 1976, 644-654.]]Google Scholar
- Handchuh, H., and Paillier, P. Smart Card Crypto-coprocessors for Public-Key Cryptography. Crypto Bytes, RSA Laboratories, 4 (summer 1999), 6-10.]]Google Scholar
- Johnson, D., and Menezes, A. The Elliptic Curve Digital Signature Algorithm (ECDSA). Technical Report CORR 99-34, Dept. of C&O, Univ. of Waterloo, Canada, 1999.]]Google Scholar
- Joye, M., Palliar, P., and Vandeney, S. Efficient Generation of Prime Numbers. CHES 2000, 340-354.]] Google ScholarDigital Library
- Kaliski, B., and Robshaw, M. The Secure Use of RSA. CryptoBytes, RSA Laboratories, (Autumn 1995), 7-13.]]Google Scholar
- Knuth, D. E. The Art of Computer Programming. Semi numerical Algorithms of Computer Science and Information Processing, Addison-Wesley, 3rd ed., Vol. 2, 1997.]] Google ScholarDigital Library
- Koç, Ç. K. High-Speed RSA Implementation. Technical Report TR-201, version 2.0, RSA Laboratories, November 1994.]]Google Scholar
- Malkin, M., Wu, T., and Baneh, D. Experimenting with Shared Generation of RSA Keys. SNDSS'99, 1999, 43-56.]]Google Scholar
- Meneze, A. Comparing the Security of ECC and RSA. http://cacr.math.uwaterloo.ca/~ajmeneze/misc/cryptogram-article.html.]]Google Scholar
- Morain, E. Implementation of the Goldwasser-Killian-Atkin Primility Testing Algorithm. Mathematics Computation, Vol. 54, 1990, 839-854.]]Google Scholar
- NIST, US Department of Commerce, Digital Signature Standard, FIPS PUB 186, May 1994.]]Google Scholar
- Peyret, P. Which Smart Card Technology Will You Need to Ride the Information Highway Safely? Head of Research & Development, Gemplus Corporation, 1995.]]Google Scholar
- Rivest, R., Shamit, A., and Adleman, L. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of ACM, Vol. 21, No. 2, Feb. 1978, 158-164.]] Google ScholarDigital Library
- Rivest, R. L. Finding Four Million Random Primes. Advances in Cryptology, Crypto '90, Springer-Verlag, 1991. 625-626.]] Google ScholarDigital Library
- Rivest, R. L. Response to NIST's proposal. Communications of ACM, 35, 1992, 41-47.]] Google ScholarDigital Library
- Silverman, R. D. Fast Generation of Random, Strong RSA Primes: Crypto Bytes, RSA Laboratories, 3 (spring 1997), 9-13.]]Google Scholar
- Schumberger Limited. Advantages, Smart Cards: Inherent Advantages. http://www.slb.com/et/inherent_advantage.html.]]Google Scholar
- Stallings, W. Cryptography and Network Security: principle and practice, 2nd ed., Prentice-Hall, New Jersey, 1999.]] Google ScholarDigital Library
- University of Texas at Austin. Enabling Smart Commerce in the Digital Age. http://cism.bus.utexas.edu/works/articles/smartcardswp.html.]]Google Scholar
- Wiener, M. Performance Comparision of Public-Key Cryptosystems. Crypto Bytes, RSA Laboratories, 4 (summer 1999), 1-5.]]Google Scholar
Index Terms
- Implementation of fast RSA key generation on smart cards
Recommendations
Provably secure three-party authenticated key agreement protocol using smart cards
Authenticated key agreement protocol is a useful cryptographic primitive, which can be used to protect the confidentiality, integrity and authenticity for transmitted data over insecure networks. From the point of view of the management of pre-shared ...
A new mutual authentication scheme based on nonce and smart cards
In 2003, Shen, Lin and Hwang proposed a timestamp-based password authentication scheme using smart card. In the scheme the remote server does not need to store the passwords or verification tables for users' authentication, and the scheme also provides ...
Secure Dynamic Identity-Based Authentication Scheme Using Smart Cards
In 2004, Das et al. proposed a dynamic identity-based remote user authentication scheme using smart cards. This scheme allows users to choose and change their passwords freely, and the server does not maintain any verification table. Das et al. claimed ...
Comments