摘要： Thing提出的基于彩虹表的时空折中方法(Digital Investigation, 2009, No.6)不能对存储数据进行排序及去重，导致假警出现概率和表搜索代价过高。为此，设计一种基于块存储结构的彩虹表，给出相应的表搜索方法，在此基础上提出一种新的时空折中方法，通过在预计算阶段合并终结点相同的链，降低假警率、提高表搜索效率。分析结果表明，与同类方法相比，该方法在成功率、存储空间利用率及搜索代价方面更具优势。

关键词: 时空折中, 彩虹表, Thing方法, 块存储结构, 表搜索代价

Abstract: The time-memory trade-off method based on rainbow table method proposed by Thing can not order the stored data and remove the repeated data, therefore the disadvantages in the probability of false alarm and the cost of table searching are obvious. According to problems of Thing’s method, this paper presents a new rainbow table method based on block storage structure. By designing new table structure and table searching method, and combining the chains that have the same end point in precomputation, the possibility of false alarm is decreased and efficiency of table searching is improved. Analysis shows that the method has advantages in success rate, space utilization rate and the cost of table searching compared with the similar method.

Key words: time-memory trade-off, rainbow table, Thing’s method, block storage structure, cost of table searching

中图分类号: 

• TP391