DAGS: Key encapsulation using dyadic GS codes

Abstract Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes. The scheme is proved to be IND-CCA secure in both random oracle model and quantum random oracle model. We believe that DAGS will offer competitive performance, especially when compared with other existing code-based schemes, and represent a valid candidate for post-quantum standardization.

• Publication year

  2018

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2018-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1515/jmc-2018-0027
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An efficient structural attack on NIST submission DAGS

  2018cited by this paper
• CAKE: Code-Based Algorithm for Key Encapsulation

  2017cited by this paper
• Quantum Information Set Decoding Algorithms

  2017cited by this paper
• Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory

  2017cited by this paper
• A Modular Analysis of the Fujisaki-Okamoto Transformation

  2017cited by this paper
• On lower bounds for information set decoding over q and on the effect of partial knowledge

  2017cited by this paper
• Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE

  2016cited by this paper
• Post-quantum Key Exchange - A New Hope

  2016cited by this paper
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors

  2016cited by this paper
• Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem

  2015cited by this paper
• Structural cryptanalysis of McEliece schemes with compact keys

  2015cited by this paper
• MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes

  2013cited by this paper
• Secure and Anonymous Hybrid Encryption from Coding Theory

  2013cited by this paper
• McBits: Fast Constant-Time Code-Based Cryptography

  2013cited by this paper
• A Non Asymptotic Analysis of Information Set Decoding

  2013cited by this paper
• Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes

  2012cited by this paper
• Compact McEliece keys based on quasi-dyadic Srivastava codes

  2012cited by this paper
• Monoidic Codes in Cryptography

  2011cited by this paper
• A distinguisher for high rate McEliece cryptosystems

  2011cited by this paper
• Statistical Decoding of Codes over $\mathbb{F}_q$

  2011cited by this paper
• A Timing Attack against the Secret Permutation in the McEliece PKC

  2010cited by this paper
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys

  2010cited by this paper
• Information-Set Decoding for Linear Codes over Fq

  2010cited by this paper
• Grover vs. McEliece

  2010cited by this paper
• Reducing Key Length of the McEliece Cryptosystem

  2009cited by this paper
• Compact McEliece Keys from Goppa Codes

  2009cited by this paper
• Side Channels in the McEliece PKC

  2008cited by this paper
• Semantic security for the McEliece cryptosystem without random oracles

  2008cited by this paper
• McEliece Cryptosystem Implementation: Theory and Practice

  2008cited by this paper
• Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem

  2007cited by this paper
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

  2003cited by this paper
• A Statistical Decoding Algorithm for General Linear Block Codes

  2001cited by this paper
• How to Achieve a McEliece-Based Digital Signature Scheme

  2001cited by this paper
• Secure Integration of Asymmetric and Symmetric Encryption Schemes

  1999cited by this paper
• Complexity Issues in Coding Theory

  1997cited by this paper
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  1995cited by this paper
• A public key cryptosystem based on algebraic coding theory

  1978cited by this paper
• On the inherent intractability of certain coding problems (Corresp.)

  1978cited by this paper
• On the complexity of decoding goppa codes

  1977cited by this paper
• The use of information sets in decoding cyclic codes

  1962cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• Quantum-safe Encryption: A New Method to Reduce Complexity and/or Improve Security Level

  2024cites this paper
• Design criteria of a new code-based KEM

  2024cites this paper
• Inj-Kyber: Enhancing CRYSTALS-Kyber with Information Injection within a Bio-KEM Framework

  2023cites this paper
• Code-based Key Encapsulation Mechanism Preserving Short Ciphertext and Secret Key

  2022influential citation
• Composable Cachelets: Protecting Enclaves from Cache Side-Channel Attacks

  2022cites this paper
• A Novel Classical and Quantum Cryptographic Scheme for Data Encryption

  2022cites this paper
• Reproducible families of codes and cryptographic applications

  2021cites this paper
• A code-based hybrid signcryption scheme

  2021cites this paper
• Secure Code-Based Key Encapsulation Mechanism with Short Ciphertext and Secret Key

  2021cites this paper
• Information Security and Cryptology – ICISC 2019: 22nd International Conference, Seoul, South Korea, December 4–6, 2019, Revised Selected Papers

  2020cites this paper
• Properties of constacyclic codes under the Schur product

  2020cites this paper
• Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability

  2020cites this paper
• From Key Encapsulation to Authenticated Group Key Establishment—A Compiler for Post-Quantum Primitives †

  2019cites this paper
• DAGS: Reloaded Revisiting Dyadic Key Encapsulation

  2019cites this paper
• Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations

  2019cites this paper
• Cryptanalysis of a system based on twisted Reed–Solomon codes

  2019cites this paper
• Practical Algebraic Attack on DAGS

  2019cites this paper
• Don ’ t forget your roots : constant-time root finding over F 2

  2019cites this paper
• Don't Forget Your Roots: Constant-Time Root Finding over \mathbb F_2^m F 2 m

  2019cites this paper
• Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastava code

  2019cites this paper
• Selected constructive and destructive approaches to post-quantum cryptography

  2019cites this paper
• Survey on cryptanalysis of code-based cryptography: From theoretical to physical attacks

  2018cites this paper
• NIST PQC: CODE-BASED CRYPTOSYSTEMS

  2018cites this paper
• Generalization of the Ball-Collision Algorithm

  2018cites this paper
• Properties of constacyclic codes under the Schur product

  2018cites this paper
• Designing Efficient Dyadic Operations for Cryptographic Applications

  2018influential citation
• Reproducible Codes and Cryptographic Applications

  2018cites this paper