Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory

DOI10.1007/978-3-319-59879-6_2MaRDI QIDQ1673584zbMATH OpenOpenAlexFDO

Authors Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor

Publication date 12 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-59879-6_2

zbMATH Keywords

coding theorykey exchangepost-quantum cryptography

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Dual-Ouroboros: an improvement of the McNie scheme
• A modified Dual-Ouroboros public-key encryption using Gabidulin codes
• About Low DFR for QC-MDPC Decoding
• On new key exchange multivariate protocols based on pseudorandom walks on incidence structures
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle

Cited in

(11)

• DAGS: key encapsulation using dyadic GS codes
• Dual-Ouroboros: an improvement of the McNie scheme
• Cryptanalysis of a code-based one-time signature
• Algebraic generalization of Diffie-Hellman key exchange
• LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
• On the security of REDOG
• MODRED: a code-based non-interactive key exchange protocol
• HQC beyond the BSC: towards error structure-aware decoding
• CPAKE: an identity-binding password authenticated key exchange from quasi-cyclic codes
• Breaking RHQC's post-compromise security
• Computer algebra tales on Goppa codes and McEliece cryptography

This page was built for publication: Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673584)