DAGS: key encapsulation using dyadic GS codes

DOI10.1515/jmc-2018-0027zbMath1420.94102OpenAlexW2794738673MaRDI QIDQ1755960

Kris Gaj, Jean Belo Klamti, Paulo S. L. M. Barreto, Gilbert Ndollane Dione, Richard Haeussler, Pierre-Louis Cayrel, Brice Odilon Boidje, Duc Tri Nguyen, Ousmane N'diaye, Jefferson E. Ricardini, Edoardo Persichetti, Gustavo Banegas, Cheikh Thiecoumba Gueye

Publication date: 11 January 2019

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/dags(20c8f26d-8381-4ddc-a877-27466762a806).html

zbMATH Keywords

code-based cryptographykey exchangepost-quantum cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60)

Related Items (11)

A novel classical and quantum cryptographic scheme for data encryption ⋮ Generalization of the Ball-Collision Algorithm ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ Properties of constacyclic codes under the Schur product ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Designing efficient dyadic operations for cryptographic applications ⋮ Improvement of algebraic attacks for solving superdetermined MinRank instances ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ A code-based hybrid signcryption scheme ⋮ Reproducible families of codes and cryptographic applications ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes

Uses Software

• McEliece
• McBits
• CAKE
• FrodoKEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural cryptanalysis of McEliece schemes with compact keys
• Semantic security for the McEliece cryptosystem without random oracles
• Some new NP-complete coding problems
• An efficient structural attack on NIST submission DAGS
• Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
• Quantum information set decoding algorithms
• A modular analysis of the Fujisaki-Okamoto transformation
• CAKE: CODE-based algorithm for key encapsulation
• Secure integration of asymmetric and symmetric encryption schemes
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• McBits: Fast Constant-Time Code-Based Cryptography
• Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
• Monoidic Codes in Cryptography
• Statistical Decoding of Codes over $\mathbb{F}_q$
• McEliece Cryptosystem Implementation: Theory and Practice
• Side Channels in the McEliece PKC
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Grover vs. McEliece
• Information-Set Decoding for Linear Codes over F q
• A Timing Attack against the Secret Permutation in the McEliece PKC
• Reducing Key Length of the McEliece Cryptosystem
• Compact McEliece Keys from Goppa Codes
• On the complexity of decoding Goppa codes (Corresp.)
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• A Statistical Decoding Algorithm for General Linear Block Codes
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Secure and Anonymous Hybrid Encryption from Coding Theory
• A Distinguisher for High-Rate McEliece Cryptosystems

This page was built for publication: DAGS: key encapsulation using dyadic GS codes