## Implementation of fast RSA key generation on smart cards (2002)

Venue: | ACM Symposium on Applied Computing |

Citations: | 8 - 0 self |

### BibTeX

@INPROCEEDINGS{Lu02implementationof,

author = {Chenghuai Lu},

title = {Implementation of fast RSA key generation on smart cards},

booktitle = {ACM Symposium on Applied Computing},

year = {2002},

pages = {214--220},

publisher = {ACM Press}

}

### OpenURL

### 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 cryptocoprocessor.

### Citations

3188 | A method for obtaining digital signatures and public key cryptosystems
- Rivest, Shamir, et al.
- 1978
(Show Context)
Citation Context ...raphy has gained extreme popularity since it was first published to the unclassified community [6]. A wide variety of schemes have been designed that use public key algorithms, e.g. digital signature =-=[9, 17, 19]-=- and key exchange [7]. One of the most popular public key cryptographic algorithms is called RSA [19]. Although there are some controversy about the reasons of its popularity [15, 26], RSA is a very s... |

2966 | New directions in cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ...larity since it was first published to the unclassified community [6]. A wide variety of schemes have been designed that use public key algorithms, e.g. digital signature [9, 17, 19] and key exchange =-=[7]-=-. One of the most popular public key cryptographic algorithms is called RSA [19]. Although there are some controversy about the reasons of its popularity [15, 26], RSA is a very simple and easy to imp... |

686 |
Cryptography and Network Security Principles and Practice
- Stallings
- 2003
(Show Context)
Citation Context ...ermining the RSA private key. The private key is the modular inverse of the public key as described in section 2. A very common method for finding modular inverses is the extended Euclidean algorithm =-=[24]-=-. Finding the public key and private key after finding the prime numbers is trivial. The particular method for computing modular inverse chosen has little impact on the overall key generation. With th... |

