A Method for Rapid RSA Key Generation
Yasuko Gotoh, Kazuo Takaragi, Ryôichi Sasaki · Systems and Computers in Japan · 1990
Abstract The RSA public key cryptosystem is one of the cryptosystems which can be applied not only to the security protection but also to the verifications of other users and messages. It is one of the most important techniques in ensuring the security of information. To construct a secure RSA public key cryptosystem, the key must be generated using primes which are robust against a “(p + 1) factorizing attack.” For this purpose, Gordon proposed a method of generating the key by sieving using known primes less than 8 bit and by employing the higher‐order exponential calculation. This paper is an extension of Gordon's approach. The range of known primes is defined optimally through an evaluation for the sieving primes less than 32 bit. The exponential calculation is simplified. The method is implemented on a program. Numerical experiment is made on a 32‐bit workstation, and the practical usefulness of the method is verified.