Loading...
Rainbow table TMTO attack optimization considering online sequential search time
Hadi, M ; Sharif University of Technology | 2015
770
Viewed
- Type of Document: Article
- DOI: 10.1109/ICTCK.2014.7033516
- Publisher: Institute of Electrical and Electronics Engineers Inc , 2015
- Abstract:
- In this paper, we propose an optimized parameter selection procedure for rainbow table Time Memory Trade-Off (TMTO) attack with sequential online search. Unlike previous works that mainly deal with minimizing required memory in the rainbow table TMTO attack we simultaneously focus on the required memory and online search time. Our parameter selection technique is optimized regarding the minimization of the required memory subject to a certain success probability and a maximum online search time. Obtained results are two compact mathematical expressions for determining rainbow table TMTO attack parameters, number and length of chains. The application of our optimized parameter selection procedure is also shown in a sample example
- Keywords:
- Online Search ; Time-Memory Trade-Off (TMTO) Attack ; Economic and social effects ; Online searching ; Social networking (online) ; Cardano Cubic Formulas ; Mathematical expressions ; Optimized parameter ; Parameter selection ; Rainbow tables ; Sequential search ; Time-memory trade-offs ; TMTO Attacks ; Constrained optimization
- Source: 2014 International Congress on Technology, Communication and Knowledge, ICTCK 2014, 26 November 2014 through 27 November 2014 ; 2015 ; 9781479980215 (ISBN)
- URL: http://ieeexplore.ieee.org/document/7033516