Citation
Abstract
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 2k 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.
Download File
Official URL or Download Paper: https://iopscience.iop.org/article/10.1088/1742-65...
|
![[img]](http://psasir.upm.edu.my/style/images/fileicons/text.png)
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science Centre of Foundation Studies for Agricultural Science |
| DOI Number: | https://doi.org/10.1088/1742-6596/1366/1/012021 |
| Publisher: | IOP Publishing |
| Keywords: | Generalized rivest-shamir-adleman cryptosystem; Insecurity; Adaptability; Optical security; Elgamal cryptosystem; Optical image encryption; Phase retrieval; Three-dimensional particle-like distribution; Nonsingular matrix; Simultaneous diophantine attack |
| Depositing User: | Self Deposit 2024 |
| Date Deposited: | 25 Apr 2024 09:15 |
| Last Modified: | 25 Apr 2024 09:15 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1088/1742-6596/1366/1/012021 |
| URI: | http://psasir.upm.edu.my/id/eprint/106322 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |