The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
How to Achieve a McEliece-Based Digital Signature Scheme
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
nauk, R. A. (1965) · Наука eBooks · Cited by 1,013
Patarin, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_4 · Cited by 662
Knapsack-type cryptosystems and algebraic coding theory
Niederreiter, H. (1986) · Medical Entomology and Zoology · Cited by 587
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
Canteaut, A., & Chabaud, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651067 · Cited by 350
An Observation on the Security of McEliece’s Public-Key Cryptosystem
Lee, P. J., & Brickell, E. F. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-45961-8_25 · Cited by 290
Finding the permutation between equivalent linear codes: the support splitting algorithm
Sendrier, N. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850662 · Cited by 269
Self-citationQUARTZ, 128-Bit Long Digital Signatures: http://www.minrank.org/quartz/
Patarin, J., Courtois, N., & Goubin, L. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_21 · Cited by 167
Self-citationSemantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC -
Kobara, K., & Imai, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_2 · Cited by 162
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
Li, Y. X., Deng, R. H., & Wang, X. M. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.272496 · Cited by 162
Is code equivalence easy to decide?
Petrank, E., & Roth, R. M. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623157 · Cited by 142
Weak keys in the McEliece public-key cryptosystem
Loidreau, P., & Sendrier, N. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915687 · Cited by 69
Self-citationSome weak keys in McEliece public-key cryptosystem
Loidrean, P., & Sendrier, N. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1998.708987 · Cited by 28
Self-citation
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
Zhang, F., Safavi-Naini, R., & Susilo, W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24632-9_20 · Cited by 513
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
Misoczki, R., Tillich, J.-P., Sendrier, N., & Barreto, P. S. L. M. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620590 · Cited by 420
Self-citation
Metadata
- Authors
- Courtois, N. T., Finiasz, M., & Sendrier, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 157-174
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1595415026
- Cited by
- 435
- References
- 17
- FWCI
- 4.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.