Big data rainbow table based decryption method and device

Abstract

The invention discloses a big data rainbow table based decryption method and device. The decryption method comprises the steps that rainbow table tasks are allocated to n GPU (Graphic Processing Unit) computing nodes, wherein n is an integer which is greater than 1; each GPU computing node generates a rainbow table; index grouping is performed on chain end nodes of Hash chains in the generated rainbow tables, and sorting the chain end nodes in each group; and in the index grouped and sorted rainbow tables, firstly performing index searching on a ciphertext to be decrypted, and then executing binary searching so as to acquire a corresponding plaintext to complete decryption. For letter-number combination passwords with 1-12 bits, the Hash chains in the rainbow tables can be generated in a parallel manner via a plurality of GPUs by using an encryption result ciphertext, so that the generation speed of the rainbow tables is greatly improved. In addition, index sorting is performed on the generated rainbow tables, so that the rainbow table searching time in a decryption stage is greatly shortened, and the decryption time is greatly shortened.

Description

technical field [0001] The invention relates to the technical field of password reverse recovery, in particular to a decryption method and device based on a large data rainbow table. Background technique [0002] With the rapid development of the Internet, the requirements for network information security are getting higher and higher. In order to ensure security, password encryption and decryption techniques are usually used. Encryption technologies and means of various protocols in the Internet emerge in an endless stream, such as MD5, SHA1, LM, NTLMHASH and MD4 and other encryption algorithms. For the ciphertext obtained after the implementation of various encryption algorithms, the decryption technology is used to decipher the ciphertext to obtain the plaintext. [0003] Currently, for simple passwords and password systems, password cracking can be done by brute force. And for more complicated passwords and password systems, for example, for passwords larger than 8 di...

AI Technical Summary

Problems solved by technology

[0004] However, as a compressed hash table, the rainbow table often takes up a huge space for long passwords, and takes a long time to crack. But the generation time is too long to meet actual needs

In addition, due to the large size of the rainbow table file, it takes a long time to find the crack and the efficiency is low

Even if there are some commercial rainbow tables, they can only crack passwords with less than 9 digits, and the cracking accuracy is only about 80%. The cracking time is long, and it is difficult to meet the actual needs.

Images