The DOI matches its Crossref record; 14 of the 15 references it cites were found in a registry or an index.
New hash functions and their use in authentication and set equality
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This kind of extractor is also a strong extractor. 101”
From Quantum random number generation (2016) · cites this paper as [101]
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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,539
Self-citationExtendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N. J., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 669
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 373
On Digital Signatures and Public-Key Cryptosystems.
Rivest, R. L., Adi Shamir, Z., & Adleman, L. (1977) · Defense Technical Information Center (DTIC) · Cited by 179
Exact and approximate membership testers
Carter, L., Floyd, R. W., Gill, J. T., III, Markowsky, G., & Wegman, M. N. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804332 · Cited by 138
Self-citationOn taking roots in finite fields
Adleman, L. M., Manders, K. L., & Miller, G. L. (1977) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1977.18 · Cited by 119
Proceedings of the tenth annual ACM symposium on Theory of computing
Lipton, R. J., Burkhard, W. A., Savitch, W. J., Friedman, E. P., & Aho, A. (1978) · Cited by 71
Proceedings of the eleventh annual ACM symposium on Theory of computing
Fischer, M. J., DeMillo, R. A., Lynch, N. A., Burkhard, W. A., & Aho, A. V. (1979) · Cited by 44
Gilles Brassard, A. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.36 · Cited by 37
Cited by
Sorted by citations
Items 101–101 of 101
Lenstra, A. K., Kleinjung, T., & Thomé, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42001-6_9 · Cited by 13
Metadata
- Authors
- Wegman, M. N., & Carter, J. L.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1981-06
- Volume
- 22
- Issue
- 3
- Pages
- 265-279
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1985623009
- Cited by
- 1,402
- References
- 15
- Citations by year
- 2026: 44 · 2025: 45 · 2024: 52 · 2023: 34 · 2022: 48 · 2021: 43 · 2020: 57 · 2019: 39 · 2018: 42 · 2017: 59 · 2016: 57 · 2015: 51 · 2014: 55 · 2013: 60 · 2012: 59
- FWCI
- 2.80
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Computer and System Sciences (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- hash functions, authentication, message authentication, probabilistic data structures
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
