A Software-Based Low-Latency Elliptic Curve Cryptography Design Over Prime Fields

This paper presents an innovative approach that enhances arithmetic operations in elliptic curve cryptography (ECC) over prime fields. By strategically integrating an efficient point multiplication algorithm into ECC, we achieve a substantial acceleration in the speed and efficiency of encryption and decryption processes. This improvement is further amplified by concurrent parallel execution of arithmetic operations, resulting in a significant reduction in encryption and decryption processing times. Empirical evaluations conducted across diverse datasets unequivocally validate the effectiveness of the proposed algorithm, demonstrating a remarkable acceleration of up to 23% and 40% in encryption and decryption operations, respectively. This research not only contributes to the advancement of ECC but also holds profound implications for the broader cryptographic landscape, establishing a compelling foundation for secure data communication and digital privacy.