A simple approach for generating RSA keys
โ Scribed by Chin-Chen Chang; Shin-Jia Hwang
- Book ID
- 104137424
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 190 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
## 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