Hadamard square of series connected linear codes
From MaRDI portal
Cites work
- A Distinguisher for High-Rate McEliece Cryptosystems
- A Polynomial-Time Attack on the BBCRS Scheme
- A public-key cryptosystem based on binary Reed-Muller codes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- Hadamard square of linear codes and the generalized minimal distance of Reed-Muller code of order 2
- On decoding by error location and dependent sets of error positions
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Practical algebraic attack on DAGS
- Square code attack on a modified Sidelnikov cryptosystem
- Squares of Random Linear Codes
This page was built for publication: Hadamard square of series connected linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6975576)