Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security
Takreem Haider

TL;DR
This paper presents a novel method using differential evolution to optimize scalar selection in elliptic curve cryptography, increasing entropy and security especially in environments with weak entropy sources.
Contribution
Introduces a differential evolution-based scalar generation technique that maximizes entropy, enhancing ECC security against entropy-based attacks.
Findings
DE-optimized scalars have higher entropy than traditional methods
The approach improves resistance to side-channel and key recovery attacks
Method is suitable for resource-constrained environments like IoT and blockchain
Abstract
Elliptic Curve Cryptography (ECC) is a fundamental component of modern public-key cryptosystems that enable efficient and secure digital signatures, key exchanges, and encryption. Its core operation, scalar multiplication, denoted as , where is a base point and is a private scalar, relies heavily on the secrecy and unpredictability of . Conventionally, is selected using user input or pseudorandom number generators. However, in resource-constrained environments with weak entropy sources, these approaches may yield low-entropy or biased scalars, increasing susceptibility to side-channel and key recovery attacks. To mitigate these vulnerabilities, we introduce an optimization-driven scalar generation method that explicitly maximizes bit-level entropy. Our approach uses differential evolution (DE), a population-based metaheuristic algorithm, to search for scalars…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
