A Case Against Currently Used Hash Functions in RFID Protocols
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
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.
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?
For low-power secure communications, it is more efficient to make use of Advanced Encryption Standard (AES) than SHA-256 in ASICs.
“However, researchers that evaluated the footprint and energy requirements of SHA-256 in ASICs, concluded that, for low-power secure communications, it is more efficient to make use of Advanced Encryption Standard (AES) [123].”
From A Review on the Use of Blockchain for the Internet of Things (2018) · cites this paper as [123]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cited by
Sorted by citations
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078 · see citing works
KLEIN: A New Family of Lightweight Block Ciphers
Gong, Z., Nikova, S., & Law, Y. W. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25286-0_1 · Cited by 405 · see citing works
Advanced smart card based password authentication protocol
Song, R. (2010) · Computer Standards & Interfaces · doi:10.1016/j.csi.2010.03.008 · Cited by 274 · see citing works
The Unreasonable Fundamental Incertitudes Behind Bitcoin Mining
Courtois, N. T., Grajek, M., & Naik, R. (2013) · arXiv · doi:10.48550/arxiv.1310.7935 · Cited by 29 · see citing works
“The goal of this paper is NOT to describe the best possible ASIC implementation of SHA256 and what is the best compromise between the circuit area/propagation time, see [21, 27, 28, 34, 37, 40–43, 48, 55, 56].”
Method
- Authors
- Feldhofer, M., & Rechberger, C.
- Affiliations
- Graz University of Technology (AT)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 372-381
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1845145297
- Cited by
- 205
- References
- 0
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 5 · 2021: 4 · 2020: 4 · 2019: 8 · 2018: 4 · 2017: 9 · 2016: 7 · 2015: 8 · 2014: 13 · 2013: 12 · 2012: 19
- FWCI
- 14.62
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Engineering › Media Technology › RFID technology advancements
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- RFID security protocols, hash functions, SHA-256, SHA-1, MD5, MD4, Advanced Encryption Standard, block cipher, low-power hardware design, RFID tags, energy efficiency, ASIC implementation, chip area, cryptographic algorithm selection
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
