McEliece Cryptosystem Implementation: Theory and Practice
- 1 January 2008
- 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 15 references indexed in Scilit:
- Finding the permutation between equivalent linear codes: the support splitting algorithmIEEE Transactions on Information Theory, 2000
- Chosen-Ciphertext Security for Any One-Way CryptosystemLecture Notes in Computer Science, 2000
- Reaction Attacks against Several Public-Key CryptosystemLecture Notes in Computer Science, 1999
- 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
- Failure of the McEliece public-key cryptosystem under message-resend and related-message attackLecture Notes in Computer Science, 1997
- Factoring polynomials using binary representations of finite fieldsIEEE Transactions on Information Theory, 1997
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- The algebraic decoding of Goppa codesIEEE Transactions on Information Theory, 1975
- Enumerative source encodingIEEE Transactions on Information Theory, 1973
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970