Distinguishability Investigation on Longa's Atomic Patterns when used as a Basis for Implementing Elliptic Curve Scalar Multiplication Algorithms

• URL: http://arxiv.org/abs/2409.13742v1
• Date: Tue, 10 Sep 2024 19:52:57 GMT
• Title: Distinguishability Investigation on Longa's Atomic Patterns when used as a Basis for Implementing Elliptic Curve Scalar Multiplication Algorithms
• Abstract summary: This thesis delves into the investigation of Longa's atomic patterns applied within Elliptic Curve scalar multiplication algorithms. The research employs these atomic patterns in practical implementation on a microcontroller. A significant contribution of this work is the identification and correction of several discrepancies in Longa's original atomic patterns.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In the evolving landscape of cryptographic security, the robustness of Elliptic Curve Cryptography (ECC) against side-channel analysis (SCA) attacks is of paramount importance due to the widespread use of ECC and the growing sophistication of SCAs. This thesis delves into the investigation of Longa's atomic patterns applied within Elliptic Curve scalar multiplication algorithms, assessing their resistance to horizontal SCAs. The research employs these atomic patterns in practical implementation on a microcontroller (Texas Instruments Launchpad F28379 board) using the open-source cryptographic library FLECC in C. In our analysis, we only focused on the distinguishability of the first atomic block in the Elliptic Curve point doubling and point addition patterns. Due to various technical limitations, we were unable to determine significant differences in the execution time and the shapes of the atomic blocks. Further investigations of the SCA-resistance can be performed based on this work. A significant contribution of this work is the identification and correction of several discrepancies in Longa's original atomic patterns. This thesis marks the first practical implementation of Longa's patterns, extending the theoretical research into empirical analysis.

Related papers

• CryptanalysisBench: Can LLMs do Cryptanalysis? [76.79639292270497]
  We introduce CryptanalysisBench, 191 tasks across six families of cryptographic primitives.<n>Our benchmark consists of three tiers: (i) primitives with known practical breaks; (ii) primitives with no known practical break, evaluated both at full strength and as scaled-down variants.<n>Five frontier models break 65%-86% of Tier 1 schemes, 6-12 Tier-2 schemes at full strength, and 24-61 across all scaled-down variants.
  arXiv  Detail & Related papers  (2026-07-20T22:09:40Z)
• Horizontal SCA Attacks on Binary kP Algorithms using Chevallier-Mames Atomic Blocks [0.0]
  We show that binary right-to left and left-to-right kP algorithms, when implemented with Chevallier-Mames atomic block patterns, are still vulnerable to single-trace SCA attacks.<n>The vulnerability remains true for the left-to-right kP algorithm with projective coordinate randomization.
  arXiv  Detail & Related papers  (2026-04-24T10:42:12Z)
• On Multi-Step Theorem Prediction via Non-Parametric Structural Priors [50.16583672681106]
  In this work, we explore training-free theorem prediction through the lens of in-context learning (ICL)<n>We propose Theorem Precedence Graphs, which encode temporal dependencies from historical solution traces as directed graphs, and impose explicit topological constraints that effectively prune the search space during inference.<n>Experiments on the FormalGeo7k benchmark show that our method achieves 89.29% accuracy, substantially outperforming ICL baselines and matching state-of-the-art supervised models.
  arXiv  Detail & Related papers  (2026-03-05T06:08:50Z)
• Hessian Spectral Analysis at Foundation Model Scale [1.9244735303181757]
  We show that faithful spectral analysis of the true Hessian is tractable at frontier scale.<n>We produce the first large-scale spectral density estimates beyond the sub-10B regime.
  arXiv  Detail & Related papers  (2026-01-31T16:57:06Z)
