Security Bounds for the Design of Code-Based Cryptosystems
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Compact McEliece Keys from Goppa CodesLecture Notes in Computer Science, 2009
- Security Bounds for the Design of Code-Based CryptosystemsLecture Notes in Computer Science, 2009
- A method for finding codewords of small weightPublished by Springer Science and Business Media LLC ,2005
- A Family of Fast Syndrome Based Cryptographic Hash FunctionsLecture Notes in Computer Science, 2005
- A Generalized Birthday ProblemLecture Notes in Computer Science, 2002
- How to Achieve a McEliece-Based Digital Signature SchemeLecture Notes in Computer Science, 2001
- 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 CryptosystemLecture Notes in Computer Science, 1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978