On two modifications of the McEliece PKE and the CFS signature scheme
From MaRDI portal
Publication:6569889
Recommendations
Cites work
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A CCA2 Secure Variant of the McEliece Cryptosystem
- A digital signature scheme based on random error-correcting codes
- A secure and efficient code-based signature scheme
- Attacking and Defending the McEliece Cryptosystem
- Durandal: a rank metric based signature scheme
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Goppa codes
- Is code equivalence easy to decide?
- LESS-FM: fine-tuning signatures from the code equivalence problem
- MURAVE: a new rank code-based signature with multiple rank verification
- On the CCA2 security of McEliece in the standard model
- On the inherent intractability of certain coding problems (Corresp.)
- Semantic security for the McEliece cryptosystem without random oracles
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The algebraic decoding of Goppa codes
- Using LDGM codes and sparse syndromes to achieve digital signatures
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: On two modifications of the McEliece PKE and the CFS signature scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569889)
