On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem
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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/106322/1/Isa_2019_J._Phys.__Conf._Ser._1366_012021.pdf |
| _version_ | 1825939354062684160 |
|---|---|
| author | Isa, M.A.M. Rahmany, N.N.A. Asbullah, M.A. Sathar, M.H.A. Rasedee, A.F.N. |
| author_facet | Isa, M.A.M. Rahmany, N.N.A. Asbullah, M.A. Sathar, M.H.A. Rasedee, A.F.N. |
| author_sort | Isa, M.A.M. |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-09-25T03:39:23Z |
| format | Article |
| id | upm.eprints-106322 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-09-25T03:39:23Z |
| publishDate | 2019 |
| publisher | IOP Publishing |
| record_format | dspace |
| spelling | upm.eprints-1063222024-04-25T09:15:25Z http://psasir.upm.edu.my/id/eprint/106322/ On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem Isa, M.A.M. Rahmany, N.N.A. Asbullah, M.A. Sathar, M.H.A. Rasedee, A.F.N. 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. IOP Publishing 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/106322/1/Isa_2019_J._Phys.__Conf._Ser._1366_012021.pdf Isa, M.A.M. and Rahmany, N.N.A. and Asbullah, M.A. and Sathar, M.H.A. and Rasedee, A.F.N. (2019) On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem. Journal of Physics: Conference Series, 1366 (1). art. no. 012021. pp. 1-6. ISSN 1742-6588; ESSN: 1742-6596 https://iopscience.iop.org/article/10.1088/1742-6596/1366/1/012021 10.1088/1742-6596/1366/1/012021 |
| spellingShingle | Isa, M.A.M. Rahmany, N.N.A. Asbullah, M.A. Sathar, M.H.A. Rasedee, A.F.N. On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title | On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title_full | On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title_fullStr | On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title_full_unstemmed | On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title_short | On the insecurity of generalized (Rivest-Shamir-Adleman) - advance and adaptable cryptosystem |
| title_sort | on the insecurity of generalized rivest shamir adleman advance and adaptable cryptosystem |
| url | http://psasir.upm.edu.my/id/eprint/106322/1/Isa_2019_J._Phys.__Conf._Ser._1366_012021.pdf |
| work_keys_str_mv | AT isamam ontheinsecurityofgeneralizedrivestshamiradlemanadvanceandadaptablecryptosystem AT rahmanynna ontheinsecurityofgeneralizedrivestshamiradlemanadvanceandadaptablecryptosystem AT asbullahma ontheinsecurityofgeneralizedrivestshamiradlemanadvanceandadaptablecryptosystem AT satharmha ontheinsecurityofgeneralizedrivestshamiradlemanadvanceandadaptablecryptosystem AT rasedeeafn ontheinsecurityofgeneralizedrivestshamiradlemanadvanceandadaptablecryptosystem |