The cryptographic security of the syndrome decoding problem for rank distance codes
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 368-381
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding1996
- A new paradigm for public key identificationIEEE Transactions on Information Theory, 1996
- A new identification algorithm1996
- Cryptanalysis of Harari's identification schemeLecture Notes in Computer Science, 1995
- Improved Girault identification schemeElectronics Letters, 1994
- A new identification scheme based on syndrome decoding1994
- An alternative to the Fiat-Shamir protocolLecture Notes in Computer Science, 1990
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978