The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Ideals over a Non-Commutative Ring and their Application in Cryptology
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
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
Problems of Information Transmission
(2013) · Problems of Information Transmission · doi:10.1134/11122.1608-3253 · Cited by 931
Advances in Cryptology — CRYPTO ’87: Proceedings
(1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2 · Cited by 430
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
Security-Related Comments Regarding McEliece’s Public-Key Cryptosystem
Adams, C. M., & Meijer, H. (1988) · Lecture notes in computer science · doi:10.1007/3-540-48184-2_20 · Cited by 40
Perfect Local Randomness in Pseudo-random Sequences
Maurer, U. M., & Massey, J. L. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_11 · Cited by 25
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Efficient Encryption From Random Quasi-Cyclic Codes
Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zemor, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2804444 · Cited by 122
Metadata
- Authors
- Gabidulin, E. M., Paramonov, A. V., & Tretjakov, O. V.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-06
- Pages
- 482-489
- OpenAlex
- W2025108828
- Cited by
- 257
- References
- 7
- FWCI
- 6.72
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ideals over a Non-Commutative Ring and their Application in Cryptology. https://app.cochat.ai/papers/10.1007/3-540-46416-6_41
- The paper
- Gabidulin, E. M., Paramonov, A. V., & Tretjakov, O. V. (2007). Ideals over a Non-Commutative Ring and their Application in Cryptology. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-46416-6_41
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.