Efficient method for generating strong primes with constraint of bit length

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

研究成果: Article同行評審

8 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)1807-1808
頁數2
期刊Electronics Letters
27
發行號20
DOIs
出版狀態Published - 1991 九月 26

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「Efficient method for generating strong primes with constraint of bit length」主題。共同形成了獨特的指紋。

引用此