The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
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
(1979) · Cited by 43,841
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Finite fields: Encyclopedia of mathematics and its applications
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)84597-x · Cited by 680
Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
Matsumoto, T., & Imai, H. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-45961-8_39 · Cited by 504
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88
Patarin, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_20 · Cited by 394
Self-citationBlake, I. F., Gao, X., Mullin, R. C., Vanstone, S. A., & Yaghoobian, T. (1993) · Springer eBooks · doi:10.1007/978-1-4757-2226-0 · Cited by 379
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
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_54 · Cited by 110
A note on the complexity of cryptography (Corresp.)
Brassard, G. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056010 · Cited by 68
Computing Frobenius maps and factoring polynomials
Gathen, J. V. Z., & Shoup, V. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129722 · Cited by 31
A geometric approach to root finding in GT(q/sup m/)
van Oorschot, P. C., & Vanstone, S. A. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32139 · Cited by 28
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_27 · Cited by 753
Self-citationCryptanalysis of Block Ciphers with Overdefined Systems of Equations
Courtois, N. T., & Pieprzyk, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_17 · Cited by 688
Metadata
- Authors
- Patarin, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 33-48
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1821087317
- Cited by
- 662
- References
- 11
- FWCI
- 4.12
- 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.