The DOI matches its Crossref record.
Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications
Open accessAbstract
We present a new hash function Argon2, which is oriented at protection of low-entropy secrets without secret keys. It requires a certain (but tunable) amount of memory, imposes prohibitive time-memory and computation-memory tradeoffs on memory-saving users, and is exceptionally fast on regular PC. Overall, it can provide ASIC-and botnet-resistance by filling the memory in 0.6 cycles per byte in the non-compressible way.
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
Cited by
Blockchain based hybrid network architecture for the smart city
Sharma, P. K., & Park, J. H. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.04.060 · Cited by 374
A Nudge-Inspired AI-Driven Health Platform for Self-Management of Diabetes
Joachim, S., Forkan, A. R. M., Jayaraman, P. P., Morshed, A., & Wickramasinghe, N. (2022) · Sensors · doi:10.3390/s22124620 · Cited by 49
Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme
Dinur, I., & Nadler, N. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63715-0_13 · Cited by 9
Flexible and Survivable Single Sign-On
Magnanini, F., Ferretti, L., & Colajanni, M. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-94029-4_13 · Cited by 6
Metadata
- Authors
- Biryukov, A., Dinu, D., & Khovratovich, D.
- Venue
- 2016 IEEE European Symposium on Security and Privacy (EuroS&P)
- Publisher
- IEEE
- Published
- 2016-03
- Pages
- 292-302
- OpenAlex
- W2354711464
- Cited by
- 199
- References
- 0
- FWCI
- 9.80
- Type
- conference paper
- Language
- en
- Open access
- green
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: Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications. https://app.cochat.ai/papers/10.1109/eurosp.2016.31
- The paper
- Biryukov, A., Dinu, D., & Khovratovich, D. (2016). Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications. 2016 IEEE European Symposium on Security and Privacy (EuroS&P). https://doi.org/10.1109/eurosp.2016.31
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.