CN105262584A - Distributed password recovery method and system - Google Patents
Distributed password recovery method and system Download PDFInfo
- Publication number
- CN105262584A CN105262584A CN201510566308.7A CN201510566308A CN105262584A CN 105262584 A CN105262584 A CN 105262584A CN 201510566308 A CN201510566308 A CN 201510566308A CN 105262584 A CN105262584 A CN 105262584A
- Authority
- CN
- China
- Prior art keywords
- password
- computing node
- character
- task block
- traversal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Storage Device Security (AREA)
Abstract
The invention provides a distributed password recovery method and system. The method comprises the following steps: calculating a password space according to password rule information of a password to be recovered; distributing task blocks of corresponding sizes to each calculation node in a password space range according to the password processing capability of various calculation nodes in a unit time, and triggering various calculation nodes to perform corresponding password traversal according to information of the task blocks; and distributing the task blocks of corresponding sizes to the calculation nodes completing password traversal tasks again till traversal of the password space is completed. According to the preferred embodiment, the task blocks of corresponding sizes are distributed to the calculation nodes according to the password processing capability of various calculation nodes in the unit time, such that password traversal is carried out; therefore, load balancing of different calculation nodes in a distributed environment can be ensured; furthermore, the fault-tolerant capability of the system is high; when one or more calculation nodes are abnormal, the fault recovery cost is small; and the whole performance is optimal.
Description
Technical field
The application relates to password recovery technique field, especially, relates to a kind of distribution routing algorithm restoration methods and system.
Background technology
Violence traversal and dictionary traversal are two kinds of traversal modes the most frequently used during Current Password recovers.Violence traversal is exactly travel through all passwords in the rule of user's formulation, and dictionary traversal is then travel through the password in dictionary file.Violence mode often needs more rule to cover password space large as far as possible to improve the success rate of password recovery, but password space too senior general cause travel time to double, even need the time of hundreds and thousands of years, make password recovery lose meaning.The success rate of dictionary traversal mode is often limited to the password number in dictionary, because the password number of dictionary generally can not be too many, therefore can complete the traversal of password in the short time, but generally can only recover conventional password, helpless for some complicated passwords.
The relatively conventional means of violence traversal at present or in password recovery, within the effective time, how to recover password is current main direction of studying.The time of violence recovery password depends primarily on the computing capability of computer, and the computing capability of single computer is limited.Along with the development of distributed computing technology, it is inexorable trend with raising speed that the computer node be distributed in network can be utilized jointly to participate in password recovery.Utilize distributed computing technology to realize password recovery, must faced by a problem be exactly how password is distributed to different computers, to ensure that each computing node can reach the state of a load balancing, the utilance of whole system and computational speed is made to reach the highest problem.
Application number is 201010614916.8, name is called that the Chinese invention patent file of " a kind of decipher processing method and equipment thereof " discloses a kind of password method for splitting: if password rule to be restored is ten pure digi-tal, is removablely divided into the following two kinds password combination: (1) first bit digital is 1,2,3,4 or 5 and nine cardinar number combinatorics on words; (2) first bit digital are 6,7,8,9 or 0 and nine cardinar number combinatorics on words.These two kinds of password combination are assigned in two arithmetic elements respectively and recover.
The program can improve password recovery efficiency to a certain extent compared with single computer scheme, but also there is following shortcoming: when being distributed in the computing power on each node and differing greatly, divide task in such a way, may occur that the computer node of poor performance will calculate for a long time, and the good computer node of performance is finished the work and is in the situation of idle condition (i.e. load imbalance), the overall performance of system is poor.In addition, for prior art, also may there is the situation that the character number in character set can not be divided exactly by the quantity of computer, now, certain or password number assigned by a few equipment must be caused to want many, whole system load imbalance, some equipment may be idle, and some equipment also will calculate the long time.
Summary of the invention
The application provides a kind of distribution routing algorithm restoration methods, for solve prior art may because of distributed computational nodes load imbalance the problem of influential system overall performance.
Present invention also provides a kind of distribution routing algorithm recovery system, to ensure said method application in practice.
According to another preferred embodiment of the application, disclose a kind of distribution routing algorithm restoration methods, the system performing described method comprises the computing node of at least 1 service node and more than 1, connected by network between described service node and computing node, described service node is independent computer or is held a concurrent post by computing node wherein; Described method comprises: according to the password Rule Information of password to be restored, calculates password space; Wherein said password Rule Information comprises character set and Password Length; According to the cryptographic processing ability of each computing node within the unit interval, for each computing node distributes the task block of corresponding size in described password spatial dimension, trigger each computing node according to the corresponding password traversal of the information and executing of described task block; For completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed; Wherein, described password recovery flow process is terminated when one of them computing node traverses password to be restored.
Preferably, before the task block of the described computing node for the having completed password traversal task corresponding size of sub-distribution again performs the step of password traversal, also comprise: judge whether each computing node occurs exception, if so, the task block distributing to this abnormal computing node is changed to the state that follow-up flow process can redistribute process.
Preferably, the information of described task block comprises initial value b and the password number k of task block; Described each computing node, according to the corresponding password traversal of the information and executing of described task block, is specially: using the initial value b of described task block as several b ' to be converted; Several b ' to be converted is converted to password to be detected; Verify whether described password to be detected is password to be restored, if so, terminates password recovery flow process; Several b ' to be converted is increased progressively 1, repeats the conversion of above-mentioned password and password verification process, until the password number of traversal reaches k.
Preferably, described the method that several b ' to be converted is converted to password to be detected specifically to be comprised: with following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
b
0＝b′
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation.
Preferably, the described unit interval is minute; The size of described task block equals the password number that corresponding computing node can travel through in 1 minute.
Preferably, also comprise: for the information of next preset password rule, repeat above-mentioned password traversal flow process, until the password of all preset password rules has all been traversed.
According to another preferred embodiment of the application, also disclose a kind of distribution routing algorithm recovery system, comprise the computing node of at least 1 service node and more than 1, connected by network between described service node and computing node, described service node is independent computer or is held a concurrent post by computing node wherein; Described service node specifically comprises: password space calculating unit, for the password Rule Information according to password to be restored, calculates password space; Wherein, described password Rule Information comprises character set and Password Length; Task block allocation units, for according to the cryptographic processing ability of each computing node within the unit interval, for each computing node distributes the task block of corresponding size in described password space, trigger each computing node according to the corresponding password traversal of the information and executing of described task block; And, for completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed; Wherein, password recovery process is terminated when one of them computing node traverses password to be restored.
Preferably, described service node also comprises: abnormality judging unit, for judging whether each computing node occurs exception, when some computing nodes occur abnormal, be the state that task block allocation units can redistribute process by the Status Change distributing to the task block of this abnormal computing node.
Preferably, the information of described task block comprises initial value b and the password number k of task block; Each described computing node specifically comprises: round-robin scheduling unit, and for the initial value b from described task block, as several b ' to be converted, round-robin scheduling password converting unit and password authentication unit perform password conversion and password verification process; B ' is all increased progressively 1 by each circulation, until the password number of traversal reaches quantity k;
Password converting unit, for being converted to password to be detected by several b ' to be converted; Wherein, several b ' to be converted is converted to password to be detected by described password converting unit in the following way:
With following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation;
Password authentication unit, for verifying whether the password to be detected that described password converting unit generates is password to be restored; When described password to be detected is password to be restored, notify that described service node terminates password recovery process.
Preferably, described service node also comprises: password rule setting unit, for preset password rule, and performs the password traversal of corresponding password rule according to each password regular cyclic scheduling password space calculating unit preset and task block allocation units.
Compared with prior art, the application has the following advantages:
The application's preferred embodiment is that the task block that it distributes corresponding size carries out password traversal according to the cryptographic processing ability of each computing node within the unit interval, different computing node load balancing under can ensureing distributed environment; In addition, due to the task block being assigned to each computing node relatively little (in the unit interval accessible password quantity) at every turn, when one or more computing node occurs abnormal, the cost recovering mistake is very little, can improve system survivability largely, overall performance can reach optimum.
Accompanying drawing explanation
Fig. 1 is the flow chart of the application's distribution routing algorithm restoration methods first embodiment;
Fig. 2 is the flow chart of the application's distribution routing algorithm restoration methods second embodiment;
Fig. 3 is the structural representation that the application's distribution routing algorithm restorer unifies embodiment.
Embodiment
For enabling above-mentioned purpose, the feature and advantage of the application more become apparent, below in conjunction with the drawings and specific embodiments, the application is described in further detail.
With reference to Fig. 1, show the flow process of the application's distribution routing algorithm restoration methods first embodiment, executive agent is Distributed Computer System, described Distributed Computer System comprises the computing node (n≤1) of 1 service node and n, is connected between each computer node by computer network; The computing capability of i-th node within the unit interval is v
i; Wherein, 1≤i≤n, v
irepresent the quantity of process password in i-th computer node unit interval; Such as, when the unit interval is minute, if v
10=10000, represent that the computing capability of the 10th computing node is process per minute 10000 passwords.This method for optimizing embodiment comprises the following steps:
Step S101: according to the password Rule Information of password to be restored, calculates password space;
Wherein said password Rule Information comprises character set and Password Length; Such as, assuming that password rule is: Password Length is 6, the character quantity that character set comprises was 10 (only comprising 10 numerals ' 0 ' ~ ' 9 '), and so its password space is 10
6(namely in an initial condition, to remain password number be the value of c is 10
6).
Step S102: according to the cryptographic processing ability of each computing node within the unit interval, for each computing node distributes the task block of corresponding size in described password spatial dimension, trigger each computing node according to the corresponding password traversal of the information and executing of described task block;
Wherein, the information of described task block comprises initial value b and the password number k of task block;
For password space mentioned above, in an initial condition, initial value b=0; Residue password number c=10
6.
Such as, have 2 computing nodes in supposing the system, the cryptographic processing ability of the 1st computing node A is 10000, represents that this node can travel through 10000 passwords within 1 minute, now, can be k by the task block size distributing to this computing node
a=10000, the initial value distributing to the task block of this node first can be b
a=0, now, the task block initial value b=b that this password space is new
a+ k
a=10000, residue password number c=10
6-10000; The cryptographic processing ability supposing the 2nd computing node B is 20000, and representing that this node can travel through 20000 passwords within 1 minute, now, can be k by the task block size distributing to this computing node
b=20000, the initial value distributing to the task block of this node first can be b
b=10000, now, the new task block initial value b=b in this password space
b+ k
b=30000, residue password number c=10
6-30000.
In the preferred embodiment, described password recovery flow process is terminated when one of them computing node traverses password to be restored;
Step S103: for completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed;
In the preferred embodiment, can be whether 0 judge whether password space has been traversed with residue password number c.
Step S104: for the information of next preset password rule, repeats above-mentioned password traversal flow process, until the password space of all preset password rules has all been traversed.
In a further preferred embodiment of this method embodiment, in step S102, each computing node is according to the method for the corresponding password traversal of the information and executing of described task block, specifically can comprise:
Step S1021: using the initial value b of described task block as several b ' to be converted;
Step S1022: several b ' to be converted is converted to password to be detected;
Wherein, the method that several b ' to be converted is converted to password to be detected is specifically comprised:
With following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
b
0＝b′
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation.
Step S1023: verify whether described password to be detected is password to be restored, if so, terminates password recovery flow process; Otherwise, go to step S1024;
Step S1024:b ' increases progressively 1;
Step S1025: judge b '=b+c? if so, process ends, otherwise go to step S1022.
Below, for the first time password traversal task of the computing node B of above-illustrated, the password transfer process adopting above-mentioned conversion method is described, specifically comprises:
The calculating of the 1st character: b
0=b '=10000, j
0=10000%10=0, represents that the 1st character of the 1st password to be detected is ' 0 ';
The calculating of the 2nd character: b
1=[b
0/ m]=[10000/10]=1000; j
1=b
1%m=1000%10=0, represents that the 2nd character of the 1st password to be detected is ' 0 ';
The calculating of the 3rd character: b
2=[b
1/ m]=[1000/10]=100; j
2=b
2%m=100%10=0, represents that the 3rd character of the 1st password to be detected is ' 0 ';
The calculating of the 4th character: b
3=[b
2/ m]=[100/10]=10; j
3=b
3%m=10%10=0, represents that the 4th character of the 1st password to be detected is ' 0 ';
The calculating of the 5th character: b
4=[b
3/ m]=[10/10]=1; j
4=b
4%m=1%10=1, represents that the 5th character of the 1st password to be detected is ' 0 ';
The calculating of the 6th character: b
5=[b
4/ m]=[1/10]=0; j
5=b
5%m=0%10=0, represents that the 6th character of the 1st password to be detected is ' 0 ';
Thus the 1st password to be detected that can draw computing node B is ' 000010 '; With above-mentioned algorithm, can draw ensuing 19999 passwords to be detected be respectively ' 100010 ', ' 200010 ', ' 300010 ' ..., ' 999920 '.
With reference to Fig. 2, show the flow process of the application's distribution routing algorithm restoration methods second embodiment, in the preferred embodiment, for increasing fault-tolerant ability further, avoid the task block causing distributing to this node because of fortuitous events such as long playing particular computer deadlocks normally cannot perform the problem of password traversal, be also provided with failed tasks treatment step; In addition, remaining unallocated password number c (initial value is the password space needing to recover) by arranging also real-time update in systems in which and traveling through failed password number c in this preferred embodiment
fparameters such as (distributed to certain node but do not completed password traversal because this node occurs abnormal) judges whether password recovery task terminates.This method for optimizing embodiment comprises the following steps:
Step S201: according to the password Rule Information of password to be restored, calculates password space;
If password rule is 7 pure digi-tal, namely in character set, character quantity is 10 (' 0 ' ~ ' 9 '), then its password space is 10
7, altogether need traversal 10
7individual password, to Two Variables assignment, head pointer b=0, residue password number c=10
7.
Step S202: according to the cryptographic processing ability of each idle computing node within the unit interval is the task block that it distributes corresponding size in password spatial dimension, triggers corresponding computing node according to the corresponding password traversal of the information and executing of its task block;
Such as, computing node A can travel through 10000 passwords in 1 minute, then can by the task block size k of this computing node
a(maximum task block quantity) is set to 10000.
Step S203: judge whether to occur abnormal computing node? if so, S204 is gone to step; Otherwise, go to step S205.
After task starts, be two control variables clear 0, i.e. initial value b of failed tasks block
f=0, c
f=0, failed tasks block is used to the task data recorded because the situations such as machine deadlock cannot complete; If a certain computing node occurs abnormal (as crashed), then can according to the initial value b of this abnormal nodes
bwith task block size k
bif (occurring that abnormal node is B) upgrades the control variables b of failed tasks block
fand c
f.
Step S204: the task block distributing to this abnormal computing node is changed to the state that follow-up flow process can redistribute process;
In the preferred embodiment, can give idle computing node by this failed tasks block priority allocation, concrete, service node is according to the disposal ability (k) of each computing node, and b, c, b
fand c
fthese four variablees determine the task block distributing to respective nodes; If k
fbe not 0, illustrate in failed tasks block have task, then obtain from failed tasks block, and upgrade b
fand c
fvalue; If c
fbe 0, then from Regular Task block, obtain task, upgrade the value of b and c simultaneously;
Such as, the maximum task block quantity k of computing node A
abe 10000, the maximum task block quantity k of computing node B
bbe 20000, they are to server application task block, and front 10000 passwords are distributed to computing node A by service node, send task block initial value b namely to computing node A
a=0, k
a=10000, the initial value b=10000 of update rule simultaneously, residue password number c=10
7-10000; In like manner, computing node B is also assigned to a block encryption space initial value b by same mode
b=10000, k
b=20000, the initial value b=30000 of update rule simultaneously, residue password number c=10
7-30000.
Each computing node gets task block data, comprising the information of password rule, i.e. character set and Password Length, and the initial value of task block and password number, computing node needs to convert corresponding password to according to these information to carry out traveling through (i.e. " computing node travels through according to the corresponding password of the information and executing of its task block " in step S202).
For 7 pure digi-tal, character set is ' 0 '-' 9 ', and character set length is 10, and Password Length is 7, b
b=10000, c
b=20000, then the transfer algorithm of initiation codon is as follows:
(1) first the 1st character is calculated, b '=b
b, be 0,0 the 1st character representing inside character set with b ' to character set quantity remainder result, the 1st that namely represents initiation codon is character ' 0 ';
(2) calculate the 2nd character, b ' rounds divided by character set quantity, and b '=10000/10 is 1000, and be 0 by b ' to character set quantity remainder result with (1), the 2nd that represents initiation codon is character ' 0 ';
(3) by that analogy, the 3-7 position character that can obtain initiation codon is ' 0 ', ' 0 ', ' 1 ', ' 0 ', ' 0 ' respectively, namely obtains the 1st password of this task block for " 0000100 ";
According to this algorithm, ensuing password can be obtained for " 1000100 ", " 2000100 " ..., until the password number of traversal reaches k
b, then the password of this task block has traveled through.
Step S205: judge that the password space of current password rule has been traversed? if so, S206 is gone to step; Otherwise, go to step S202.
After the task block of computing node has traveled through, to service node feedback traversing result, or to the new task block of service node application, return step S202 and continue traversal;
In the preferred embodiment, as residue failed tasks number c
f=0 and residue password number c=0 time, represent that the password traversal of current password rule terminates.
Step S206: judge that the password space of all password rules has all been traversed? if so, password recovery flow process is terminated; Otherwise, go to step S207:
Step S207: using next password rule as current password rule, go to step the password space traversal process that S201 performs this current password rule.
For aforesaid each embodiment of the method, simple in order to describe, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the application is not by the restriction of described sequence of movement, because according to the application, some step can adopt other orders or perform simultaneously; Secondly, those skilled in the art also should know, said method embodiment all belongs to preferred embodiment, and involved action and module might not be that the application is necessary.
With reference to Fig. 3, show the structured flowchart that the application's distribution routing algorithm restorer unifies embodiment, comprise 1 service node 31 and 2 computing nodes 32, connected by network 30 between service node 31 and computing node 32; Described service node specifically comprises:
Password space calculating unit 311, for the password Rule Information according to password to be restored, calculates password space;
Wherein, described password Rule Information comprises character set and Password Length; Such as, assuming that in a password rule, Password Length is 8, and the character quantity m that character set comprises is 36 (being specially 10 numerals ' 0 ' ~ ' 9 ' and 26 small English alphabet ' a ' ~ ' z '), and so its password space is 36
8.
Task block allocation units 312, for according to the cryptographic processing ability of each computing node 32 within the unit interval, for each computing node distributes the task block of corresponding size in described password space, trigger each computing node 32 according to the corresponding password traversal of the information and executing of described task block; And, for completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed; Wherein, password recovery process is terminated when one of them computing node traverses password to be restored;
Wherein, when the above-mentioned unit interval is minute, the size of described task block can equal the password number that corresponding computing node can travel through in 1 minute.
Such as, supposing that the cryptographic processing ability of the 1st computing node A is 10000, represent that this node can travel through 10000 passwords within 1 minute, now, can be c by the task block size distributing to this computing node
a=10000; The cryptographic processing ability supposing the 2nd computing node B is 20000, and representing that this node can travel through 20000 passwords within 1 minute, now, can be c by the task block size distributing to this computing node
b=20000;
Abnormality judging unit 313, for judging whether each computing node 32 occurs exception, when some computing nodes 32 occur abnormal, be the state that task block allocation units 312 can redistribute process by the Status Change distributing to the task block of this abnormal computing node 32;
In the preferred embodiment, can by arranging the initial value b of this abnormal task block
fwith block size c
fmode realize.
Password rule setting unit 310, for preset password rule, and performs the password traversal of corresponding password rule according to each password regular cyclic scheduling password space calculating unit 311 preset and task block allocation units 312.
Described task block allocation units 312 are initial value b and the password number c that an information of the task block of computing node 32 distribution comprises task block; Each described computing node 32 specifically comprises:
Round-robin scheduling unit 321, for the initial value b from described task block, as several b ' to be converted, round-robin scheduling password converting unit 322 and password authentication unit 323 perform password conversion and password verification process; B ' is all increased progressively 1 by each circulation, until the password quantity of traversal reaches password number c;
Password converting unit 322, for being converted to password to be detected by several b ' to be converted; Wherein, method b ' being converted to password to be detected specifically comprises:
With following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation;
Password authentication unit 323, for verifying whether the password to be detected that described password converting unit 322 generates is password to be restored; When described password to be detected is password to be restored, notify that described service node 31 terminates password recovery process.
It should be noted that, in the embodiment shown in fig. 3, service node 31 has 1, computing node 32 has 2, but the restriction that can not form the application, those skilled in the art can arrange one or more service nodes 31 as required, also can arrange the computing node 32 of more than 2, only can also arrange 1 computing node 32; For service node 31, can be independent computer, also can be held a concurrent post by computing node 32 wherein.
In addition, said system embodiment belongs to preferred embodiment, and service node and the unit involved by computing node and module might not be that the application is necessary; As when the password not needing to consider to cause because of abnormal causes such as computer corruptions can not the problem of the total space traversal time, abnormality judging unit 313 can be omitted; When needing the password rule of password to be restored only to have one, password rule setting unit 310 etc. can be omitted.
Each embodiment in this specification all adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment identical similar part mutually see.For the device embodiment of the application, due to itself and embodiment of the method basic simlarity, so description is fairly simple, relevant part illustrates see the part of embodiment of the method.
A kind of distribution routing algorithm restoration methods above the application provided and system, be described in detail, apply specific case herein to set forth the principle of the application and execution mode, the explanation of above embodiment is just for helping method and the core concept thereof of understanding the application; Meanwhile, for one of ordinary skill in the art, according to the thought of the application, all will change in specific embodiments and applications, in sum, this description should not be construed as the restriction to the application.
Claims (10)
1. a distribution routing algorithm restoration methods, it is characterized in that, the system performing described method comprises the computing node of at least 1 service node and more than 1, connected by network between described service node and computing node, described service node is independent computer or is held a concurrent post by computing node wherein; Described method comprises:
According to the password Rule Information of password to be restored, calculate password space; Wherein said password Rule Information comprises character set and Password Length;
According to the cryptographic processing ability of each computing node within the unit interval, for each computing node distributes the task block of corresponding size in described password spatial dimension, trigger each computing node according to the corresponding password traversal of the information and executing of described task block;
For completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed;
Wherein, described password recovery flow process is terminated when one of them computing node traverses password to be restored.
2. method according to claim 1, is characterized in that, before the task block of the described computing node for the having completed password traversal task corresponding size of sub-distribution again performs the step of password traversal, also comprises:
Judge whether each computing node occurs exception, if so, the task block distributing to this abnormal computing node is changed to the state that follow-up flow process can redistribute process.
3. method according to claim 1 and 2, is characterized in that, the information of described task block comprises initial value b and the password number k of task block; Described each computing node, according to the corresponding password traversal of the information and executing of described task block, is specially:
Using the initial value b of described task block as several b ' to be converted;
Several b ' to be converted is converted to password to be detected;
Verify whether described password to be detected is password to be restored, if so, terminates password recovery flow process;
Several b ' to be converted is increased progressively 1, repeats the conversion of above-mentioned password and password verification process, until the password number of traversal reaches k.
4. method according to claim 3, is characterized in that, describedly the method that several b ' to be converted is converted to password to be detected is specifically comprised:
With following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
b
0＝b′
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation.
5. method according to claim 2, is characterized in that, the described unit interval is minute; The size of described task block equals the password number that corresponding computing node can travel through in 1 minute.
6. method according to claim 1, is characterized in that, also comprises: for the information of next preset password rule, repeats above-mentioned password traversal flow process, until the password of all preset password rules has all been traversed.
7. a distribution routing algorithm recovery system, it is characterized in that, comprise the computing node of at least 1 service node and more than 1, connected between described service node and computing node by network, described service node is independent computer or is held a concurrent post by computing node wherein; Described service node specifically comprises:
Password space calculating unit, for the password Rule Information according to password to be restored, calculates password space; Wherein, described password Rule Information comprises character set and Password Length;
Task block allocation units, for according to the cryptographic processing ability of each computing node within the unit interval, for each computing node distributes the task block of corresponding size in described password space, trigger each computing node according to the corresponding password traversal of the information and executing of described task block; And, for completing the task block of the computing node corresponding size of sub-distribution again of password traversal task, until described password space has been traversed; Wherein, password recovery process is terminated when one of them computing node traverses password to be restored.
8. system according to claim 7, is characterized in that, described service node also comprises:
The Status Change distributing to the task block of this abnormal computing node, for judging whether each computing node occurs exception, when some computing nodes occur abnormal, is the state that task block allocation units can redistribute process by abnormality judging unit.
9. the system according to claim 7 or 8, is characterized in that, the information of described task block comprises initial value b and the password number k of task block; Each described computing node specifically comprises:
Round-robin scheduling unit, for the initial value b from described task block, as several b ' to be converted, round-robin scheduling password converting unit and password authentication unit perform password conversion and password verification process; B ' is all increased progressively 1 by each circulation, until the password number of traversal reaches quantity k;
Password converting unit, for being converted to password to be detected by several b ' to be converted; Wherein, several b ' to be converted is converted to password to be detected by described password converting unit in the following way:
With following formulae discovery numeral j
0, by jth in character set
0+ 1 character is as the 1st character of password to be detected;
j
0＝b
0％m
Wherein, m represents the quantity of character in character set, b
0%m represents and uses b
0divided by m complementation;
From the 2nd, with following formulae discovery numeral j
i, by jth in character set
i+ 1 character is as the i-th+1 character of password;
b
i＝[b
i-1/m]
j
i＝b
i％m
Wherein, i is greater than the integer that 0 is less than Password Length, and m represents the quantity of character in character set, b
i%m represents and uses b
idivided by m complementation, [b
i-1/ m] expression b
i-1divided by m rounding operation;
Password authentication unit, for verifying whether the password to be detected that described password converting unit generates is password to be restored; When described password to be detected is password to be restored, notify that described service node terminates password recovery process.
10. system according to claim 7, it is characterized in that, described service node also comprises: password rule setting unit, for preset password rule, and perform the password traversal of corresponding password rule according to each password regular cyclic scheduling password space calculating unit preset and task block allocation units.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510566308.7A CN105262584B (en) | 2015-09-08 | 2015-09-08 | Distribution routing algorithm restoration methods and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510566308.7A CN105262584B (en) | 2015-09-08 | 2015-09-08 | Distribution routing algorithm restoration methods and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105262584A true CN105262584A (en) | 2016-01-20 |
| CN105262584B CN105262584B (en) | 2018-09-07 |
Family
ID=55102106
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510566308.7A Active CN105262584B (en) | 2015-09-08 | 2015-09-08 | Distribution routing algorithm restoration methods and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105262584B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045159A (en) * | 2010-12-30 | 2011-05-04 | 北京锐安科技有限公司 | Decryption processing method and device thereof |
| CN102983967A (en) * | 2012-12-06 | 2013-03-20 | 厦门市美亚柏科信息股份有限公司 | Quick traversal algorithm and device for complicated password |
| CN103701590A (en) * | 2014-01-07 | 2014-04-02 | 厦门市美亚柏科信息股份有限公司 | Dictionary-based complex password traversing method and device |
| CN104717058A (en) * | 2015-02-10 | 2015-06-17 | 厦门市美亚柏科信息股份有限公司 | Cipher traversal method and device |
-
2015
- 2015-09-08 CN CN201510566308.7A patent/CN105262584B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045159A (en) * | 2010-12-30 | 2011-05-04 | 北京锐安科技有限公司 | Decryption processing method and device thereof |
| CN102983967A (en) * | 2012-12-06 | 2013-03-20 | 厦门市美亚柏科信息股份有限公司 | Quick traversal algorithm and device for complicated password |
| CN103701590A (en) * | 2014-01-07 | 2014-04-02 | 厦门市美亚柏科信息股份有限公司 | Dictionary-based complex password traversing method and device |
| CN104717058A (en) * | 2015-02-10 | 2015-06-17 | 厦门市美亚柏科信息股份有限公司 | Cipher traversal method and device |
Non-Patent Citations (1)
| Title |
|---|
| 潘雪峰: "基于移动Agent的分布式密码破解系统设计与实现", 《硕士学位论文》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105262584B (en) | 2018-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Huang et al. | Small cluster in cyber physical systems: Network topology, interdependence and cascading failures | |
| JP5459800B2 (en) | Method for initializing server clusters, data media and corresponding server clusters and generating management database operation requests | |
| CN104298843B (en) | A kind of complex mechanism dynamic cascading Reliability Modeling based on colored stochastic Petri net | |
| Isaila et al. | Collective I/O tuning using analytical and machine learning models | |
| CN104255011B (en) | Cloud computing secure data stores | |
| US20160364273A1 (en) | Data Processing Apparatus and Method for Processing Serial Tasks | |
| Levitin et al. | Multi-state systems with selective propagated failures and imperfect individual and group protections | |
| Levitin et al. | Multi-state systems with multi-fault coverage | |
| CN104461747A (en) | Distributed type task scheduling system | |
| CN105099951A (en) | Resource scheduling method and management equipment | |
| Camilli | Formal verification problems in a big data world: towards a mighty synergy | |
| Levitin | Block diagram method for analyzing multi-state systems with uncovered failures | |
| CN104796300A (en) | Method and device for data packet feature extraction | |
| Chew et al. | Robust supervisory control for product routings with multiple unreliable resources | |
| CN107807845A (en) | A kind of incremented data parallel processing apparatus and method | |
| CN104281636A (en) | Concurrent distributed processing method for mass report data | |
| Bogatyrev et al. | Reliability and timeliness of servicing requests in infocommunication systems, taking into account the physical and information recovery of redundant storage devices | |
| US10110258B2 (en) | Accelerated erasure coding for storage systems | |
| CN105262584A (en) | Distributed password recovery method and system | |
| Lu et al. | A study on the reliability of software defined wireless sensor network | |
| Tauz et al. | Multi-message gradient coding for utilizing non-persistent stragglers | |
| RU2502123C1 (en) | Method for dynamic control of dead-end situations in information and communication system and apparatus for realising said method | |
| CN106330748B (en) | A kind of flow control methods and device | |
| CN103699104A (en) | Deadlock avoidance control method and device as well as automatic production system | |
| CN110391929B (en) | Fault-tolerant control method and device and fault-tolerant component |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |