Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
How easy is collision search? Application to DES
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing
Cryptography and data security
Cryptography and data security
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
New applications of time memory data tradeoffs
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Time-Memory trade-offs: false alarm detection using checkpoints
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Improved time-memory trade-offs with multiple data
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Success probability of the Hellman trade-off
Information Processing Letters
The cost of false alarms in Hellman and rainbow tradeoffs
Designs, Codes and Cryptography
The symbiosis between collision and preimage resistance
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Analysis of the parallel distinguished point tradeoff
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
A new variant of time memory trade-off on the improvement of thing and ying's attack
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Applying time-memory-data trade-off to plaintext recovery attack
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
| Hi-index | 0.00 |
Cryptanalytic time-memory trade-offs have been studied for 25 years and have benefited from several improvements since the original work of Hellman. The ensuing variants definitely improve the original trade-off but their real impact has never been evaluated in practice. We fill this lack by analyzing the perfect form of classic tables, distinguished point-based tables, and rainbow tables. We especially provide a thorough analysis of the latter variant, whose performances have never been formally calculated yet. Our analysis leads to the concept of a characteristic that enables to measure the intrinsic quality of a trade-off. We finally introduce a new technique based on checkpoints that still reduces the cryptanalysis time by ruling out false alarms probabilistically. Our analysis yields the exact gain of this approach and establishes its efficiency when applied on rainbow tables.