A novel PQ-KEM based on coding theory

DOI10.1007/978-3-031-80311-6_13MaRDI QIDQ6955316zbMATH OpenFDO

Authors Ekta Bindal, Abhay K. Singh, M. K. Singh

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-80311-6_13

zbMATH Keywords

IND-CCAkey encapsulation mechanismlinear codesMcEliece cryptosystemsemantic security

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cites work

• A modular analysis of the Fujisaki-Okamoto transformation
• A novel Niederreiter-like cryptosystem based on the \((u|u + \upsilon)\)-construction codes
• Algebraic soft-decision decoding of reed-solomon codes
• Fundamentals of Error-Correcting Codes
• Grover vs. McEliece
• 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 1256737 (Why is no real title available?)
• Information-set decoding for linear codes over F_q
• More on average case vs approximation complexity
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• On the inherent intractability of certain coding problems (Corresp.)
• On the Security of Subspace Subcodes of Reed–Solomon Codes for Public Key Encryption
• Semantic security for the McEliece cryptosystem without random oracles
• Syndrome Decoding Estimator

This page was built for publication: A novel PQ-KEM based on coding theory

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