LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
From MaRDI portal
(Redirected from Publication:1644745)
Abstract: This work presents a new code-based key encapsulation mechanism (KEM) called LEDAkem. It is built on the Niederreiter cryptosystem and relies on quasi-cyclic low-density parity-check codes as secret codes, providing high decoding speeds and compact keypairs. LEDAkem uses ephemeral keys to foil known statistical attacks, and takes advantage of a new decoding algorithm that provides faster decoding than the classical bit-flipping decoder commonly adopted in this kind of systems. The main attacks against LEDAkem are investigated, taking into account quantum speedups. Some instances of LEDAkem are designed to achieve different security levels against classical and quantum computers. Some performance figures obtained through an efficient C99 implementation of LEDAkem are provided.
Recommendations
Cited in
(29)- CAKE: CODE-based algorithm for key encapsulation
- Encryption scheme based on expanded Reed-Solomon codes
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Invertible matrices over some quotient rings: identification, generation, and analysis
- A novel classical and quantum cryptographic scheme for data encryption
- An efficient post-quantum KEM from CSIDH
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- Reproducible families of codes and cryptographic applications
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- LEDAkem
- scientific article; zbMATH DE number 7259160 (Why is no real title available?)
- scientific article; zbMATH DE number 7259165 (Why is no real title available?)
- Syndrome Decoding Estimator
- Finite non-commutative associative algebras for setting the hidden discrete logarithm problem and post-quantum cryptoschemes on its base
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- An algebraic approach to symmetric linear layers in cryptographic primitives
- On the hardness of the Lee syndrome decoding problem
- Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- On the computational hardness of the code equivalence problem in cryptography
- A new algorithm for equivalence of cyclic codes and its applications
- LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- Generic error SDP and generic error CVE
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code
This page was built for publication: LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644745)