Explains the goal: Explains a asp wooden horse's process encryption to ascend explains the asp wooden horse password land password. Because in the wooden horse does not have the imprint, did not know specifically this wooden horse calls any. 

Explains the mentality: Two kinds, instead solve the password after the encryption password replace scrambled text and using the scrambled text and the encryption algorithm. The former basic is not true explaining. 

Explains the goal: Is all right breaks is playing. 

If cannot obtain the asp source code, then may say that to explains the password, my not in the least stratagem which ensures success. Had China's friend saying that he obtained a web jurisdiction, but was unable to revise the main page, discovered already had the asp wooden horse, but the password underwent the encryption. Then had this animation. Good, the idle talk have been too many, that finishes the preparation, this time illustration suitable long. 

the asp wooden horse lands the password confirmation essential code to be as follows: 

if Epass (trim (request.form (“password”)))= " q_ux624q|p” then response.cookies (“password”) = " 8811748”…

Very obvious, what with is the Epass function carries on the input password the encryption, will then obtain the scrambled text and the original scrambled text carry on rightly compared. If slightly a little programs foundation, specially VB, then in the Epass encryption algorithm will be clear at a glance. If does not have, that has not related, believed that undergoes my explanation, you very quick will understand. In the function, preserves the password the variable is pass. pass& " zxcvbnm. /“pass in content and zxcvbnm. /connects obtains a new string of character. left (pass& " zxcvbnm. /”, 10) takes first 10. The StrReverse function will obtain 10 string of character orders invert. len(pass) obtains the password the length. Below is a circulation. Will obtain in the string of character each Ascii code - password length + takes entire (character to reign *1.1), will then obtain the value transforms the character to connect. Finally will obtain in the string of character has ' the character to replace B completely, such scrambled text production. If we withdraw the encryption algorithm with our scrambled text replace original scrambled text, then serves as contrast the password will also turn your password. But I have said that this is not explaining in the true sense. 

What if we input is love, the encryption process is as follows: 

lovelovezxcvbnm. /'connects lovezxcvbn
'takes first 10 nbvcxzevol 
'the order inverts n110(ascii) - 4 (figure) +int (1 (position) *1.1)
the =107107 ascii code is k, analogizes in turn, finally scrambled text: k `ucy|hzts

We may instead promote the password through the scrambled text and the encryption algorithm. Last step starts from the algorithm upward to push. Last step replaces with B all ', has the necessity not to replace B ', the answer is negative. So long as we can obtain the final scrambled text, the password not equally is also possible. If has 10 B, that original password integer on 2 10 power of exponent, although the original password has one, but 1024 passwords are correct. If must explain perfectly the friend, may try to compile the complete combination.