Advertisement

Improvement and Analysis of VDP Method in Time/Memory Tradeoff Applications

  • Wenhao Wang
  • Dongdai Lin
  • Zhenqi Li
  • Tianze Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7043)

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.

Keywords

False Alarm Distinguished Point Success Probability Block Cipher Time Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borst, J., Preneel, B., Vandewalle, J.: On the time-memory tradeoff between exhaustive key search and table precomputation. In: Symposium on Information Theory in the Benelux, pp. 111–118. Citeseer (1998)Google Scholar
  2. 2.
    Fiat, A., Naor, M.: Rigorous time/space tradeoffs for inverting functions. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 534–541. ACM (1991)Google Scholar
  3. 3.
    Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4), 401–406 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Hong, J., Jeong, K.C., Kwon, E.Y., Lee, I.-S., Ma, D.: Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol. 4991, pp. 131–145. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 5.
    Hong, J., Moon, S.: A comparison of cryptanalytic tradeoff algorithms. Technical report, Cryptology ePrint Archive, Report 2010/176 (2010)Google Scholar
  6. 6.
    Kim, I.J., Matsumoto, T.: Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 82(1), 123–129 (1999)Google Scholar
  7. 7.
    Mukhopadhyay, S., Sarkar, P.: Application of lFSRs in Time/Memory Trade-off Cryptanalysis. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol. 3786, pp. 25–37. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Oechslin, P.: Making a Faster Cryptanalytic Time-memory Trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617–630. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Standaert, F.X., Rouvroy, G., Quisquater, J.J., Legat, J.D.: A Time-memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 13–30. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Thing, V.L.L., Ying, H.M.: A novel time-memory trade-off method for password recovery. Digital Investigation 6, S114–S120 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Wenhao Wang
    • 1
    • 2
  • Dongdai Lin
    • 1
  • Zhenqi Li
    • 1
    • 2
  • Tianze Wang
    • 1
    • 2
  1. 1.SKLOIS, Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Graduate University of Chinese Academy of SciencesBeijingChina

Personalised recommendations