Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,386,823 papers from all fields of science
Search
Sign In
Create Free Account
Argon2
Argon2 is a key derivation function that was selected as the winner of the Password Hashing Competition in July 2015. It was designed by Alex…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
BLAKE (hash function)
DACS — The Distributed Access Control System
Key derivation function
Key stretching
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Chapter 5 Cryptanalytic Time-Memory Tradeoff for Password Hashing Schemes
2018
Corpus ID: 55573070
In previous chapters, we discussed the designing aspects of password hashing schemes (PHS). This chapter is dedicated to the…
Expand
2017
2017
Investigation of Practical Attacks on the Argon 2 i Memory-hard Hash Function 6
Mitchell Gu
,
Ryan Berg
,
Casie Chen
2017
Corpus ID: 30658901
4 Background 4 4.1 The Argon2 Hash . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.1.1 The Compression Function H…
Expand
2016
2016
Balloon Hashing : a Provably Memory-Hard Function with a Data-Independent Access Pattern
D. Boneh
,
Henry Corrigan-Gibbs
,
Stuart E. Schechter
2016
Corpus ID: 16551666
We present the Balloon algorithm for password hashing. This is the first cryptographic hash function that: (i) has proven…
Expand
Review
2015
Review
2015
Password Hashing Algorithms - From Past to Future
Tran Song Dat Phuc
,
Changhoon Lee
2015
Corpus ID: 64158071
Password is a simple technique users do use to protect and authenticate their private information. It is employed popularly as an…
Expand
2000
2000
Message from the Chair
Wu-chi Feng
ICPP Workshops
2000
Corpus ID: 36540572
This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE