• Cite Icon9
  • https://doi.org/10.1007/978-3-030-25922-8_5Copy DOI Icon

Practical Algebraic Attack on DAGS

  • Jan 1, 2019
  • Magali Bardet +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algorithm. Recently an algebraic attack was devised by Barelli and Couvreur (Asiacrypt 2018) that efficiently recovers the private key. It shows that DAGS can be totally cryptanalysed by solving a system of bilinear polynomial equations. However, some sets of DAGS parameters were not broken in practice. In this paper we improve the algebraic attack by showing that the original approach was not optimal in terms of the ratio of the number of equations to the number of variables. Contrary to the common belief that reducing at any cost the number of variables in a polynomial system is always beneficial, we actually observed that, provided that the ratio is increased and up to a threshold, the solving can be heavily improved by adding variables to the polynomial system. This enables us to recover the private keys in a few seconds. Furthermore, our experimentations also show that the maximum degree reached during the computation of the Gr\"obner basis is an important parameter that explains the efficiency of the attack. Finally, the authors of DAGS updated the parameters to take into account the algebraic cryptanalysis of Barelli and Couvreur. In the present article, we propose a hybrid approach that performs an exhaustive search on some variables and computes a Gr\"obner basis on the polynomial system involving the remaining variables. We then show that the updated set of parameters corresponding to 128-bit security can be broken with 2^83 operations.

Similar Papers
  • Conference Article
  • Citations42

Msolve

  • Jul 18, 2021
  • Jérémy Berthomieu +2
  • PDF
  • Research Article
  • Citations9

Cold Boot Attacks on the Supersingular Isogeny Key Encapsulation (SIKE) Mechanism

  • Dec 28, 2020
  • Applied Sciences
  • Ricardo Villanueva-Polanco +1
  • Conference Article
  • Citations66

The art gallery problem is ∃ ℝ-complete

  • Jun 20, 2018
  • Mikkel Abrahamsen +2
  • PDF
  • Research Article
  • Citations89

Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs

  • Nov 19, 2021
  • IACR Transactions on Cryptographic Hardware and Embedded Systems
  • Rei Ueno +5
  • PDF
  • Research Article
  • Citations58

Quantum annealing for systems of polynomial equations

  • Jul 16, 2019
  • Scientific Reports
  • Chia Cheng Chang +3
  • Research Article
  • Citations3

A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium

  • Jun 19, 2024
  • Finite Fields and Their Applications
  • Roberto La Scala +3
  • Conference Article
  • Citations39

Solving polynomial systems over finite fields

  • Jul 22, 2012
  • Luk Bettale +2
  • Supplementary Content
  • Citations5

The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs

  • Jan 01, 2018
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Christoph Berkholz
  • Conference Article
  • Citations3

Transformation between Attribute-Based Encryption and Key-Aggregate Cryptosystem

  • Aug 01, 2018
  • Chun-I Fan +3
  • Research Article
  • Citations6

Efficient lattice‐based authenticated key exchange based on key encapsulation mechanism and signature

  • Dec 30, 2020
  • IET Information Security
  • Guanhao Xue +3
  • Book Chapter
  • Citations3

Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project

  • Jan 01, 2018
  • Zhen Liu +2
  • Research Article

Systems of Polynomials for Detecting Orientable Matroids

  • Sep 01, 2013
  • Electronic Notes in Discrete Mathematics
  • J.A De Loera +3
  • Conference Article
  • Citations1

The Campus Smart Card System Based on Hybrid Cryptosystems

  • Mar 12, 2011
  • Qing Han +1
  • Book Chapter
  • Citations2

One-Round Authenticated Key Exchange without Implementation Trick

  • Jan 01, 2013
  • Kazuki Yoneyama
  • PDF
  • Research Article
  • Citations21

Fiddling the Twiddle Constants - Fault Injection Analysis of the Number Theoretic Transform

  • Mar 06, 2023
  • IACR Transactions on Cryptographic Hardware and Embedded Systems
  • Prasanna Ravi +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.