Loading...
Please wait, while we are loading the content...
On the Insecurity of Generalized (Rivest-Shamir-Adleman) - Advance and Adaptable Cryptosystem
| Content Provider | Scilit |
|---|---|
| Author | Isa, M. A. M. Rahmany, N. N. A. Asbullah, M. A. Sathar, M. H. A. Rasedee, A. F. N. |
| Copyright Year | 2019 |
| Description | Journal: Journal of Physics: Conference Series This paper explores the security claims of the Generalized (Rivest-Shamir-Adleman) - Advance and Adaptable Cryptosystem, in short the GRSA-AA cryptosystem. In the GRSA-AA design proposal, the public key n is defined as the multiplication of two large prime numbers, while the values of encryption key E and decryption key D are relying on the result of multiplying 2$ ^{k}$ large prime numbers called N where n divides N. The GRSA-AA claimed that the brute force is necessary to break the cryptosystem even if the integer n was factored. Nevertheless, this paper aims to show that this scheme is insecure once n is factored. The mathematical proof is presented to show that it is easy to generate an alternative value to the private key D without brute-forcing, yet successfully break the system. |
| Related Links | https://iopscience.iop.org/article/10.1088/1742-6596/1366/1/012021/pdf |
| ISSN | 17426588 |
| e-ISSN | 17426596 |
| DOI | 10.1088/1742-6596/1366/1/012021 |
| Journal | Journal of Physics: Conference Series |
| Issue Number | 1 |
| Volume Number | 1366 |
| Language | English |
| Publisher | IOP Publishing |
| Publisher Date | 2019-11-01 |
| Access Restriction | Open |
| Subject Keyword | Journal: Journal of Physics: Conference Series Hardware and Architecture Rivest Shamir Adaptable Cryptosystem Shamir Adleman Grsa Aa |
| Content Type | Text |
| Resource Type | Article |
| Subject | Physics and Astronomy |
