Password searching method and system in multi-node parallel-processing environment

A master node of a multi-node parallel-processing password decryption system including a master node and a plurality of work nodes, the master node:

• configured to generate password candidate generation information and transmitting the password candidate generation information to the plurality of work nodes together with a password decryption command, the password candidate generation information allowing the plurality of work nodes to have different password candidate ranges using password decryption information comprising a maximum password length, a minimum password length, and a string set constituting a password;
• and
• configured to receive a password decryption result from the work node, wherein, in the password candidate generation information, when the minimum password length is 1, (password candidate-generation starting point, the number of the password candidates to be decrypted)=(nD, N−(c−1)D) is transmitted to one of the work nodes, and (password candidate generation starting point, the number of the password candidates to be decrypted)=(nD, D) is transmitted to the other work nodes, where N is the total number of the password candidates, c is the number of the work nodes, D is N/c, and n means an n-th node.

A work node of a multi-node parallel-processing password decryption system including a master node and a plurality of work nodes, the work node:

• configured to receive password candidate generation information allowing the plurality of work nodes to have different password candidate ranges and a password decryption command from the master node;
• configured to decrypt a password using the password candidate generation information, and transmit the password decryption result to the master node, wherein, in the password candidate generation information, when the minimum password length is 1, (password candidate generation starting point, the number of the password candidates to be decrypted)=(nD, N−c−1)D is transmitted to one of the work nodes, and (password candidate generation starting point, the number of the password candidates to be decrypted)=(nD, D) is transmitted to the other work nodes, where N is the total number of the password candidates, c is the number of the work nodes, D is N/c, and n means an n-th work node.