\textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
From MaRDI portal
Publication:6550587
DOI10.1007/978-3-031-46495-9_8zbMATH Open1540.94068MaRDI QIDQ6550587FDOQ6550587
Authors: Dong Chan Kim, Chang-Yeol Jeon, Yeonghyo Kim, Min Ji Kim 
Publication date: 5 June 2024
Recommendations
- DAGS: key encapsulation using dyadic GS codes
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Two new module-code-based KEMs with rank metric
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
post-quantum cryptographybinary separable Goppa codecode-based key encapsulation mechanismPatterson decoding
Cites Work
- Reducibility among combinatorial problems
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Attacking and Defending the McEliece Cryptosystem
- Security bounds for the design of code-based cryptosystems
- Title not available (Why is that?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebraic decoding of Goppa codes
- Secure integration of asymmetric and symmetric encryption schemes
- Smaller decoding exponents: ball-collision decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- Shift-register synthesis and BCH decoding
- Cryptanalysis of the Sidelnikov Cryptosystem
- A modular analysis of the Fujisaki-Okamoto transformation
- On computing nearest neighbors with applications to decoding of binary linear codes
- Totally decomposed cumulative Goppa codes with improved estimations
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- LSH: a new fast secure hash function family
This page was built for publication: \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550587)
