File Encryption and Decryption Application using Elliptic Curve Diffie-Hellman Algorithm and Chaotic Map Function
Albert Toshiro Heru, Faisal Faisal, Sonya Rapinta Manalu · Procedia Computer Science · 2024
In this modern era, the exchange of information through the internet happens almost constantly. The security of this exchanged information is crucial to prevent unauthorized parties from misusing it. One frequently exchanged form of information is files. In this research, we employed the Elliptic Curve Diffie-Hellman and chaotic map function algorithms to secure files. The results of this study indicate that the Elliptic Curve Diffie-Hellman and chaotic map function algorithms can be used to secure files in the form of text, image, audio, and video by performing file encryption and decryption. We also compared the encryption and decryption times and the resistance level against attacks with methods used by previous researchers. The comparative results show that our method has faster encryption and decryption times, as well as a higher level of resilience. Using the fastest attack method, the Baby-Step, Giant-Step, the author's algorithm demonstrates a resistance level of approximately 2.16 × 10 11 % greater than Heru et al.’s [ 7 ] algorithm.