• Why Attention Patterns Exist: A Unifying Temporal Perspective Analysis [61.597286699809395]
  We introduce textbfTemporal Attention Pattern Predictability Analysis (TAPPA)<n>TAPPA characterizes attention patterns as predictable patterns with clear regularities and unpredictable patterns that appear effectively random.<n>We provide a detailed mathematical analysis of three representative cases through the joint effect of queries, keys, and Rotary Positional Embeddings (RoPE)
  arXiv  Detail & Related papers  (2026-01-29T13:40:23Z)
• How and Why LLMs Generalize: A Fine-Grained Analysis of LLM Reasoning from Cognitive Behaviors to Low-Level Patterns [51.02752099869218]
  Large Language Models (LLMs) display strikingly different generalization behaviors.<n>We introduce a novel benchmark that decomposes reasoning into atomic core skills.<n>We show that RL-tuned models maintain more stable behavioral profiles and resist collapse in reasoning skills, whereas SFT models exhibit sharper drift and overfit to surface patterns.
  arXiv  Detail & Related papers  (2025-12-30T08:16:20Z)
• Investigation Of The Distinguishability Of Giraud-Verneuil Atomic Blocks [0.0]
  We study the Giraud and Verneuil atomic pattern for kP, implementing it using the right-to-left kP algorithm on the NIST EC P-256 curve.<n>We measure Electromagnetic (EM) emissions during kP using a Lecroy WavePro 604HD Oscilloscope, a Langer ICS 105 Integrated Circuit Scanner, and a Langer MFA-R 0.2-75 Near Field Probe.<n>Results show that, although the atomic pattern is correctly implemented with dummy operations, resistance to SCA can still be affected by additional processes inserted at hardware or software level.
  arXiv  Detail & Related papers  (2025-08-31T10:09:34Z)
• Understanding In-Context Learning on Structured Manifolds: Bridging Attention to Kernel Methods [48.038668788625465]
  In-context learning (ICL) has achieved remarkable success in natural language and vision domains.<n>In this work, we initiate a theoretical study of ICL for regression of H"older functions on manifold.<n>Our findings provide foundational insights into the role of geometry in ICL and novels tools to study ICL of nonlinear models.
  arXiv  Detail & Related papers  (2025-06-12T17:56:26Z)
• Unveiling ECC Vulnerabilities: LSTM Networks for Operation Recognition in Side-Channel Attacks [6.373405051241682]
  We propose a novel approach for performing side-channel attacks on elliptic curve cryptography. We adopt a long-short-term memory (LSTM) neural network to analyze a power trace and identify patterns of operation. We show that current countermeasures, specifically the coordinate randomization technique, are not sufficient to protect against side channels.
  arXiv  Detail & Related papers  (2025-02-24T17:02:40Z)
• Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning [56.22841701016295]
  Supervised Causal Learning (SCL) is an emerging paradigm in this field. Existing Deep Neural Network (DNN)-based methods commonly adopt the "Node-Edge approach"
  arXiv  Detail & Related papers  (2025-02-15T19:10:35Z)
• CEKER: A Generalizable LLM Framework for Literature Analysis with a Case Study in Unikernel Security [0.0]
  This research introduces a novel, generalizable approach to literature analysis called CEKER. It uses a three-step process to streamline the collection of literature, the extraction of key insights, and the summarized analysis of key trends and gaps.
  arXiv  Detail & Related papers  (2024-12-14T17:28:43Z)
• Revisiting Atomic Patterns for Elliptic Curve Scalar Multiplication Revealing Inherent Vulnerability to Simple SCA [0.0]
  kP operation is the basic operation in all Elliptic Curve based cryptographic protocols. In this work, we investigated the resistance of a kP algorithm implemented in hardware using Longa's atomic patterns.
  arXiv  Detail & Related papers  (2024-12-04T11:13:04Z)
• Practical Investigation on the Distinguishability of Longa's Atomic Patterns [0.0]
  We implement a binary elliptic curve scalar multiplication kP algorithm with Longa's atomic patterns for the NIST elliptic curve P-256. We measured and analysed an electromagnetic trace of a single kP execution on a microcontroller.
  arXiv  Detail & Related papers  (2024-09-18T10:48:31Z)
• A Machine Learning Based Approach for Statistical Analysis of Detonation Cells from Soot Foils [0.0]
  The proposed algorithm is designed to accurately extract cellular patterns without a training procedure or dataset. The results demonstrated consistent accuracy, with errors remaining within 10%, even in complex cases. This work highlights the broad applicability and potential of the algorithm to advance the understanding of detonation wave dynamics.
  arXiv  Detail & Related papers  (2024-09-10T12:50:46Z)
• Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees [63.18324983384337]
  We introduce the first learning to rank method for Gradient Boosted Decision Trees (GBDTs) Our main contribution is a novel estimator for the second-order derivatives, i.e., the Hessian matrix. We incorporate our estimator into the existing PL-Rank framework, which was originally designed for first-order derivatives only.
  arXiv  Detail & Related papers  (2024-04-18T13:53:32Z)
• An ADRC-Incorporated Stochastic Gradient Descent Algorithm for Latent Factor Analysis [6.843073158719234]
  A gradient descent (SGD)-based latent factor analysis (LFA) model is remarkably effective in extracting valuable information from an HDI matrix. A standard SGD algorithm only considers the current learning error to compute the gradient without considering the historical and future state of the learning error. This paper innovatively proposes an ADRC-incorporated SGD (ADS) algorithm by refining the instance learning error by considering the historical and future state.
  arXiv  Detail & Related papers  (2024-01-13T08:38:54Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• On the Benefits of Large Learning Rates for Kernel Methods [110.03020563291788]
  We show that a phenomenon can be precisely characterized in the context of kernel methods. We consider the minimization of a quadratic objective in a separable Hilbert space, and show that with early stopping, the choice of learning rate influences the spectral decomposition of the obtained solution.
  arXiv  Detail & Related papers  (2022-02-28T13:01:04Z)
• Tracking perovskite crystallization via deep learning-based feature detection on 2D X-ray scattering data [137.47124933818066]
  We propose an automated pipeline for the analysis of X-ray diffraction images based on the Faster R-CNN deep learning architecture. We demonstrate our method on real-time tracking of organic-inorganic perovskite structure crystallization and test it on two applications.
  arXiv  Detail & Related papers  (2022-02-22T15:39:00Z)
• A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrix [16.106653541368306]
  We show that the impact of Catastrophic Forgetting increases as two tasks increasingly align. We propose a variant of Orthogonal Gradient Descent (OGD) which leverages structure of the data. Experiments support our theoretical findings and show how our method can help reduce CF on classical CL datasets.
  arXiv  Detail & Related papers  (2020-10-07T17:35:31Z)
• Longitudinal Deep Kernel Gaussian Process Regression [16.618767289437905]
  We introduce Longitudinal deep kernel process regression (L-DKGPR) L-DKGPR automates the discovery of complex multilevel correlation structure from longitudinal data. We derive an efficient algorithm to train L-DKGPR using latent space inducing points and variational inference.
  arXiv  Detail & Related papers  (2020-05-24T15:10:48Z)
• Learnable Subspace Clustering [76.2352740039615]
  We develop a learnable subspace clustering paradigm to efficiently solve the large-scale subspace clustering problem. The key idea is to learn a parametric function to partition the high-dimensional subspaces into their underlying low-dimensional subspaces. To the best of our knowledge, this paper is the first work to efficiently cluster millions of data points among the subspace clustering methods.
  arXiv  Detail & Related papers  (2020-04-09T12:53:28Z)
• Kernel and Rich Regimes in Overparametrized Models [69.40899443842443]
  We show that gradient descent on overparametrized multilayer networks can induce rich implicit biases that are not RKHS norms. We also demonstrate this transition empirically for more complex matrix factorization models and multilayer non-linear networks.
  arXiv  Detail & Related papers  (2020-02-20T15:43:02Z)

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.