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
Real Time Cryptanalysis of A5/1 on a PC
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
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
Reducing time complexity in RFID systems
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables
ACM Transactions on Information and System Security (TISSEC)
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
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
An analysis of chain characteristics in the cryptanalytic TMTO method
Theoretical Computer Science
| Hi-index | 0.00 |
Since the original publication of Martin Hellman’s cryptanalytic time-memory trade-off, a few improvements on the method have been suggested. In all these variants, the cryptanalysis time decreases with the square of the available memory. However, a large amount of work is wasted during the cryptanalysis process due to so-called “false alarms”. In this paper we present a method of detection of false alarms which significantly reduces the cryptanalysis time while using a minute amount of memory. Our method, based on “checkpoints”, reduces the time by much more than the square of the additional memory used, e.g., an increase of 0.89% of memory yields a 10.99% increase in performance. Beyond this practical improvement, checkpoints constitute a novel approach which has not yet been exploited and may lead to other interesting results. In this paper, we also present theoretical analysis of time-memory trade-offs, and give a complete characterization of the variant based on rainbow tables.