The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The Poly1305-AES Message-Authentication Code
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
Efficient randomized pattern-matching algorithms
Karp, R. M., & Rabin, M. O. (1987) · IBM Journal of Research and Development · doi:10.1147/rd.312.0249 · Cited by 1,269
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
Advances in Cryptology — EUROCRYPT ’99
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x · Cited by 902
IEEE Standard for Binary Floating Point Arithmetic
Ieee, A. (1985) · Medical Entomology and Zoology · Cited by 886
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 502
UMAC: Fast and Secure Message Authentication
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_14 · Cited by 390
Gilbert, E. N., MacWilliams, F. J., & Sloane, N. J. A. (1974) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1974.tb02751.x · Cited by 381
25th Annual Symposium on Foundations of Computer Science
(1985) · IEEE Software · doi:10.1109/ms.1985.231038 · Cited by 305
Halevi, S., & Rogaway, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_28 · Cited by 261
Bella, G., & Ryan, P. Y. A. (2009) · Journal of Computer Security · doi:10.3233/jcs-2009-0346 · Cited by 213
On Fast and Provably Secure Message Authentication Based on Universal Hashing
Shoup, V. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_24 · Cited by 211
On the Evaluation of Powers and Monomials
Pippenger, N. J. (1980) · SIAM Journal on Computing · doi:10.1137/0209022 · Cited by 151
On Families of Hash Functions via Geometric Codes and Concatenation
Bierbrauer, J., Johansson, T., Kabatianskii, G. A., & Smeets, B. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_28 · Cited by 138
New classes and applications of hash functions
Wegman, M. N., & Carter, J. L. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.26 · Cited by 134
On the evaluation of powers and related problems
Pippenger, N. J. (1976) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1976.21 · Cited by 94
Software Performance of Universal Hash Functions
Nevelsteen, W., & Preneel, B. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_3 · Cited by 72
An Integrity Check Value Algorithm for Stream Ciphers
Taylor, R. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_4 · Cited by 61
The minimum number of edges in graphs with prescribed paths
Pippenger, N. J. (1978) · Theory of Computing Systems · doi:10.1007/bf01776581 · Cited by 29
On the Evaluation of Powers and Related Problems (Preliminary Version)
Pippenger, N. J. (1976) · Cited by 27
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Self-citationCurve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Self-citationThe Software Performance of Authenticated-Encryption Modes
Krovetz, T., & Rogaway, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21702-9_18 · Cited by 262
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Hülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
Metadata
- Authors
- Bernstein, D. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 32-49
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1763079358
- Cited by
- 362
- References
- 24
- FWCI
- 6.68
- Type
- conference paper
- Language
- en
- Open access
- green
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.