Revisiting Atomic Patterns for Elliptic Curve Scalar Multiplication Revealing Inherent Vulnerability to Simple SCA
- URL: http://arxiv.org/abs/2412.03218v1
- Date: Wed, 04 Dec 2024 11:13:04 GMT
- Title: Revisiting Atomic Patterns for Elliptic Curve Scalar Multiplication Revealing Inherent Vulnerability to Simple SCA
- Authors: Alkistis Aikaterini Sigourou, Zoya Dyka, Sze Hei Li, Peter Langendoerfer, Ievgen Kabin,
- Abstract summary: 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.
- Score: 0.0
- License:
- Abstract: Elliptic Curve Scalar Multiplication denoted as kP operation is the basic operation in all Elliptic Curve based cryptographic protocols. The atomicity principle and different atomic patterns for kP algorithms were proposed in the past as countermeasures against simple side-channel analysis. In this work, we investigated the resistance of a kP algorithm implemented in hardware using Longa's atomic patterns. We analysed its simulated power trace. We show in the example of our kP implementation for the NIST EC P-256 that the field squaring operations are distinguishable from the field multiplications even if they are performed by the same field multiplier, due to the addressing of the second multiplicand. This inherent vulnerability of atomic patterns can be successfully exploited for revealing the scalar k.
Related papers
- 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) - 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) - Cryptographically Secure Pseudo-Random Number Generation (CS-PRNG) Design using Robust Chaotic Tent Map (RCTM) [2.0448353403141515]
This paper presents a novel method to generate cryptographically secure pseudo-random numbers (CSPRNG) using a robust chaotic tent map (RCTM)
Various statistical tests are performed that ascertain the randomness of generated secure pseudo-random bits.
arXiv Detail & Related papers (2024-08-10T15:16:00Z) - Fast Shapley Value Estimation: A Unified Approach [71.92014859992263]
We propose a straightforward and efficient Shapley estimator, SimSHAP, by eliminating redundant techniques.
In our analysis of existing approaches, we observe that estimators can be unified as a linear transformation of randomly summed values from feature subsets.
Our experiments validate the effectiveness of our SimSHAP, which significantly accelerates the computation of accurate Shapley values.
arXiv Detail & Related papers (2023-11-02T06:09:24Z) - Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits.
This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
arXiv Detail & Related papers (2022-12-25T17:01:13Z) - A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography.
In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
arXiv Detail & Related papers (2022-05-07T03:15:15Z) - Robust and Provably Monotonic Networks [0.0]
We present a new method to constrain the Lipschitz constant of dense deep learning models.
We show how the algorithm was used to train a powerful, robust, and interpretable discriminator for heavy-flavor decays in the LHCb realtime data-processing system.
arXiv Detail & Related papers (2021-11-30T19:01:32Z) - Sinkhorn Natural Gradient for Generative Models [125.89871274202439]
We propose a novel Sinkhorn Natural Gradient (SiNG) algorithm which acts as a steepest descent method on the probability space endowed with the Sinkhorn divergence.
We show that the Sinkhorn information matrix (SIM), a key component of SiNG, has an explicit expression and can be evaluated accurately in complexity that scales logarithmically.
In our experiments, we quantitatively compare SiNG with state-of-the-art SGD-type solvers on generative tasks to demonstrate its efficiency and efficacy of our method.
arXiv Detail & Related papers (2020-11-09T02:51:17Z) - 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) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z)
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.