271 |
The Art of Computer Programming: Seminumerical Algorithms, volume 2
- Knuth
- 1969
(Show Context)
Citation Context ...ting algorithms. Smart cards hardware presents particular challenges. Thus, techniques useful for efficiently implementing algorithms in smart cards are discussed. 3.1 Prime Distribution According to =-=[12]-=-, the number of primes less than a natural number N is asymptotically equal to N / logN. Thus, if a x less than N is chosen randomly, the probability of x being a prime number is approximately (N/log ... |

119 | The elliptic curve digital signature algorithm (ECDSA
- Johnson, Menezes
- 1999
(Show Context)
Citation Context ...raphy has gained extreme popularity since it was first published to the unclassified community [6]. A wide variety of schemes have been designed that use public key algorithms, e.g. digital signature =-=[9, 17, 19]-=- and key exchange [7]. One of the most popular public key cryptographic algorithms is called RSA [19]. Although there are some controversy about the reasons of its popularity [15, 26], RSA is a very s... |

51 | High-Speed RSA Implementation
- Koç
- 1994
(Show Context)
Citation Context ...ome controversy about the reasons of its popularity [15, 26], RSA is a very simple and easy to implement algorithm. In addition, many implementations of RSA cryptosystem have been studied extensively =-=[11, 13, 21]-=-. On September 7, 2000, two weeks before the patent expired, RSA security relinquished its patent on the RSA algorithm. All these characteristics combined make RSA very attractive for use on the near ... |

49 |
Multiuser cryptographic techniques
- Di±e, Hellman
- 1976
(Show Context)
Citation Context ...yptographic operations without depending on potentially vulnerable external resources. Public key cryptography has gained extreme popularity since it was first published to the unclassified community =-=[6]-=-. A wide variety of schemes have been designed that use public key algorithms, e.g. digital signature [9, 17, 19] and key exchange [7]. One of the most popular public key cryptographic algorithms is c... |

39 |
Factorization and Primality Testing
- Bressoud
- 1989
(Show Context)
Citation Context ...inding algorithm is to find the optimal point of using a sieve algorithm that uses the largest S(k) possible keeping a small overhead . One of the most used sieve methods is the trial division method =-=[3]-=-. The prime finding algorithm using the trial division method is shown in Figure 4, with p i defined the same way it was defined in Figure 1. 1. Choose a set S(k). Pick a random n-bit odd number q ( 0... |

38 | Experimenting with Shared Generation of RSA keys
- Malkin, Wu, et al.
- 1999
(Show Context)
Citation Context ... into account when designing cryptographic algorithms for smart cards. Although there is an alternative way to generate RSA key pair [1], it is not suit for that in smart card due to the inefficiency =-=[14]-=-. The on-card key generation problem is, in fact, a large prime finding problem. This paper proposes a prototype for fast prime finding algorithms. From it, we are able to derivate two efficient prime... |

31 |
Design of an efficient public-key cryptographic library for RISC-based smart cards
- Dhem
- 1998
(Show Context)
Citation Context ...erated number must be tested for primality in order to be useful for the generation of a RSA key pair. There is a very simple method to test if a given number is prime, known as sieve of Eratosthenes =-=[5]-=-. The method is efficient to test the primality of small numbers. But for prime finding of RSA key pairs where the prime numbers need to be several hundreds bit long, sieve of Eratosthenes is impracti... |

29 | Smart Card Crypto-Coprocessors for Public-Key Cryptography
- Handschuh, Paillier
- 1998
(Show Context)
Citation Context ...d and the oncard implementations are usually much slower than that in desktops. Because of this, the high-end smart card microcontrollers are equipped with special hardware, called crypto-coprocessor =-=[8]-=-, which can accelerate the crypto computations for a class of public key cryptographic algorithms. The crypto-coprocessor is a specialized circuitry that is able to perform fast modular exponentiation... |

13 | Efficient generation of prime numbers
- Joye, Paillier, et al.
- 1965
(Show Context)
Citation Context ...y generation can be mapped to the problem of finding large primes. Because of this, the time to generate an n-bit RSA key pairs is mostly due to the time to find two (N/2)-bit primes. Marc Joy et al. =-=[10]-=- describe an efficient prime-finding algorithm for smart card microcontrollers. Although this is a step in the right direction for dissemination of knowledge of the problems faced when implementing cr... |

10 |
Response to NIST's proposal
- Rivest
- 1992
(Show Context)
Citation Context ...ome controversy about the reasons of its popularity [15, 26], RSA is a very simple and easy to implement algorithm. In addition, many implementations of RSA cryptosystem have been studied extensively =-=[11, 13, 21]-=-. On September 7, 2000, two weeks before the patent expired, RSA security relinquished its patent on the RSA algorithm. All these characteristics combined make RSA very attractive for use on the near ... |

9 | The secure use of RSA - Robshaw - 1995 |

8 | Fast generation of random, strong RSA primes
- Silverman
- 1997
(Show Context)
Citation Context ...) 3. If w j < 0, w j = w j + p j . ( i+ 1) Figure 6. Algorithm for finding w j The table look up sieve was evaluated and the results will be discussed later in this paper. In addition, another method =-=[22]-=- for sieve was evaluated. In order to understand the other algorithm, let us consider an interval of l test candidates, say ( 0) ( 1) ( l−1) { q , q ,…, q }. Let’s then define a bit array A = [ a0 a1 ... |

7 | Shared Generation of Shared RSA Keys
- Blackburn, Blake-Wilson, et al.
(Show Context)
Citation Context ...n in smart cards. The paper provides the factors that must be taken into account when designing cryptographic algorithms for smart cards. Although there is an alternative way to generate RSA key pair =-=[1]-=-, it is not suit for that in smart card due to the inefficiency [14]. The on-card key generation problem is, in fact, a large prime finding problem. This paper proposes a prototype for fast prime find... |

5 |
Finding four million random primes
- Rivest
- 1991
(Show Context)
Citation Context ... ). However, the Fermat test is easier to implement and can practically provide very high level of primality confidence for a number passing the test and using a sieve. An experiment was conducted in =-=[20]-=- where approximately 718 million 256-bit numbers were tested by trial division with S(104) and one-round Fermat test with witness 2. All the numbers passing both the trial division test and one-round ... |

4 |
Primality Proving with Cyclotomy. Doctoral Dissertation
- Bosma
- 1990
(Show Context)
Citation Context ...peatedly running the test one gains more and more confidence on the result. The most common probabilistic primality tests are the Fermat, Solovay-Strassen, and Miller Rabin tests [5]. Primality tests =-=[2, 16]-=- will find if a number is prime with probability 1. Although primalitity tests may seem the most appropriate technique when finding if a number is prime, they are much more complex and computing power... |

4 |
Implementation of the Goldwasser-Killian-Atkin Primality Testing Algorithm
- Morain
- 1988
(Show Context)
Citation Context ...peatedly running the test one gains more and more confidence on the result. The most common probabilistic primality tests are the Fermat, Solovay-Strassen, and Miller Rabin tests [5]. Primality tests =-=[2, 16]-=- will find if a number is prime with probability 1. Although primalitity tests may seem the most appropriate technique when finding if a number is prime, they are much more complex and computing power... |

2 |
Performance Comparision of Public-Key Cryptosystems
- Wiener
- 1999
(Show Context)
Citation Context ...tal signature [9, 17, 19] and key exchange [7]. One of the most popular public key cryptographic algorithms is called RSA [19]. Although there are some controversy about the reasons of its popularity =-=[15, 26]-=-, RSA is a very simple and easy to implement algorithm. In addition, many implementations of RSA cryptosystem have been studied extensively [11, 13, 21]. On September 7, 2000, two weeks before the pat... |

1 |
An Overview of Smart card Security, http://www.hkstar.com/~alanchan/papers/smartCardSecur ity
- Chan
(Show Context)
Citation Context ...eorgia Institute of Technology Atlanta, GA 30332-0280 andre@cc.gatech.edu Francisco R. Pimentel Departmento de Matematica Universidade Federal do Ceara Fortaleza, CE 60455, Brazil pimentel@mat.ufc.br =-=[4]-=- of the integrated circuit, make smart cards well suitable for a variety of applications [4, 18, 23, 25] that require high degree of security. In particular, the tamper resistance and computing power ... |

1 |
Comparing the Security of ECC and RSA. http://cacr.math.uwaterloo.ca/~ajmeneze/misc/cryptogra m-article.html
- Meneze
(Show Context)
Citation Context ...tal signature [9, 17, 19] and key exchange [7]. One of the most popular public key cryptographic algorithms is called RSA [19]. Although there are some controversy about the reasons of its popularity =-=[15, 26]-=-, RSA is a very simple and easy to implement algorithm. In addition, many implementations of RSA cryptosystem have been studied extensively [11, 13, 21]. On September 7, 2000, two weeks before the pat... |

1 |
Which Smart Card Technology Will You Need to Ride the Information Highway Safely
- Peyret
- 1995
(Show Context)
Citation Context ...tel Departmento de Matematica Universidade Federal do Ceara Fortaleza, CE 60455, Brazil pimentel@mat.ufc.br [4] of the integrated circuit, make smart cards well suitable for a variety of applications =-=[4, 18, 23, 25]-=- that require high degree of security. In particular, the tamper resistance and computing power of smart cards can be exploited to perform cryptographic operations without depending on potentially vul... |