Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes

DOI10.1007/978-3-319-11659-4_13MaRDI QIDQ2938685zbMATH OpenOpenAlexFDO

Authors Ray Perlner

Publication date 14 January 2015

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11659-4_13

zbMATH Keywords

code-based cryptographyinformation set decodingcyclosymmetricmoderate density parity check (MDPC) codes

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Structural cryptanalysis of McEliece schemes with compact keys
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• Attacking code-based cryptosystems with information set decoding using special-purpose hardware
• A key recovery attack on MDPC with CCA security using decoding errors
• Information-set decoding for linear codes over F_q

Cited in

(4)

• Asymptotics and improvements of sieving for codes
• Construction of quasi-cyclic alternant codes and their application in code-based cryptography
• Cryptanalysis of LEDAcrypt
• Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes

This page was built for publication: Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes

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