Construction of quasi-cyclic alternant codes and their application in code-based cryptography

DOI10.17223/20710410/65/5MaRDI QIDQ6646052zbMATH OpenFDO

Authors A. A. Kuninets, Ekaterina Sergeevna Malygina

Publication date 29 November 2024

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/20710410/65/5

zbMATH Keywords

algebraic-geometric codealternant codesautomorphism group of a codefunction fieldsinvariant codesquasi-cyclic codes

Mathematics Subject Classification ID

Quantum theory (81-XX) Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
• Asymptotics and improvements of sieving for codes
• Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
• On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes

Cites work

• Algebraic-geometry codes and decoding by error-correcting pairs
• Calculation of error-correcting pairs for an algebraic-geometric code
• Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
• On automorphisms of geometric Goppa codes

Cited in

(1)

• Asymptotics and improvements of sieving for codes

This page was built for publication: Construction of quasi-cyclic alternant codes and their application in code-based cryptography

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