基于生成元的彩虹表

Rainbow Table based on Generator-A New Way of Rainbow Table Generation

彩虹表是破解hash口令的常用工具之一,它可以有效地提高破解速度,但传统的遍历完整明文空间的彩虹表在面对超过10位的长口令时,其生成时间是无法忍受的,用传统方式破解10位以上长口令,破解成功率较低。结合人为设置口令的相关特点,从压缩明文空间的角度出发,文中提出一种全新的基于生成元的彩虹表生成方式。基于生成元的彩虹表,其明文空间中剔除了大量出现概率极低的口令,使得长口令彩虹表的生成时间缩短在可接受的范围内,为破解人为设置的长口令提供了一种切实可行的方案。

Rainbow tables are usually used to crack hash passwords, and it could effectively improve the crack speed. However, the time cost for generating a long-password （more than 10 characters） rainbow table could not be tolerated, and the cracking also has a low success rate. A new idea of rainbow table based on generator is proposed, and this rainbow table could greatly compress the plaintext space. It is based on some universal law of the process of artificial long passwords, and in this way a lot of low-probability passwords are removed from the plaintext space. It makes the generation of rainbow table for long passwords acceptable and provides an operable method to crack artificial long passwords.