Security Bounds for the Design of Code-Based Cryptosystems
Authors:
Top Cited Papers
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 88-105
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Compact McEliece Keys from Goppa Codes2009
- Security Bounds for the Design of Code-Based Cryptosystems2009
- A method for finding codewords of small weight2005
- A Family of Fast Syndrome Based Cryptographic Hash Functions2005
- A Generalized Birthday Problem2002
- How to Achieve a McEliece-Based Digital Signature Scheme2001
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- An Observation on the Security of McEliece’s Public-Key Cryptosystem1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978