Link back: http://www.bkjia.com/article/201202/120383.html.
Table creation command: rtgen hash_algorithm charset plaintext_len_min plaintext_len_max table_index chain_len chain_num part_index
Use a rainbow table similar to rtgen md5 numeric 5 5 5 0 100 200 0 to create 5-digit pure numbers with a sample space of 10 W.
Traverse all 5-digit combinations with a sample space
Rainbow table |
Number of forms |
Number of nodes |
Number of failed entries |
Success rate |
Time consumed (seconds) |
Md5_numeric # 5-5_0_100x200_0.rt |
1 |
2 W |
82773 |
17.227% |
1957 |
Md5_numeric # 5-5_0_1000x20_0.rt |
1 |
2 W |
82199 |
17.801% |
8219 |
Md5_numeric # 5-5_0_10x2000_0.rt |
1 |
2 W |
98211 |
1.789% |
4557 |
Md5_numeric # 5-5_0_100x200_0.rt -- md5_numeric # 5-5_0_100x200_9.rt |
10 |
20 W |
24756 |
75.224% |
2600 |
Md5_numeric # 5-5_0_100x200_0.rt -- md5_numeric # 5-5_9_100x200_0.rt |
10 |
20 W |
15363 |
84.637% |
2247 |
Md5_numeric # 5-5_0_100x2000_0.rt |
1 |
20 W |
24756 |
75.244% |
1942 |
Md5_numeric # 5-5_0_1000x200_0.rt |
1 |
20 W |
25178 |
74.822% |
9839 |
Md5_numeric # 5-5_0_100x4000_0.rt |
1 |
40 W |
10911 |
89.089% |
1956 |
Md5_numeric # 5-5_0_100x2000_0.rt -- md5_numeric # 5-5_0000100x2000_0.rt |
2 |
40 W |
6231 |
93.769% |
1977 |
Md5_numeric # 5-5_0_1000x200_0.rt -- md5_numeric # 5-5_00001000x200_0.rt |
2 |
40 W |
5970 |
94.030% |
12060 |
Md5_numeric # 5-5_0_100x6000_0.rt |
1 |
60 W |
6021 |
93.979% |
1966 |
Md5_numeric # 5-5_0_100x2000_0.rt -- md5_numeric # 5-5_2_100x2000_0.rt |
3 |
60 W |
1628 |
98.372% |
2015 |
Md5_numeric # 5-5_0_200x1000_0.rt -- md5_numeric # 5-5_2_200x1000_0.rt |
3 |
60 W |
1476 |
98.524% |
2360 |
Md5_numeric # 5-5_0_500x400_0.rt -- md5_numeric # 5-5_2_500x400_0.rt |
3 |
60 W |
1545 |
98.455% |
4616 |
Md5_numeric # 5-5_0_100x1000_0.rt -- md5_numeric # 5-5_5_100x1000_0.rt |
6 |
60 W |
811 |
99.189% |
2059 |
Md5_numeric # 5-5_0_100x500_0.rt -- md5_numeric # 5-5_11_100x500_0.rt |
12 |
60 W |
497 |
99.503% |
2176 |
Md5_numeric # 5-5_0_200x4000_0.rt |
1 |
80 W |
3847 |
96.153% |
2271 |
Md5_numeric # 5-5_0_2000x400_0.rt |
1 |
80 W |
11737 |
88.263% |
38094 |
Md5_numeric # 5-5_0_100x2000_0.rt -- md5_numeric # 5-5_3_100x2000_0.rt |
4 |
80 W |
392 |
99.608% |
2026 |
Md5_numeric # 5-5_0_100x2000_0.rt -- md5_numeric # 5-5_4_100x2000_0.rt |
5 |
100 million |
113 |
99.887% |
2042 |
Md5_numeric # 5-5_0_100x1__0.rt |
1 |
100 million |
2571 |
97.429% |
2038 |
Md5_numeric # 5-5_0_1000x2000_0.rt |
1 |
200 million |
738 |
99.262% |
10168 |
Analysis: The overall success rate is proportional to the number of nodes. The following is a rough summary.
1. The longer the chain, the more time it takes. The time consumed is mainly related to chain_len, and the number of chains (chain_num). In other words, it is basically irrelevant to the number of forms. When the chain length is 1000, it takes an order of magnitude to traverse 2 W nodes and W nodes;
2. For a single form, if the total number of nodes is equal, the success rate is roughly the same;
3. For form groups, if the number of forms is equal and the number of links remains unchanged, the form groups created by modifying the table_index parameter have a relatively high cracking success rate;
4. When the number of nodes is equal, the chain_num (number of chains) is reduced, and the number of forms is increased (by assigning different values to the table_index parameter), a high cracking success rate is achieved.