LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate

DOI10.1007/978-3-030-25922-8_2MaRDI QIDQ6199256zbMATH OpenFDO

Authors Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi, P. M. Santini

Publication date 23 February 2024

Published in Code-Based Cryptography (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11311/1113938

zbMATH Keywords

algorithmic optimization proceduredecryption failure rateLEDAcrypt cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Cryptanalysis of LEDAcrypt
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• On the decoding failure rate of QC-MDPC bit-flipping decoders
• QC-LDPC code-based cryptography
• A new decryption failure attack against HQC

Cited in

(2)

• Polynomial inversion algorithms in constant time for post-quantum cryptography
• HQC beyond the BSC: towards error structure-aware decoding

This page was built for publication: LEDAcrypt: QC-LDPC code-based cryptosystems with bounded decryption failure rate

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