Enhanced Elliptic Curve Cryptography (EECC)
Zhengqi Zhang, Yan Zhao · Procedia Computer Science · 2024
In the digital age, securing data and ensuring communication confidentiality are paramount, highlighting the crucial role of public key cryptography. Traditional algorithms like RSA, while secure, have limitations due to their long key lengths and computational intensity, making them less suitable for resource-constrained environments. Elliptic Curve Cryptography (ECC) is favored for its compact keys and strong security but faces new challenges with quantum computing. To address this, we introduce Enhanced Elliptic Curve Cryptography (EECC), an algorithm that enhances security and efficiency. EECC uses secure elliptic curves, an advanced random number generator, optimized key lengths, and quantum-resistant mechanisms to fortify against quantum threats. Both theoretical analysis and empirical tests show EECC's effectiveness in thwarting attacks and improving encryption and decryption speeds, affirming its value in modern secure communications and data protection.