The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
US Secure Hash Algorithm 1 (SHA1)
Open accessAbstract
The purpose of this document is to make the SHA-1 (Secure Hash Algorithm 1) hash algorithm conveniently available to the Internet community.The United States of America has adopted the SHA-1 hash algorithm described herein as a Federal Information Processing Standard.Most of the text herein was taken by the authors from FIPS 180-1.Only the C code implementation is "original". AcknowledgementsMost of the text herein was taken from [FIPS 180-1].Only the C code implementation is "original" but its style is similar to the previously published MD4 and MD5 RFCs [RFCs 1320, 1321].The SHA-1 is based on principles similar to those used by Professor Ronald L. Rivest of MIT when designing the MD4 message digest algorithm [MD4] and is modeled after that algorithm [RFC 1320].
Overview
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
Rivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
Randomness Requirements for Security
Eastlake, D., Schiller, J., & Crocker, S. (2005) · doi:10.17487/rfc4086 · Cited by 239
Self-citation
Cited by
VSEARCH: a versatile open source tool for metagenomics
(2016) · doi:10.7717/peerj.2584 · Cited by 10,773
IoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
Wander, A. S., Gura, N., Eberle, H., Gupta, V., & Shantz, S. C. (2005) · Third IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2005.18 · Cited by 793
An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks
Zhang, C., Lu, R., Lin, X., Ho, P.-H., & Shen, X. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.58 · Cited by 667
Metadata
- Authors
- Eastlake, D., & Jones, P.
- Publisher
- RFC Editor
- Published
- 2001-09
- OpenAlex
- W1639305476
- Cited by
- 908
- References
- 2
- Type
- report
- Language
- en
- Open access
- gold
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.