Cost-asymmetric memory hard password hashing
From MaRDI portal
Publication:6134807
DOI10.1007/978-3-031-14791-3_2zbMath1518.94105arXiv2206.12970OpenAlexW4283695486MaRDI QIDQ6134807
Jeremiah Blocki, Wen-Jie Bai, Mohammad Hassan Ameri
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12970
Related Items (1)
Cites Work
- Unnamed Item
- DAHash: distribution aware tuning of password hashing costs
- Efficiently Computing Data-Independent Memory-Hard Functions
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Scrypt Is Maximally Memory-Hard
- Cost-asymmetric memory hard password hashing
This page was built for publication: Cost-asymmetric memory hard password hashing