Title
Improvement and analysis of VDP method in time/memory tradeoff applications
Abstract
In many cases, cryptanalysis of a cryptographic system can be interpreted as the process of inverting a one-way function. TMTO is designed to be a generic approach that can be used on any one-way function independent of the structure of the specific target system. It was first introduced to attack block ciphers by Hellman in 1980. The distinguished point (DP) method is a technique that reduces the number of table look-ups performed by Hellman's algorithm. A variant of the DP (VDP) method is introduced to reduce the amount of memory required to store the pre-computed tables while maintaining the same success rate and online time. Both the DP method and VDP method can be applied to Hellman tradeoff or rainbow tradeoff. We carefully examine the technical details of the VDP method and find that it is possible to construct functions for which the original method fails. Based on the analysis, we propose a modification of the VDP method. Furthermore, we present an accurate version of the tradeoff curve that does not ignore the effect of false alarms and takes storage reduction techniques into consideration. We find optimal parameter sets of this new method by minimizing the tradeoff coefficient. A more exact and fair comparison between tradeoff algorithms is also given, which shows that our method applied to the Hellman tradeoff performs best among them.
Year
Venue
Keywords
2011
ICICS
tradeoff coefficient,tradeoff algorithm,one-way function,tradeoff curve,original method,memory tradeoff application,new method,hellman tradeoff,vdp method,rainbow tradeoff,dp method
Field
DocType
Volume
False alarm,Block cipher,Computer science,Cryptography,Algorithm,Cryptanalysis
Conference
7043
ISSN
Citations 
PageRank 
0302-9743
3
0.40
References 
Authors
9
4
Name
Order
Citations
PageRank
Wenhao Wang16010.80
Dongdai Lin276298.54
Zhenqi Li3164.16
Tianze Wang4152.55