Coherent functions and program checkers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing
How to decrypt or even substitute DES-Encrypted messages in 228 steps
Information Processing Letters
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Time-Memory trade-offs: false alarm detection using checkpoints
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Improved time-memory trade-offs with multiple data
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Halting password puzzles: hard-to-break encryption from human-memorable keys
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables
ACM Transactions on Information and System Security (TISSEC)
Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers
Information Processing Letters
Applying Time-Memory-Data Trade-Off to Meet-in-the-Middle Attack
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Success probability of the Hellman trade-off
Information Processing Letters
Improving the Rainbow Attack by Reusing Colours
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Variants of the distinguished point method for cryptanalytic time memory trade-offs
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
The cost of false alarms in Hellman and rainbow tradeoffs
Designs, Codes and Cryptography
Time space tradeoffs for attacks against one-way functions and PRGs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Analysis of the parallel distinguished point tradeoff
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
An analysis of chain characteristics in the cryptanalytic TMTO method
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f:{0,1,..., N–1} ↦{0,1,..., N–1}. The model contains all the known tradeoff techniques as special cases. It is based on a new notion of stateful random graphs. The evolution of a path in the stateful random graph depends on a hidden state such as the color in the Rainbow scheme or the table number in the classical Hellman scheme. We prove an upper bound on the number of images y=f(x) for which f can be inverted, and derive from it a lower bound on the number of hidden states. These bounds hold for an overwhelming majority of the functions f, and their proofs are based on a rigorous combinatorial analysis. With some additional natural assumptions on the behavior of the online phase of the scheme, we prove a lower bound on its worst-case time complexity $T=\Omega(\frac{N^2}{M^2 \ln N})$, where M is the memory complexity. Finally, we describe new rainbow-based time/memory/data tradeoffs, and a new method for improving the time complexity of the online phase (by a small factor) by performing a deeper analysis during preprocessing.