LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
From MaRDI portal
Publication:1644745
DOI10.1007/978-3-319-79063-3_1zbMATH Open1425.94046arXiv1801.08867OpenAlexW2963690407WikidataQ57717340 ScholiaQ57717340MaRDI QIDQ1644745FDOQ1644745
Authors: Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi, P. M. Santini 
Publication date: 22 June 2018
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.
Full work available at URL: https://arxiv.org/abs/1801.08867
Recommendations
code-based cryptographyNiederreiter cryptosystempost-quantum cryptographykey encapsulation mechanismquasi-cyclic low-density parity-check codes
Cited In (29)
- Syndrome Decoding Estimator
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite non-commutative associative algebras for setting the hidden discrete logarithm problem and post-quantum cryptoschemes on its base
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Reproducible families of codes and cryptographic applications
- A novel classical and quantum cryptographic scheme for data encryption
- Encryption scheme based on expanded Reed-Solomon codes
- A new algorithm for equivalence of cyclic codes and its applications
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- An efficient post-quantum KEM from CSIDH
- Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes
- LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate
- LEDAkem
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- On the hardness of the Lee syndrome decoding problem
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- On the computational hardness of the code equivalence problem in cryptography
- Invertible matrices over some quotient rings: identification, generation, and analysis
- An algebraic approach to symmetric linear layers in cryptographic primitives
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- CAKE: CODE-based algorithm for key encapsulation
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- Generic error SDP and generic error CVE
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
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)
