Enhancing Security and Efficiency: A Framework Combining AES, RSA, ECDH, and ECDSA
Aayush Kumar, Richa Sharma, Gireesh Kumar, Sumit Dhariwal · 2024
Evaluating Rivest Shamir Adleman and Elliptical curve cryptography algorithms with regards to their efficiency in encryption, decryption, signing and verification for various types of files (including size) on different computing platforms is the main focus of this study. A detailed examination of text files from 1KB to 1GB as well as audio files with varying lengths showed that RSA’s computational cost starts to go down significantly at higher file sizes above 100KB. On the other hand, the Elliptic curve Diffie Hellman has low and stable key exchange times across all data sizes making it very effective for fast exchanges. Moreover, the Elliptic curve Digital signature algorithm is also better than RSA digital signature because it is faster and more efficient for both signing and verification processes in any file size. In addition, a system consisting oftwo servers was investigated whereby some meaningful however noticeable time-saving effects were realized on larger documents during the encryption stage, highlighting potential positive features associated with parallel processing within high-data-volume environments. A strong cryptographic framework consists of AES for securing information, ECDH for maintaining keys privately amongst communicating partners as well as ECDSA which acts as a digital signature with multiple servers ensuring integrity and nonrepudiation. The significance of this research points out not only the strengths but also the weaknesses in modern cryptographical techniques thereby opening up opportunities to investigate resilient algorithms that will continue surviving such attacks.