Memory-demanding password scrambling

DOI10.1007/978-3-662-45608-8_16MaRDI QIDQ2936614zbMATHOpenAlexFDO

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

zbMATH Keywords

password hashingmemory-hardcache-timing attack

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

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)

• Delayed password disclosure
• Rig: a simple, secure and flexible design for password hashing
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Optimizing a password hashing function with hardware-accelerated symmetric encryption
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Cost-asymmetric memory hard password hashing
• Cost-asymmetric memory hard password hashing
• DAHash: distribution aware tuning of password hashing costs
• Rifflescrambler -- a memory-hard password storing function

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)