A Blocked Rainbow Table Time-Memory Trade-off Method

摘要：

　　The rainbow table algorithm has been widely applied to password recovery.However, it faces the issue of too much time or space consumption.Thus in this paper, a blocked rainbow table time-memory trade-off (BRT3) is proposed along with practical implementations.in the new method, the position of each starting point is stored instead of the starting point to reduce the storage consumption.Multiple rainbow blocks are used to reduce the merge probability of chains and improve the success rate of password cracking.A blocked memory structure is adopted to reduce the cryptanalysis time.We also analyze the existing time-memory trade-off methods and carry out comparison experiments to evaluate the performance.The experimental results show that the cryptanalysis time of the BRT3 method is no more than 2 minutes when cracking 200 MSWindows LM password hashes on a general desktop machine with2GB memory.Whats more, the BRT3 method can also achieve up to a 50% reduction in the storage requirement and acquire an 11% increase in the success rate.

关键词： Time-memory Trade-off Cryptanalysis Rainbow Table Blocked Structure Information Security

作者: Hongwei Lu Xiaoheng Zhu Zaobin Gan

作者单位: School of Computer Science and Technology Huazhong University of Science and Technology

会议类型: 国际会议

会议名称: The 12th Web Information System and Application Conference第十二届全国Web信息系统及其应用学术会议(WISA2015)、全国第十次语义Web 与本体论学术研讨会(SWON2015)、全国第九次电子政务技术及应用学术研讨会(EGTA2015)

会议地点: 济南

会议语种:英文

页码: 324-329

在线出版日期: 2015-09-11（万方平台首次上网日期，不代表论文的发表时间）