How to Achieve a McEliece-Based Digital Signature Scheme
Top Cited Papers
- 20 November 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2001, 157-174
- https://doi.org/10.1007/3-540-45682-1_10
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A method for finding codewords of small weightPublished by Springer Nature ,2005
- Weak keys in the McEliece public-key cryptosystemIEEE Transactions on Information Theory, 2001
- Finding the permutation between equivalent linear codes: the support splitting algorithmIEEE Transactions on Information Theory, 2000
- 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
- The intractability of computing the minimum distance of a codeIEEE Transactions on Information Theory, 1997
- Is code equivalence easy to decide?IEEE Transactions on Information Theory, 1997
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric AlgorithmsLecture Notes in Computer Science, 1996
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystemsIEEE Transactions on Information Theory, 1994
- 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