DAGS: key encapsulation using dyadic GS codes
From MaRDI portal
Recommendations
- Excalibur key-generation protocols for DAG hierarchic decryption
- Encryption and Error-Correction Coding Using D Sequences
- Some security bounds for the key sizes of DGHV scheme
- Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- scientific article; zbMATH DE number 2154500
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Dual system encryption framework in prime-order groups via computational pair encodings
- scientific article; zbMATH DE number 1869734
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 2088097 (Why is no real title available?)
- A Distinguisher for High-Rate McEliece Cryptosystems
- A Statistical Decoding Algorithm for General Linear Block Codes
- A key recovery attack on MDPC with CCA security using decoding errors
- A modular analysis of the Fujisaki-Okamoto transformation
- A timing attack against the secret permutation in the McEliece PKC
- Algebraic cryptanalysis of McEliece variants with compact keys
- An efficient structural attack on NIST submission DAGS
- CAKE: CODE-based algorithm for key encapsulation
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Compact McEliece keys from Goppa codes
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
- Grover vs. McEliece
- Information-set decoding for linear codes over \(\mathbb F_q\)
- McBits: fast constant-time code-based cryptography
- McEliece Cryptosystem Implementation: Theory and Practice
- Monoidic codes in cryptography
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- On the complexity of decoding Goppa codes (Corresp.)
- On the inherent intractability of certain coding problems (Corresp.)
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum information set decoding algorithms
- Reducing Key Length of the McEliece Cryptosystem
- Secure and anonymous hybrid encryption from coding theory
- Secure integration of asymmetric and symmetric encryption schemes
- Semantic security for the McEliece cryptosystem without random oracles
- Side Channels in the McEliece PKC
- Some new NP-complete coding problems
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Structural cryptanalysis of McEliece schemes with compact keys
Cited in
(19)- Two new module-code-based KEMs with rank metric
- Security analysis of a cryptosystem based on subspace subcodes
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- Properties of constacyclic codes under the Schur product
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Practical algebraic attack on DAGS
- Improvement of algebraic attacks for solving superdetermined MinRank instances
- Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes
- Designing efficient dyadic operations for cryptographic applications
- DAGS: reloaded revisiting dyadic key encapsulation
- Generalization of the ball-collision algorithm
- Reproducible families of codes and cryptographic applications
- A novel classical and quantum cryptographic scheme for data encryption
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Post-quantum cryptography: Code-based signatures
- A code-based hybrid signcryption scheme
This page was built for publication: DAGS: key encapsulation using dyadic GS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755960)
