Application of Mellin-Kamal transformation in EL Gamal Ciphertext Cryptosystem / Nurul Syazwani Husairi and Nurul Aqilah Mohd Fauzi
El Gamal ciphertext cryptosystem is one of the fluently used algorithms to satisfy the security message or data transmission. Even though this algorithm alone can satisfy the need of ciphertext cryptosystem, it is vulnerable to numerous internal and external attackers such as logjam and dictionaries...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Student Project |
| Language: | English |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/93554/1/93554.pdf https://ir.uitm.edu.my/id/eprint/93554/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | El Gamal ciphertext cryptosystem is one of the fluently used algorithms to satisfy the security message or data transmission. Even though this algorithm alone can satisfy the need of ciphertext cryptosystem, it is vulnerable to numerous internal and external attackers such as logjam and dictionaries attack. So, in order to cover this disadvantage, the modification of El Gamal algorithm with application of Mellin-Kamal transformation was proposed in this study. Our main objective is to compute encryption process and develop decryption schemes using Mellin Transformation and to modify the basic El Gamal system with the application of Mellin-Kamal Transformation. On this proposed scheme, the Mellin transformation is applied on encryption and decryption process and the ciphertext obtained from applied Mellin theorem will then be used as message in Mellin-Kamal cryptosystem. This approach successfully in preventing vulnerable threats and enhance the security through the proposed scheme. Cryptographers often face a problem on key distribution process because of the existent exponential powers and modular multiplication that slower the progress. Other than that, on their proposed scheme, which is Mellin transformation scheme, Bhatti et al. (2020) seem to make the working progress in a rush which result in an uncompleted progression. So, this study contributed to show a complete calculation and working to assist other future researchers know the complete step of the proposed scheme and reduce the probability of middle attackers and strengthen the existing algorithm with several cryptosystem integration. In the further, this study can be applied on asymmetric cryptosystem by taking a large prime number and finite arrangement. Lastly, to recognize the accessibility of the proposed scheme, it can be applied on another existing cryptosystems such as digital signature schemes. |
|---|