Optimal storage for rainbow tables

DOI10.1007/978-3-319-12160-4_9MaRDI QIDQ3193259zbMATH OpenOpenAlexFDO

Authors Gildas Avoine, Xavier Carpent

Publication date 16 October 2015

Published in Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12160-4_9

zbMATH Keywords

compressionimplementationtime-memory trade-offs

Mathematics Subject Classification ID

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

Recommendations

• Analysis of rainbow tables with fingerprints
• A comparison of cryptanalytic tradeoff algorithms
• How to handle rainbow tables with external memory
• Advances in Cryptology - CRYPTO 2003
• Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints

Cited in

(4)

• How to handle rainbow tables with external memory
• Analysis of rainbow tables with fingerprints
• scientific article; zbMATH DE number 4115931 (Why is no real title available?)
• Time-memory trade-offs sound the death knell for GPRS and GSM

This page was built for publication: Optimal storage for rainbow tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3193259)