Efficient method for generating strong primes with constraint of bit length

C. S. Laih, W. C. Yang, Chin-Hsing Chen

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Many methods have been proposed to generate the strong primes for the RSA public key cryptosystem. However, all of the methods are inefficient if strong primes with the constraint of bit length need to be generated. An efficient method is proposed for generating strong primes with the constraint of bit length.

Original languageEnglish
Pages (from-to)1807-1808
Number of pages2
JournalElectronics Letters
Volume27
Issue number20
DOIs
Publication statusPublished - 1991 Sep 26

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient method for generating strong primes with constraint of bit length'. Together they form a unique fingerprint.

  • Cite this