On some cryptosystems based on algebraic codes
From MaRDI portal
Recommendations
Cites work
- Code-based cryptography
- Counting irreducible Goppa codes
- FPGA-based key generator for the Niederreiter cryptosystem using binary Goppa codes
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- McEliece Cryptosystem Implementation: Theory and Practice
- On decoding algorithms for generalized Reed-Solomon codes with errors and erasures
- On decoding algorithms for Goppa codes
- On the inherent intractability of certain coding problems (Corresp.)
- The algebraic decoding of Goppa codes
Cited in
(14)- Error control, cryptology, and speech compression. Workshop on information protection, Moscow, Russia, December 6--9, 1993. Selected papers
- Error-correcting codes in cryptology
- Mathematical models of modified crypto-code means of information protection based on coding theory schemes
- Error-correcting codes and cryptography
- Code-based cryptography
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4033660 (Why is no real title available?)
- scientific article; zbMATH DE number 47349 (Why is no real title available?)
- scientific article; zbMATH DE number 1088909 (Why is no real title available?)
- Private-key algebraic-code encryptions
- Decoding algorithms for Goppa codes with errors and erasures
- A Summary of McEliece-Type Cryptosystems and their Security
- Cryptographic Systems Based on an Algebraic Structure
- Computer algebra tales on Goppa codes and McEliece cryptography
This page was built for publication: On some cryptosystems based on algebraic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089875)
