Practical Investigation on the Distinguishability of Longa's Atomic Patterns

• URL: http://arxiv.org/abs/2409.11868v2
• Date: Thu, 19 Sep 2024 09:08:38 GMT
• Title: Practical Investigation on the Distinguishability of Longa's Atomic Patterns
• Authors: Sze Hei Li, Zoya Dyka, Alkistis Aikaterini Sigourou, Peter Langendoerfer, Ievgen Kabin,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper investigates the distinguishability of the atomic patterns for elliptic curve point doubling and addition operations proposed by Longa. We implemented a binary elliptic curve scalar multiplication kP algorithm with Longa's atomic patterns for the NIST elliptic curve P-256 using the open-source cryptographic library FLECC in C. We measured and analysed an electromagnetic trace of a single kP execution on a microcontroller (TI Launchpad F28379 board). Due to various technical limitations, significant differences in the execution time and the shapes of the atomic blocks could not be determined. Further investigations of the side channel analysis-resistance can be performed based on this work. Last but not least, we examined and corrected Longa's atomic patterns corresponding to formulae proposed by Longa.

Related papers

• 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)
• Distinguishability Investigation on Longa's Atomic Patterns when used as a Basis for Implementing Elliptic Curve Scalar Multiplication Algorithms [0.0]
  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.
  arXiv  Detail & Related papers  (2024-09-10T19:52:57Z)
• Towards Efficient Time Stepping for Numerical Shape Correspondence [55.2480439325792]
  Methods based on partial differential equations (PDEs) have been established, encompassing e.g. the classic heat kernel signature. We consider here several time stepping schemes. The goal of this investigation is to assess, if one may identify a useful property of methods for time integration for the shape analysis context.
  arXiv  Detail & Related papers  (2023-12-21T13:40:03Z)
• Low-rank extended Kalman filtering for online learning of neural networks from streaming data [71.97861600347959]
  We propose an efficient online approximate Bayesian inference algorithm for estimating the parameters of a nonlinear function from a potentially non-stationary data stream. The method is based on the extended Kalman filter (EKF), but uses a novel low-rank plus diagonal decomposition of the posterior matrix. In contrast to methods based on variational inference, our method is fully deterministic, and does not require step-size tuning.
  arXiv  Detail & Related papers  (2023-05-31T03:48:49Z)
• Scalable Heteronuclear Architecture of Neutral Atoms Based on EIT [3.8525292841668546]
  We propose a scalable heteronuclear architecture of parallel implementation of CNOT gates in arrays of alkali-metal neutral atoms for quantum information processing. We numerically optimized the system parameters to achieve the fidelity for parallelly implemented CNOT gates around $mathcalF=95%$ for the experimentally feasible conditions.
  arXiv  Detail & Related papers  (2023-03-29T03:27:09Z)
• Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
  We propose a Monte Carlo PDE solver for training unsupervised neural solvers. We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles. Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-02-10T08:05:19Z)
• Gaussian process regression and conditional Karhunen-Lo\'{e}ve models for data assimilation in inverse problems [68.8204255655161]
  We present a model inversion algorithm, CKLEMAP, for data assimilation and parameter estimation in partial differential equation models. The CKLEMAP method provides better scalability compared to the standard MAP method.
  arXiv  Detail & Related papers  (2023-01-26T18:14:12Z)
• Random Features for the Neural Tangent Kernel [57.132634274795066]
  We propose an efficient feature map construction of the Neural Tangent Kernel (NTK) of fully-connected ReLU network. We show that dimension of the resulting features is much smaller than other baseline feature map constructions to achieve comparable error bounds both in theory and practice.
  arXiv  Detail & Related papers  (2021-04-03T09:08:12Z)
• Orbital MCMC [82.54438698903775]
  We propose two practical algorithms for constructing periodic orbits from any diffeomorphism. We also perform an empirical study demonstrating the practical advantages of both kernels.
  arXiv  Detail & Related papers  (2020-10-15T22:25:52Z)
• Fast Learning in Reproducing Kernel Krein Spaces via Signed Measures [31.986482149142503]
  We cast this question as a distribution view by introducing the emphsigned measure A series of non-PD kernels can be associated with the linear combination of specific finite Borel measures. Specifically, this solution is also computationally implementable in practice to scale non-PD kernels in large sample cases.
  arXiv  Detail & Related papers  (2020-05-30T12:10:35Z)
• Nonadiabatic noncyclic geometric quantum computation in Rydberg atoms [0.0]
  Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. We propose an unconventional scheme, called nonadiabatic noncyclic geometric quantum computation(NNGQC), that arbitrary single- and two-qubit geometric gate can be constructed via noncyclic non-Abeliangeometric phase.
  arXiv  Detail & Related papers  (2020-05-14T13:29:09Z)

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.