\textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}

DOI10.1007/978-3-031-46495-9_8MaRDI QIDQ6550587zbMATHFDO

Authors Dong Chan Kim, Chang-Yeol Jeon, Yeonghyo Kim, Min Ji Kim

Publication date 5 June 2024

zbMATH Keywords

post-quantum cryptographybinary separable Goppa codecode-based key encapsulation mechanismPatterson decoding

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 3458474 (Why is no real title available?)
• A Distinguisher for High-Rate McEliece Cryptosystems
• A modular analysis of the Fujisaki-Okamoto transformation
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Attacking and Defending the McEliece Cryptosystem
• Cryptanalysis of the Sidelnikov Cryptosystem
• 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})\)
• LSH: a new fast secure hash function family
• On computing nearest neighbors with applications to decoding of binary linear codes
• On the edge-independence number and edge-covering number for regular graphs
• On the inherent intractability of certain coding problems (Corresp.)
• Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
• Reducibility among combinatorial problems
• Secure integration of asymmetric and symmetric encryption schemes
• Security bounds for the design of code-based cryptosystems
• Shift-register synthesis and BCH decoding
• Smaller decoding exponents: ball-collision decoding
• The algebraic decoding of Goppa codes
• Totally decomposed cumulative Goppa codes with improved estimations

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)