On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes
From MaRDI portal
Publication:4972204
DOI10.14529/jcem180202zbMath1429.94057OpenAlexW2884715055MaRDI QIDQ4972204
V. M. Deundyak, Yury V. Kosolapov
Publication date: 23 November 2019
Published in: Journal of Computational and Engineering Mathematics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/jcem116
Related Items (2)
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
Uses Software
Cites Work
- Enhanced public key security for the McEliece cryptosystem
- Semantic security for the McEliece cryptosystem without random oracles
- How to mask the structure of codes for a cryptographic use
- Post-Quantum Cryptography
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Grover vs. McEliece
- MicroEliece: McEliece for Embedded Devices
- The vec-permutation matrix, the vec operator and Kronecker products: a review
- On the edge-independence number and edge-covering number for regular graphs
- Cryptanalysis of the Sidelnikov Cryptosystem
- Selecting cryptographic key sizes
This page was built for publication: On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes