The PHOTON Family of Lightweight Hash Functions
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
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
The Magma Algebra System I: The User Language
BOSMA, W., CANNON, J., & PLAYOUST, C. (1997) · Journal of Symbolic Computation · doi:10.1006/jsco.1996.0125 · Cited by 7,094
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Finding Collisions in the Full SHA-1
Wang, X., Yin, Y. L., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_2 · Cited by 1,418
A Design Principle for Hash Functions
Damgård, I. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_39 · Cited by 1,188
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_40 · Cited by 872
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
De Cannière, C., Dunkelman, O., & Knežević, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_20 · Cited by 678
BiTR: Built-in Tamper Resilience
Choi, S. G., Kiayias, A., & Malkin, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_40 · Cited by 590
Canright, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11545262_32 · Cited by 530
Related-Key Cryptanalysis of the Full AES-192 and AES-256
Biryukov, A., & Khovratovich, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_1 · Cited by 482
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
Moradi, A., Poschmann, A., Ling, S., Paar, C., & Wang, H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_6 · Cited by 463
Self-citationOn the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Efficient Collision Search Attacks on SHA-0
Wang, X., Yu, H., & Yin, Y. L. (2005) · Lecture notes in computer science · doi:10.1007/11535218_1 · Cited by 412
A Scalable and Provably Secure Hash-Based RFID Protocol
Avoine, G., & Oechslin, P. (2005) · Third IEEE International Conference on Pervasive Computing and Communications Workshops · doi:10.1109/percomw.2005.12 · Cited by 333
Distinguisher and Related-Key Attack on the Full AES-256
Biryukov, A., Khovratovich, D., & Nikolić, I. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_14 · Cited by 329
A Case Against Currently Used Hash Functions in RFID Protocols
Feldhofer, M., & Rechberger, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11915034_61 · Cited by 205
Hash Functions and RFID Tags: Mind the Gap
Bogdanov, A., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., & Seurin, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85053-3_18 · Cited by 197
Self-citationCube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
Aumasson, J.-P., Dinur, I., Meier, W., & Shamir, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03317-9_1 · Cited by 192
Ultra-Lightweight Implementations for Smart Devices – Security for 1000 Gate Equivalents
Rolfes, C., Poschmann, A., Leander, G., & Paar, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85893-5_7 · Cited by 179
Self-citationSome Plausible Constructions of Double-Block-Length Hash Functions
Hirose, S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11799313_14 · Cited by 175
Higher-Order Differential Properties of Keccak and Luffa
Boura, C., Canteaut, A., & Cannière, C. D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21702-9_15 · Cited by 134
Sponge-Based Pseudo-Random Number Generators
Bertoni, G., Daemen, J., Peeters, M., & Assche, G. V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15031-9_3 · Cited by 116
A Lightweight Implementation of Keccak Hash Function for Radio-Frequency Identification Applications
Kavun, E. B., & Yalçın, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16822-2_20 · Cited by 104
Mendel, F., Peyrin, T., Rechberger, C., & Schläffer, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-05445-7_2 · Cited by 101
Self-citationPark, S., Sung, S. H., Lee, S., & Lim, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39887-5_19 · Cited by 85
Improved Differential Attacks for ECHO and Grøstl
Peyrin, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_20 · Cited by 83
Self-citationEvaluating a New Mac for Current and Next Generation Rfid
Zhilyaev, S. (2010) · Scholarworks (University of Massachusetts Amherst) · doi:10.7275/1086841 · Cited by 7
Cited by
The Internet of Things vision: Key features, applications and open issues
Borgia, E. (2014) · Computer Communications · doi:10.1016/j.comcom.2014.09.008 · Cited by 1,471
IoT: Internet of Threats? A Survey of Practical Security Vulnerabilities in Real IoT Devices
Meneghello, F., Calore, M., Zucchetto, D., Polese, M., & Zanella, A. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2935189 · Cited by 799
Guo, J., Peyrin, T., Poschmann, A., & Robshaw, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_22 · Cited by 773
Self-citationA roadmap for security challenges in the Internet of Things
Riahi Sfar, A., Natalizio, E., Challal, Y., & Chtourou, Z. (2018) · Digital Communications and Networks · doi:10.1016/j.dcan.2017.04.003 · Cited by 480
Advanced lightweight encryption algorithms for IoT devices: survey, challenges and solutions
Singh, S., Sharma, P. K., Moon, S. Y., & Park, J. H. (2024) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-017-0494-4 · Cited by 444
Metadata
- Authors
- Guo, J., Peyrin, T., & Poschmann, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 222-239
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W35428663
- Cited by
- 558
- References
- 30
- FWCI
- 27.39
- 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.