The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Quark: A Lightweight Hash
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867
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
Grain: A stream cipher for constrained environments
Hell, M., Johansson, T., & Meier, W. (2007) · International Journal of Wireless and Mobile Computing · doi:10.1504/ijwmc.2007.013798 · Cited by 568
Self-citationThe PHOTON Family of Lightweight Hash Functions
Guo, J., Peyrin, T., & Poschmann, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_13 · Cited by 558
Cube Attacks on Tweakable Black Box Polynomials
Dinur, I., & Shamir, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_16 · Cited by 451
The Salsa20 Family of Stream Ciphers
Bernstein, D. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_8 · Cited by 429
On 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
Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28496-0_19 · Cited by 356
spongent: A Lightweight Hash Function
Bogdanov, A., Knežević, M., Leander, G., Toz, D., Varıcı, K., & Verbauwhede, I. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_21 · Cited by 354
Cited by
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
Report on lightweight cryptography
McKay, K. A., Bassham, L., Turan, M. S., & Mouha, N. (2017) · doi:10.6028/nist.ir.8114 · Cited by 353
Lightweight Cryptography: A Solution to Secure IoT
Dhanda, S. S., Singh, B., & Jindal, P. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07134-3 · Cited by 294
Lightweight cryptography methods
Buchanan, W. J., Li, S., & Asif, R. (2017) · Journal of Cyber Security Technology · doi:10.1080/23742917.2017.1384917 · Cited by 186
Metadata
- Authors
- Aumasson, J.-P., Henzen, L., Meier, W., & Naya-Plasencia, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 1-15
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1601321736
- Cited by
- 277
- References
- 39
- FWCI
- 17.67
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quark: A Lightweight Hash. https://app.cochat.ai/papers/10.1007/978-3-642-15031-9_1
- The paper
- Aumasson, J.-P., Henzen, L., Meier, W., & Naya-Plasencia, M. (2010). Quark: A Lightweight Hash. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-15031-9_1
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.
