An Implementation of El-Gamal Digital Signature Scheme to Authenticate Datasets

This paper presents an implementation of the El-Gamal digital signature scheme to authenticate datasets. In a context where secure data distribution is crucial, data authentication schemes play a vital role in verifying the integrity of data transmission. The study conducted 20 replications, observing fluctuations in CPU time as the prime number length increased, indicating that finding larger prime numbers required more time. However, the use of very large prime numbers did not significantly compromise CPU time or RAM demands. The study highlights the flexibility to select prime number ranges, facilitated by the BigInteger class in Java. Future work includes the development of a complete white-box implementation of the El-Gamal scheme, detailed experiments to explain performance variations, and testing the model on real-life datasets. This paper contributes to enhancing the visibility of the El-Gamal scheme in data security and demonstrates the feasibility of using very large prime numbers for enhanced security.