Structural properties of self-dual monomial codes with application to code-based cryptography

DOI10.1007/978-3-030-92641-0_2MaRDI QIDQ2149783zbMATH OpenOpenAlexFDO

Authors Vlad-Florin Drăgoi, Andreea Szocs

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92641-0_2

zbMATH Keywords

self-dual codeMcEliece cryptosystemReed-Muller codeSchur productmonomial code

Mathematics Subject Classification ID

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

Recommendations

• Monoidic codes in cryptography
• Structural cryptanalysis of McEliece schemes with compact keys
• Enhanced public key security for the McEliece cryptosystem
• On the constructions of MDS self-dual codes via cyclotomy
• scientific article; zbMATH DE number 2154508

Cites work

• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2154515 (Why is no real title available?)
• A Cryptographic System Based on a New Class of Binary Error-Correcting Codes
• A New Class of Codes for Boolean Masking of Cryptographic Computations
• A classification of self-orthogonal codes over GF(2)
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A public-key cryptosystem based on binary Reed-Muller codes
• Construction of self-dual binary \([2^{2k}, 2^{2k-1}, 2^k]\)-codes
• Cryptanalysis of the McEliece public key cryptosystem based on polar codes
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
• Cryptanalysis of the Sidelnikov Cryptosystem
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Good self dual codes exist
• On computing nearest neighbors with applications to decoding of binary linear codes
• On decoding by error location and dependent sets of error positions
• On products and powers of linear codes under componentwise multiplication
• On the classification and enumeration of self-dual codes
• On the classification and enumeration of self-dual codes
• On the enumeration of self-dual codes
• On the inherent intractability of certain coding problems (Corresp.)
• Quantum information set decoding algorithms
• Recursive Projection-Aggregation Decoding of Reed-Muller Codes
• Security bounds for the design of code-based cryptosystems
• Self-dual codes and invariant theory
• Soft-decision decoding of Reed-Muller codes: recursive lists
• Square code attack on a modified Sidelnikov cryptosystem
• Squares of Random Linear Codes
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
• Two decoding algorithms for linear codes

Cited in

(2)

• Monoidic codes in cryptography
• scientific article; zbMATH DE number 609982 (Why is no real title available?)

Describes a project that uses

Uses Software

• BIKE
• McEliece

This page was built for publication: Structural properties of self-dual monomial codes with application to code-based cryptography

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