The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
LFSR-based Hashing and Authentication
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
Encyclopedia of Mathematics and its Applications.
L., Y. L., Jones, W. B., & Thron, W. J. (1982) · Mathematics of Computation · doi:10.2307/2007638 · Cited by 4,119
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
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
Lidl, R. (1983) · Cited by 1,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
Authentication Theory/Coding Theory
Simmons, G. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_32 · Cited by 371
Universal hashing and authentication codes
Stinson, D. R. (1994) · Designs, Codes and Cryptography · doi:10.1007/bf01388651 · Cited by 292
A survey of information authentication
Simmons, G. J. (1988) · Proceedings of the IEEE · doi:10.1109/5.4445 · Cited by 241
Universal hashing and authentication codes
Stinson, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_5 · Cited by 158
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
On the Relation Between A-Codes and Codes Correcting Independent Errors
Johansson, T., Kabatianskii, G. A., & Smeets, B. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_1 · Cited by 81
An Integrity Check Value Algorithm for Stream Ciphers
Taylor, R. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_4 · Cited by 61
A fast cryptographic checksum algorithm based on stream ciphers
Lai, X., Rueppel, R. A., & Woollven, J. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1_73 · Cited by 28
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
Desmedt, Y. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_6 · Cited by 22
Very simple method to find the minimum polynomial of an arbitrary nonzero element of a finite field
Gordon, J. (1976) · Electronics Letters · doi:10.1049/el:19760508 · Cited by 21
Cited by
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30556-9_27 · Cited by 522
Authenticated-encryption with associated-data
Rogaway, P. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586125 · Cited by 467
Metadata
- Authors
- Krawczyk, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-09
- Pages
- 129-139
- OpenAlex
- W1511186238
- Cited by
- 491
- References
- 15
- FWCI
- 18.43
- 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.