Memory-demanding password scrambling
From MaRDI portal
Publication:2936614
DOI10.1007/978-3-662-45608-8_16zbMATH Open1317.94104OpenAlexW5925040MaRDI QIDQ2936614FDOQ2936614
Authors: Christian Forler, Stefan Lucks, Jakob Wenzel
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_16
Recommendations
- Rifflescrambler -- a memory-hard password storing function
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Static-memory-hard functions, and modeling the cost of space vs. time
- Scrypt is maximally memory-hard
Cited In (9)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Optimizing a password hashing function with hardware-accelerated symmetric encryption
- Cost-asymmetric memory hard password hashing
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- DAHash: distribution aware tuning of password hashing costs
- Delayed password disclosure
- Cost-asymmetric memory hard password hashing
- Rifflescrambler -- a memory-hard password storing function
- Rig: a simple, secure and flexible design for password hashing
This page was built for publication: Memory-demanding password scrambling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936614)