Parallel computation of the generating keys for RSA cryptosystems

被引:27
作者
Chang, CC [1 ]
Hwang, MS [1 ]
机构
[1] CHAO YANG INST TECHNOL,DEPT INFORMAT MANAGEMENT,TAICHUNG 404,TAIWAN
关键词
public key cryptography; number theory;
D O I
10.1049/el:19960886
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The authors present a parallel implementation for generating RSA keys without using the Euclidean algorithm. Their method is based on a unique factorisation theorem, which combines with Derome's method and allows the generation of RSA keys without using the Euclidean algorithm.
引用
收藏
页码:1365 / 1366
页数:2
相关论文
共 3 条
[1]   GENERATING RSA KEYS WITHOUT THE EUCLID ALGORITHM [J].
DEROME, MFA .
ELECTRONICS LETTERS, 1993, 29 (01) :19-21
[2]  
KNUTH DE, 1981, ART COMPUTER PROGRAM, V2, P317
[3]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]