Implementation of fast RSA key generation on smart cards
- 11 March 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 214-220
- https://doi.org/10.1145/508791.508837
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.Keywords
This publication has 4 references indexed in Scilit:
- Responses to NIST's proposalCommunications of the ACM, 1992
- Factorization and Primality TestingPublished by Springer Nature ,1989
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Multiuser cryptographic techniquesPublished by Association for Computing Machinery (ACM) ,1976