Breaking a fully Balanced ASIC Coprocessor Implementing Complete Addition Formulas on Weierstrass Elliptic Curves

01/04/2022
by   Ievgen Kabin, et al.
0

In this paper we report on the results of selected horizontal SCA attacks against two open-source designs that implement hardware accelerators for elliptic curve cryptography. Both designs use the complete addition formula to make the point addition and point doubling operations indistinguishable. One of the designs uses in addition means to randomize the operation sequence as a countermeasure. We used the comparison to the mean and an automated SPA to attack both designs. Despite all these countermeasures, we were able to extract the keys processed with a correctness of 100

READ FULL TEXT

page 3

page 4

page 6

research
11/08/2021

High-degree compression functions on alternative models of elliptic curves and their applications

This paper presents method for obtaining high-degree compression functio...
research
01/24/2022

On the Complexity of Attacking Elliptic Curve Based Authentication Chips

In this paper we discuss the difficulties of mounting successful attack ...
research
01/05/2022

Clustering versus Statistical Analysis for SCA: when Machine Learning is Better

Evaluation of the resistance of implemented cryptographic algorithms aga...
research
06/13/2023

Quantum Circuit Designs of Point Doubling for Binary Elliptic Curves

In the past years, research on Shor's algorithm for solving elliptic cur...
research
10/23/2022

Radical isogenies and modular curves

This article explores the connection between radical isogenies and modul...
research
01/27/2021

An Open-source Library of Large Integer Polynomial Multipliers

Polynomial multiplication is a bottleneck in most of the public-key cryp...
research
09/07/2020

A Fast Parametric Ellipse Algorithm

This paper describes a 2-D graphics algorithm that uses shifts and adds ...

Please sign up or login with your details

Forgot password? Click here to reset