The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 203-216
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A new zero-knowledge code based identification scheme with reduced communication2011
- Code Equivalence and Group Isomorphism2011
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks2011
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem2011
- The automorphism groups of linear codes and canonical representatives of their semilinear isometry classesAdvances in Mathematics of Communications, 2009
- About the code equivalence2007
- Lightweight code-based identification and signature2007
- How to Achieve a McEliece-Based Digital Signature Scheme2001
- Designs and their Codes1992
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978