Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing
A Cryptanalytic Time-Memory Tradeoff: First FPGA Implementation
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Moderately hard, memory-bound functions
ACM Transactions on Internet Technology (TOIT)
Fast dictionary attacks on passwords using time-space tradeoff
Proceedings of the 12th ACM conference on Computer and communications security
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables
ACM Transactions on Information and System Security (TISSEC)
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
Improvement and analysis of VDP method in time/memory tradeoff applications
ICICS'11 Proceedings of the 13th international conference on Information and communications 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
Application of LFSRs in time/memory trade-off cryptanalysis
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Analysis of the parallel distinguished point tradeoff
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Development and performance analysis of HPC based framework for cryptanalytic attacks
Proceedings of the CUBE International Information Technology Conference
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
| Hi-index | 0.00 |
In 1980, Martin Hellman [1] introduced the concept of cryptanalytic time-memory tradeoffs, which allows the cryptanalysis of any N key symmetric cryptosystem in O(N2/3) operations with O(N2/3) storage, provided a precomputation of O(N) is performed beforehand. This procedure is well known but did not lead to realistic implementations. This paper considers a cryptanalytic time-memory tradeoff using distinguished points, a method referenced to Rivest [2]. The algorithm proposed decreases the expected number of memory accesses with sensible modifications of the other parameters and allows much more realistic implementations of fast key search machines.We present a detailed analysis of the algorithm and solve theoretical open problems of previous models. We also propose efficient mask functions in terms of hardware cost and probability of success. These results were experimentally confirmed and we used a purpose-built FPGA design to perform realistic tradeoffs against DES. The resulting online attack is feasible on a single PC and we recover a 40-bit key in about 10 seconds.