On the Berger-Loidreau cryptosystem on the tensor product of codes
From MaRDI portal
Publication:4972204
Recommendations
- Code-based cryptosystems using generalized concatenated codes
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
- Code-based cryptography
- scientific article; zbMATH DE number 1583808
- On the construction of a semantically secure modification of the McEliece cryptosystem
Cites work
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Enhanced public key security for the McEliece cryptosystem
- Grover vs. McEliece
- How to mask the structure of codes for a cryptographic use
- MicroEliece: McEliece for Embedded Devices
- On the edge-independence number and edge-covering number for regular graphs
- Post-Quantum Cryptography
- Selecting cryptographic key sizes
- Semantic security for the McEliece cryptosystem without random oracles
- The vec-permutation matrix, the vec operator and Kronecker products: a review
Cited in
(3)- Relationship between codes and idempotents in a dihedral group algebra
- The use of the direct sum decomposition algorithm for analyzing the strength of some McEliece-type cryptosystems
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
This page was built for publication: On the Berger-Loidreau cryptosystem on the tensor product of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972204)
