A simple approach for generating RSA keys

被引：3

作者：

Chang, CC ^{[1
]}

Hwang, SJ ^{[1
]}

机构：

[1] CHAOYANG INST TECHNOL,DEPT INFORMAT MANAGEMENT,WUFENG 413,TAICHUNG COUNTY,TAIWAN

来源：

INFORMATION PROCESSING LETTERS | 1997年 / 63卷 / 01期

关键词：

cryptography; number theory; algorithms;

D O I：

10.1016/S0020-0190(97)00089-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose a modification of Derome's method (1993) to compute the RSA secret data d = e(-1) mod (P - 1)(Q - 1) by utilizing the modular arithmetic operations, when e is not prime. Here P and e are two large prime numbers in RSA cryptosystem and e is the public data. (C) 1997 Elsevier Science B.V.

引用

页码：19 / 21

页数：3

共 7 条

[1]

COHEN H, 1993, COURSE COMPUTATIONAL, P4

[2] GENERATING RSA KEYS WITHOUT THE EUCLID ALGORITHM [J].

DEROME, MFA .

ELECTRONICS LETTERS, 1993, 29 (01) :19-21

[3] STRONG RSA KEYS [J].

GORDON, J .

ELECTRONICS LETTERS, 1984, 20 (12) :514-516

[4]

Knuth Donald, 1981, ART COMPUTER PROGRAM, V2

[5] EFFICIENT METHOD FOR GENERATING STRONG PRIMES WITH CONSTRAINT OF BIT LENGTH [J].

LAIH, CS ;

YANG, WC ;

CHEN, CH .

ELECTRONICS LETTERS, 1991, 27 (20) :1807-1808

[6] PROBABILISTIC ALGORITHM FOR TESTING PRIMALITY [J].

RABIN, MO .

JOURNAL OF NUMBER THEORY, 1980, 12 (01) :128-138

[7]

RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]

← 1 →