Optimum Parameter Selection for Rainbow Table TMTO Attack Considering Breaking Time and Using Sequential and Index Search Methods

Authors

1 Doctoral student of telecommunications, Sharif University of Technology, Tehran, Iran

2 Instructor and faculty member, Payam Noor University, Tehran, Iran

Abstract

Required memory, online search time and success probability are the main performance metrics of a
Time Memory Trade-Off (TMTO) Attack. One of the basic challenges in TMTO attack is the way of
choosing TMTO attack parameters like number and length of chains to meet some certain performance
metrics. Considering online breaking time, we propose an optimized procedure for selecting rainbow table
TMTO attack parameters. Unlike previous works that mainly deal with minimizing required memory in the
rainbow table TMTO attack, we simultaneously focus on the required memory and the online breaking time
and consider index and sequential search techniques. Our parameter selection technique is optimized
regarding the minimization of the required memory subject to a certain success probability and a maximum
online breaking time. Obtained results are two compact mathematical expressions for determining the
rainbow table TMTO attack parameters, number and length of chains for the sequential and the index
search methods. The application of our optimized parameter selection procedure is also shown in few
sample design examples.

Keywords

References

   [1]     M. E. Hellman, “A Cryptanalytic Time-Memory Trade-off”, IEEE Transactions on Information Theory, pages 401–406, 1980. 
   [2]     P. Oechslin, “Making a Faster Cryptanalytic Time-Memory Trade-of”, volume 2729 of Lecture Notes in Computer Science, pages 617–630, Springer, 2003. 
   [3]     I. J. Kim and T. Matsumoto, “Achieving Higher Success Probability in Time-Memory Trade-off Cryptanalysis without Increasing Memory Size”, IEICE Transactions on Fundamentals, pages 123–129, 1999. 
   [4]     NurdanSaran, Ali Doganaksoy, “Choosing Parameters to Achieve A Higher Success Rate for Hellman Time Memory Trade Off Attack”, International Conference on Availability, Reliability and Security, Mar. 2009. 
   [5]     K. Kusuda and T. Matsumoto, “Optimization of Time-Memory Trade-off Cryptanalysis and Its Application to DES”, IEICE Transactions on Fundamentals, pages 35–48, 1996. 
   [6]     Vrizlynn L. L. Thing, Hwei-Ming Ying, “Rainbow Table Optimization for Password Recovery”, International Journal on Advances in Software, vol 4 no 3 & 4, 2011. 
   [7]     G. Avoine, P. Junod, and P. Oechslin, “Characterization and Improvement of Time-Memory Trade-off Based on Perfect Tables”, ACM Transactions on Information Systems, 2008. 
   [8]     G. Avoine, P. Junod, and P. Oechslin, “Time-Memory Trade-offs: False Alarm Detection using Checkpoints”, INDOCRYPT, volume 3797 of Lecture Notes in Computer Science, pages 183–196, Springer, 2005. 
   [9]     F. Broek and E. Poll, “A Comparison of Time-Memory Trade-Off Attacks on Stream Ciphers”, AFRICACRYPT 2013, pp. 406–423, 2013. 
 [10]     J. Hong, S. Moon, “A comparison of cryptanalytic tradeoff algorithms”, Cryptology ePrint Archive. Report 2010/176. 
 [11]     Murray R. Spiegel, Seymour Lipschutz, John Liu, “Mathematical Handbook of Formulas and Tables”, McGraw-Hill, 1968. 
 [12]     L. G. Dickson, “Elementary Theory of Equations”, John Wiley and Sons Incorporation, 1914. 
 [13]     William Stallings, “Cryptography and Network Security Principles and Practices”, 4th Ed., Prentice Hall, Nov. 16, 2005. 
 [14]     D. R. Stinson, “Cryptography Theory and Practice”, 3rd Ed., Chapman & Hall/CRC, 2006. 
Electronic and Cyber Defense
Volume 3, Issue 3 - Serial Number 3
February 2020
Pages 49-57

Files

History

  • Receive Date: 02 February 2015
  • Revise Date: 21 June 2023
  • Accept Date: 19 September 2018
  • Publish Date: 22 November 2015

Share

How to cite

Statistics