We propose a modification of Derome's method ( 1993) to compute the RSA secret data d = e-l mod (P -1) (Q -1) by utilizing the modular arithmetic operations, when e is not prime. Here P and Q are two large prime numbers in RSA cryptosystem and e is the public data. @ 1997 Elsevier Science B.V.
โฆ LIBER โฆ
Generating visible RSA public keys for PKI
โ Scribed by C.S. Laih; K.Y. Chen
- Book ID
- 106296925
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 351 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1615-5262
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A simple approach for generating RSA key
โ
Chin-Chen Chang; Shin-Jia Hwang
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 190 KB
A Method for Rapid RSA Key Generation
โ
Yasuko Gotoh; Kazuo Takaragi; Ryoichi Sasaki
๐
Article
๐
1990
๐
John Wiley and Sons
๐
English
โ 653 KB
## 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 p
A distributed key generation technique f
โ
Chenxi Wang; William A. Wulf
๐
Article
๐
2000
๐
Springer
๐
English
โ 106 KB