Rifflescrambler -- a memory-hard password storing function

DOI10.1007/978-3-319-98989-1_16zbMath1496.68062arXiv1807.06443OpenAlexW3102588087MaRDI QIDQ2167756

Filip Zagórski, Paweł Lorek, Karol Gotfryd

Publication date: 25 August 2022

Full work available at URL: https://arxiv.org/abs/1807.06443

zbMATH Keywords

Markov chainsmixing timememory hardnesspassword storing

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cites Work

• Strong uniform times and finite random walks
• Efficiently Computing Data-Independent Memory-Hard Functions
• Memory-Demanding Password Scrambling
• High Parallel Complexity Graphs and Memory-Hard Functions
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• Lyra2: Efficient Password Hashing with High Security against Time-Memory Trade-Offs
• Shuffling Cards and Stopping Times
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Depth-Robust Graphs and Their Cumulative Memory Complexity

This page was built for publication: Rifflescrambler -- a memory-hard password storing function