An efficient structural attack on NIST submission DAGS

05/14/2018
by   Elise Barelli, et al.
0

We present an efficient key recovery attack on code based encryption schemes using some quasi-dyadic alternant codes with extension degree 2. This attack permits to break the proposal DAGS recently submitted to NIST.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2023

An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes

In the present article, we discuss the decoding of Gabidulin and related...
research
09/12/2020

On the security of subspace subcodes of Reed-Solomon codes for public key encryption

This article discusses the security of McEliece-like encryption schemes ...
research
02/25/2020

A structural attack to the DME-(3,2,q) cryptosystem

We present a structural attack on the DME cryptosystem with paramenters ...
research
02/21/2021

A Ransomware Classification Framework Based on File-Deletion and File-Encryption Attack Structures

Ransomware has emerged as an infamous malware that has not escaped a lot...
research
04/26/2019

Cryptanalysis of a System Based on Twisted Reed-Solomon Codes

It was recently proved that twisted Reed--Solomon codes represent a fami...
research
04/28/2023

Polynomial time attack on high rate random alternant codes

A long standing open question is whether the distinguisher of high rate ...
research
03/07/2023

SALSA PICANTE: a machine learning attack on LWE with binary secrets

The Learning With Errors (LWE) problem is one of the major hard problems...

Please sign up or login with your details

Forgot password? Click here to reset