A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes

02/04/2020
by   Julian Danner, et al.
0

A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in parts of the secret key. For the resulting system of polynomial equations, we present an efficient solving strategy and show how to extend certain solutions to alternative secret keys. We also provide estimates for the expected number of required fault injections, apply the framework to state-of-the-art security levels, and propose countermeasures against this type of fault attack.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2018

Recovering short secret keys of RLCE in polynomial time

We present a key recovery attack against Y. Wang's Random Linear Code En...
research
02/22/2019

Attacking Hardware AES with DFA

We present the first practical attack on a hardware AES accelerator with...
research
06/09/2022

AFIA: ATPG-Guided Fault Injection Attack on Secure Logic Locking

The outsourcing of the design and manufacturing of integrated circuits h...
research
03/08/2021

A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version)

The iterative conditional branchings appear in various sensitive algorit...
research
01/11/2018

Repairing the Faure-Loidreau Public-Key Cryptosystem

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
research
06/13/2021

Single Event Transient Fault Analysis of ELEPHANT cipher

In this paper, we propose a novel fault attack termed as Single Event Tr...
research
05/09/2019

Practical Algebraic Attack on DAGS

DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic...

Please sign up or login with your details

Forgot password? Click here to reset