Name
Title | ||
|---|---|---|
Analysis of Multiple Checkpoints in Non-perfect and Perfect Rainbow Tradeoff Revisited |
Abstract | ||
|---|---|---|
Time memory tradeoff (TMTO) attack has proven to be an effective cryptanalysis method against block ciphers and stream ciphers. Since it was first proposed in 1980s, many new ideas have come out to reduce the false alarms during the online phase, among which rainbow table introduced by Oechslin and perfect table introduced by Borst et al. are notable landmarks. Avoine et al. introduced the checkpoints technique to detect false alarms using little additional memory without regenerating the pre-computed chain. In this paper, we revisit the analysis of multiple checkpoints in rainbow tradeoff. For non-perfect table we give a new sight to the computation of the expected decreasing number of chain regenerations at the k-th iteration. This helps to better understand the real nature of false alarms and leads us to the same results as the work of Jung Woo Kim et al. at Indocrypt 2012. For perfect rainbow tradeoff we give the first way to find optimal positions of multiple checkpoints. The results are better than previous work of Avoine et al., which only applies when the perfect table has the maximum number of chains. All the results are verified through meticulous experiments. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-02726-5_21 | ICICS |
Keywords | Field | DocType |
multiple checkpoints,rainbow tradeoff,time memory tradeoff | Rainbow table,Block cipher,Computer science,Algorithm,Cryptanalysis,Theoretical computer science,Stream cipher,Rainbow,Computation | Conference |
Volume | Issue | ISSN |
8233 LNCS | null | 16113349 |
Citations | PageRank | References |
1 | 0.36 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhao Wang | 1 | 60 | 10.80 |
| Dongdai Lin | 2 | 762 | 98.54 |