Structural properties of self-dual monomial codes with application to code-based cryptography
From MaRDI portal
Publication:2149783
DOI10.1007/978-3-030-92641-0_2OpenAlexW4206151244MaRDI QIDQ2149783
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Two decoding algorithms for linear codes
- On the enumeration of self-dual codes
- On decoding by error location and dependent sets of error positions
- Quantum information set decoding algorithms
- Self-dual codes and invariant theory
- Good self dual codes exist
- A classification of self-orthogonal codes over GF(2)
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes
- On products and powers of linear codes under componentwise multiplication
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Square Code Attack on a Modified Sidelnikov Cryptosystem
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Squares of Random Linear Codes
- A New Class of Codes for Boolean Masking of Cryptographic Computations
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Soft-decision decoding of Reed-Muller codes: recursive lists
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Security Bounds for the Design of Code-Based Cryptosystems
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A public-key cryptosystem based on binary Reed-Muller codes
- On the inherent intractability of certain coding problems (Corresp.)
- 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
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Recursive Projection-Aggregation Decoding of Reed-Muller Codes
- A Cryptographic System Based on a New Class of Binary Error-Correcting Codes
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
- Cryptanalysis of the Sidelnikov Cryptosystem
- On the classification and enumeration of self-dual codes
- On the classification and enumeration of self-dual codes
This page was built for publication: Structural properties of self-dual monomial codes with application to code-based cryptography
