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

• URL: http://arxiv.org/abs/2508.13520v1
• Date: Tue, 19 Aug 2025 05:26:07 GMT
• Title: Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security
• Abstract summary: Elliptic Curve Cryptography (ECC) is a fundamental component of modern public-key cryptosystems.<n>We introduce an optimization-driven scalar generation method that explicitly maximizes bit-level entropy.<n>The proposed method can be integrated into existing ECC-based protocols, offering a deterministic, tunable alternative to traditional randomness.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 $k \cdot P$, where $P$ is a base point and $k$ is a private scalar, relies heavily on the secrecy and unpredictability of $k$. Conventionally, $k$ 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 whose binary representations exhibit maximal entropy, defined by an even and statistically uniform distribution of ones and zeros. This reformulation of scalar selection as an entropy-optimization problem enhances resistance to entropy-based cryptanalytic techniques and improves overall unpredictability. Experimental results demonstrate that DE-optimized scalars achieve entropy significantly higher than conventionally generated scalars. The proposed method can be integrated into existing ECC-based protocols, offering a deterministic, tunable alternative to traditional randomness, ideal for applications in blockchain, secure messaging, IoT, and other resource-constrained environments.

Related papers

• Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization [11.723535704837266]
  Zeroth-Order (ZO) optimization is pivotal for scenarios where backpropagation is unavailable.<n>Existing methods face a stark trade-off: they are sample-inefficient (e.g., standard finite differences) or suffer from high variance due to randomized estimation.<n>In this work, we propose Coherent Coordinate Descent (CoCD), a deterministic, sample-efficient, and budget-aware ZO.
  arXiv  Detail & Related papers  (2026-05-14T04:52:24Z)
• Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization [53.75029276020459]
  We propose an adaptive entropy flow balancing mechanism that rescales entropy-increasing and entropy-decreasing updates according to their contributions to entropy change.<n>Experiments on six mathematical reasoning benchmarks demonstrate that OPEFO improves training and final performance.
  arXiv  Detail & Related papers  (2026-05-12T04:08:17Z)
• A chaotic flux cipher based on the random cubic family $f_{c_n}(z)=z^3+c_n z$ [37.406100634766645]
  This paper presents a symmetric stream cipher that utilizes the dynamic properties of random mappings in the complex cubic plane to generate pseudo-random key streams.<n>The Python implementation integrates secure key derivation, robust key stream generation via warmed-up, and an authenticated encryption using the modern cryptographic primitives.
  arXiv  Detail & Related papers  (2026-03-21T20:35:40Z)
• Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning [32.332197731504046]
  Decoding strategies play a central role in shaping the reasoning ability of large language models.<n>Traditional methods such as greedy decoding and beam search often suffer from error propagation.<n>We propose an entropy-guided decoding framework that introduces token-level adaptivity into generation.
  arXiv  Detail & Related papers  (2026-03-10T23:08:26Z)
• TABES: Trajectory-Aware Backward-on-Entropy Steering for Masked Diffusion Models [35.327100592206115]
  Backward-on-Entropy (BoE) Steering is a gradient-guided inference framework that approximates infinite-horizon context via a single backward pass.<n>To ensure scalability, we introduce ttexttActiveQueryAttention, a sparse adjoint primitive that exploits the structure of the masking objective to reduce backward pass complexity.
  arXiv  Detail & Related papers  (2026-01-30T19:10:32Z)
• DeepWKB: Learning WKB Expansions of Invariant Distributions for Stochastic Systems [6.482696821807494]
  This paper introduces a novel deep learning method, called DeepWKB, for estimating the invariant distribution of randomly perturbed systems.<n>By utilizing both Monte Carlo data and the partial differential equations satisfied by $V$ and $Z_epsilon$, the DeepWKB method computes $V$ and $Z_epsilon$ separately.<n>It provides a scalable and flexible alternative for computing the quasi-potential, which plays a key role in the analysis of rare events, metastability, and the stability of complex systems.
  arXiv  Detail & Related papers  (2025-08-13T06:23:06Z)
• Analytic Rényi Entropy Bounds for Device-Independent Cryptography [0.0]
  Device-independent (DI) cryptography represents the highest level of security.<n>We provide a simple method to obtain tighter finite-size security proofs for protocols based on the CHSH game.
  arXiv  Detail & Related papers  (2025-07-10T01:15:28Z)
• Adaptive Variation-Resilient Random Number Generator for Embedded Encryption [7.239794172995]
  We present an adaptive variation-resilient RNG capable of extracting unbiased encryption-grade random number streams from physically driven entropy sources.<n>The generated unbiased bit streams, due to their higher entropy, then only need to undergo simplified post-processing.
  arXiv  Detail & Related papers  (2025-07-07T22:42:49Z)
• Entropy-Based Block Pruning for Efficient Large Language Models [81.18339597023187]
  We propose an entropy-based pruning strategy to enhance efficiency while maintaining performance.<n> Empirical analysis reveals that the entropy of hidden representations decreases in the early blocks but progressively increases across most subsequent blocks.
  arXiv  Detail & Related papers  (2025-04-04T03:42:34Z)
• Efficient Safety Alignment of Large Language Models via Preference Re-ranking and Representation-based Reward Modeling [84.00480999255628]
  Reinforcement Learning algorithms for safety alignment of Large Language Models (LLMs) encounter the challenge of distribution shift.<n>Current approaches typically address this issue through online sampling from the target policy.<n>We propose a new framework that leverages the model's intrinsic safety judgment capability to extract reward signals.
  arXiv  Detail & Related papers  (2025-03-13T06:40:34Z)
• Smoothed Normalization for Efficient Distributed Private Optimization [54.197255548244705]
  Federated learning enables machine learning models with privacy of participants.<n>There is no differentially private distributed method for training, non-feedback problems.<n>We introduce a new distributed algorithm $alpha$-$sf NormEC$ with provable convergence guarantees.
  arXiv  Detail & Related papers  (2025-02-19T07:10:32Z)
• Bounding the conditional von-Neumann entropy for device independent cryptography and randomness extraction [0.0]
  This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. The framework offers an adaptable tool for practical quantum cryptographic protocols, expanding secure communication in untrusted environments.
  arXiv  Detail & Related papers  (2024-11-07T16:48:49Z)
• Dynamic Kernel-Based Adaptive Spatial Aggregation for Learned Image Compression [63.56922682378755]
  We focus on extending spatial aggregation capability and propose a dynamic kernel-based transform coding. The proposed adaptive aggregation generates kernel offsets to capture valid information in the content-conditioned range to help transform. Experimental results demonstrate that our method achieves superior rate-distortion performance on three benchmarks compared to the state-of-the-art learning-based methods.
  arXiv  Detail & Related papers  (2023-08-17T01:34:51Z)
• GloptiNets: Scalable Non-Convex Optimization with Certificates [61.50835040805378]
  We present a novel approach to non-cube optimization with certificates, which handles smooth functions on the hypercube or on the torus. By exploiting the regularity of the target function intrinsic in the decay of its spectrum, we allow at the same time to obtain precise certificates and leverage the advanced and powerful neural networks.
  arXiv  Detail & Related papers  (2023-06-26T09:42:59Z)
• Generalizing Bayesian Optimization with Decision-theoretic Entropies [102.82152945324381]
  We consider a generalization of Shannon entropy from work in statistical decision theory. We first show that special cases of this entropy lead to popular acquisition functions used in BO procedures. We then show how alternative choices for the loss yield a flexible family of acquisition functions.
  arXiv  Detail & Related papers  (2022-10-04T04:43:58Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.