Cryptanalysis of the BBCRS system on Reed-Muller binary code
From MaRDI portal
Recommendations
- A Polynomial-Time Attack on the BBCRS Scheme
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- On the edge-independence number and edge-covering number for regular graphs
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
Cites work
- A public-key cryptosystem based on binary Reed-Muller codes
- Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- Enhanced public key security for the McEliece cryptosystem
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- How to mask the structure of codes for a cryptographic use
- On products and powers of linear codes under componentwise multiplication
- On the edge-independence number and edge-covering number for regular graphs
Cited in
(4)
This page was built for publication: Cryptanalysis of the BBCRS system on Reed-Muller binary code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066537)