How to Handle Rainbow Tables with External Memory

@inproceedings{Avoine2017HowTH,
  title={How to Handle Rainbow Tables with External Memory},
  author={Gildas Avoine and Xavier Carpent and Barbara Kordy and Florent Tardif},
  booktitle={ACISP},
  year={2017}
}
A cryptanalytic time-memory trade-off is a technique that aims to reduce the time needed to perform an exhaustive search. Such a technique requires large-scale precomputation that is performed once for all and whose result is stored in a fast-access internal memory. When the considered cryptographic problem is overwhelmingly-sized, using an external memory is eventually needed, though. In this paper, we consider the rainbow tables – the most widely spread version of time-memory trade-offs. The… 
View via Publisher
people.irisa.fr
2 Citations
Background Citations
1

2 Citations

Distributed Time-Memory Tradeoff Attacks on Ciphers (with Application to Stream Ciphers and Counter Mode)
  • H. Heys
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2018
TLDR
It is shown that Hellman’s original tradeoff method and the Biryukov-Shamir attack on stream ciphers, which incorporates data into the tradeoff, can be effectively distributed to reduce both time and memory, while other approaches are less advantaged in a distributed approach.
Precomputation for Rainbow Tables has Never Been so Fast

References

SHOWING 1-10 OF 28 REFERENCES
Optimal Storage for Rainbow Tables
TLDR
This paper analytically describes how rainbow tables are currently stored, and a new structure is introduced that considerably reduces the memory requirement, and mathematically analyze these techniques, provide optimal parameterization, and show that the structure is extremely close to the theoretical lower bound.
Heterogeneous Rainbow Table Widths Provide Faster Cryptanalyses
TLDR
It is demonstrated in this paper that rainbow tables are underexploited due to this assumption never being challenged, and an algorithm to calculate the optimal configuration and a decision function to visit the tables is provided.
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables
TLDR
This work introduces a new technique based on checkpoints that still reduces the cryptanalysis time by ruling out false alarms probabilistically and establishes its efficiency when applied on rainbow tables.
Analysis of the Rainbow Tradeoff Algorithm Used in Practice
TLDR
This work provides a full analysis of the rainbow tradeoff algorithm that is used in practice, and is able to provide tradeoff parameters that optimize the wall-clock time.
Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints
TLDR
This paper presents a method of detection of false alarms which significantly reduces the cryptanalysis time while using a minute amount of memory, and presents theoretical analysis of time-memory trade-offs, and gives a complete characterization of the variant based on rainbow tables.
Making a Faster Cryptanalytic Time-Memory Trade-Off
TLDR
A new way of precalculating the data is proposed which reduces by two the number of calculations needed during cryptanalysis and it is shown that the gain could be even much higher depending on the parameters used.
New Applications of Time Memory Data Tradeoffs
TLDR
This paper focuses on identifying candidate oneway functions hidden in cryptographic algorithms, inverting which will result in breaking the algorithm, and provides some new applications of TMTO and a set of general guidelines for applying TMTO attacks.
Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs (Full version)
TLDR
A new variant of the DP technique, named variable DP (VDP), having properties very different from DP, has an effect on the amount of memory required to store the pre-computed tables.
A Cryptanalytic Time-Memory Tradeoff: First FPGA Implementation
TLDR
The experimental results for the cryptanalysis of DES that are presented are based on a time-memory tradeoff using distinguished points, a method which is referenced to Rivest [2].
Interleaving Cryptanalytic Time-Memory Trade-Offs on Non-uniform Distributions
TLDR
This paper introduces an efficient construction that consists in partitioning the search set into subsets of close densities, and a strategy to explore the TMTOs associated to the subsets based on an interleaved traversal that results in a significant improvement compared to currently usedTMTOs.
...
...