Rainbow table parallel system design method and device based on MapReduce

Abstract

The invention discloses a rainbow table parallel system design method and device based on MapReduce. The design method includes a rainbow table data generation step and a rainbow table decryption step; the method includes aiming to each rainbow chain of a rainbow table, allowing a map module to acquire a chain head node data vector and chain end node data vector of the rainbow chain, recording the chain head node data vector as (img file = 'DDA0000586158180000011.TIF' wi = '88' he = '72' / ), recording the chain end node data vector as (img file = 'DDA0000586158180000012.TIF' wi = '95' he = '66' / ), adopting EPi as Key, adopting SPi as Value, and transmitting <EPi, SPi> data to a Reduce module of the rainbow chain; allowing the Reduce module of the rainbow chain to reorganize the <EPi, SPi> data, acquiring a data structure that (img file = 'DDA0000586158180000013 .TIF 'wi =' 400 'he =' 72 ' / ), presenting a chain table as (img file =' DDA0000586158180000014.TIF 'wi =' 238 'he =' 68 ' / ), and allowing the value of the chain table to be a set of chain head node data vectors of the rainbow table with all chain end node data vectors serving as the EPi; inserting all reorganized rainbow table data and fresh & lt; Key, Value & gt; data into a database NoSQL; analyzing Hash H0 to be decrypted, and mapping the H0 as nodes Nodei of the rainbow chain; converting the Nodek as the chain end node data vectors EP'i; adopting the EP'i as the key to read the reorganized rainbow chain data from the database NoSQL, and analyzing and acquiring the H0 passwords.

Description

technical field [0001] The invention relates to password recovery technology in the field of network information security, in particular to a parallel system design method and device based on MapReduce rainbow table. Background technique [0002] In order to ensure the security of background data, most of the current practices are to use hash algorithms to encrypt and store plaintext passwords. Hash algorithm, also known as hash algorithm, can convert an input of any length into a fixed-length hash value output, and it is unidirectional, and the input cannot be reversed from the output. It is widely used in the field of password security. Keep passwords safe. The password recovery process is: given a hash value H0, try to calculate the hash value Hash(x) corresponding to various plaintext x, if Hash(x)=H0, then x is the password corresponding to H0. The search methods include brute force exhaustion and dictionary lookup, but the brute force exhaustion method is feasible fo...

AI Technical Summary

Problems solved by technology

Even so, the generation process of the rainbow table is still quite time-consuming, and the final generated rainbow chain set still requires a lot of storage space, especially to support long passwords with more than 10 characters

On the other hand, during the generation process of the rainbow chain, a large number of overlapping linked lists will occur, that is, the first node of the linked list is different, but the tail node of the linked list is the same. This phenomenon adds a lot of interference data to the password recovery process

At present, most of them reduce this interference by sub-table, but this increases the complexity of decryption, and if the word tables are not stored separately, the load of disk io will be increased, and separate storage will increase the communication load

Images