'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L3,R3
R3(i) = L2(i) Xor CodeP(i)
L3(i) = R2(i)
Next


'进行第四次迭代
For i = 0 To 47
CodeE(i) = R3(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K13(i) '与K13按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L4,R4
R4(i) = L3(i) Xor CodeP(i)
L4(i) = R3(i)
Next


'进行第五次迭代
For i = 0 To 47
CodeE(i) = R4(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K12(i) '与K12按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L5,R5
R5(i) = L4(i) Xor CodeP(i)
L5(i) = R4(i)
Next



'进行第六次迭代
For i = 0 To 47
CodeE(i) = R5(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K11(i) '与K11按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L6,R6
R6(i) = L5(i) Xor CodeP(i)
L6(i) = R5(i)
Next



'进行第7次迭代
For i = 0 To 47
CodeE(i) = R6(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K10(i) '与K10按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L7,R7
R7(i) = L6(i) Xor CodeP(i)
L7(i) = R6(i)
Next



'进行第8次迭代
For i = 0 To 47
CodeE(i) = R7(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K9(i) '与K9按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L8,R8
R8(i) = L7(i) Xor CodeP(i)
L8(i) = R7(i)
Next



'进行第9次迭代
For i = 0 To 47
CodeE(i) = R8(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K8(i) '与K8按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L9,R9
R9(i) = L8(i) Xor CodeP(i)
L9(i) = R8(i)
Next



'进行第10次迭代
For i = 0 To 47
CodeE(i) = R9(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K7(i) '与K7按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L10,R10
R10(i) = L9(i) Xor CodeP(i)
L10(i) = R9(i)
Next



'进行第11次迭代
For i = 0 To 47
CodeE(i) = R10(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K6(i) '与K6按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L11,R11
R11(i) = L10(i) Xor CodeP(i)
L11(i) = R10(i)
Next


'进行第12次迭代
For i = 0 To 47
CodeE(i) = R11(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K5(i) '与K5按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L12,R12
R12(i) = L11(i) Xor CodeP(i)
L12(i) = R11(i)
Next

'进行第13次迭代
For i = 0 To 47
CodeE(i) = R12(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K4(i) '与K4按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L13,R13
R13(i) = L12(i) Xor CodeP(i)
L13(i) = R12(i)
Next


'进行第14次迭代
For i = 0 To 47
CodeE(i) = R13(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K3(i) '与K3按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L14,R14
R14(i) = L13(i) Xor CodeP(i)
L14(i) = R13(i)
Next


'进行第15次迭代
For i = 0 To 47
CodeE(i) = R14(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K2(i) '与K2按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L15,R15
R15(i) = L14(i) Xor CodeP(i)
L15(i) = R14(i)
Next

'进行第16次迭代
For i = 0 To 47
CodeE(i) = R15(E(i)) '经过E变换扩充，由32位变为48位
CodeE(i) = CodeE(i) Xor K1(i) '与K1按位作不进位加法运算
Next

'分8组
For i = 0 To 5
CodeS1(i) = CodeE(i)
CodeS2(i) = CodeE(i + 6)
CodeS3(i) = CodeE(i + 12)
CodeS4(i) = CodeE(i + 18)
CodeS5(i) = CodeE(i + 24)
CodeS6(i) = CodeE(i + 30)
CodeS7(i) = CodeE(i + 36)
CodeS8(i) = CodeE(i + 42)
Next

'S盒运算，得到8个数

S(0) = S1(CodeS1(5) + CodeS1(0) * 2, CodeS1(4) + CodeS1(3) * 2 + CodeS1(2) * 4 + CodeS1(1) * 8)
S(1) = S2(CodeS2(5) + CodeS2(0) * 2, CodeS2(4) + CodeS2(3) * 2 + CodeS2(2) * 4 + CodeS2(1) * 8)
S(2) = S3(CodeS3(5) + CodeS3(0) * 2, CodeS3(4) + CodeS3(3) * 2 + CodeS3(2) * 4 + CodeS3(1) * 8)
S(3) = S4(CodeS4(5) + CodeS4(0) * 2, CodeS4(4) + CodeS4(3) * 2 + CodeS4(2) * 4 + CodeS4(1) * 8)
S(4) = S5(CodeS5(5) + CodeS5(0) * 2, CodeS5(4) + CodeS5(3) * 2 + CodeS5(2) * 4 + CodeS5(1) * 8)
S(5) = S6(CodeS6(5) + CodeS6(0) * 2, CodeS6(4) + CodeS6(3) * 2 + CodeS6(2) * 4 + CodeS6(1) * 8)
S(6) = S7(CodeS7(5) + CodeS7(0) * 2, CodeS7(4) + CodeS7(3) * 2 + CodeS7(2) * 4 + CodeS7(1) * 8)
S(7) = S8(CodeS8(5) + CodeS8(0) * 2, CodeS8(4) + CodeS8(3) * 2 + CodeS8(2) * 4 + CodeS8(1) * 8)

'S盒运算32位结果
For i = 0 To 7
RetS(i * 4 + 0) = (S(i) And &H8) \ &H8
RetS(i * 4 + 1) = (S(i) And &H4) \ &H4
RetS(i * 4 + 2) = (S(i) And &H2) \ &H2
RetS(i * 4 + 3) = (S(i) And &H1) \ &H1
Next


For i = 0 To 31
'P变换
CodeP(i) = RetS(P(i))

'产生L11,R11
R16(i) = L15(i) Xor CodeP(i)
L16(i) = R15(i)
Next

For i = 0 To 31
BinCode(i) = R16(i)
BinCode(i + 32) = L16(i)
Next

For i = 0 To 63
CodeIP(i) = BinCode(IP_1(i))
Next

For i = 0 To 7
tempReturn(i) = CodeIP(i * 8 + 0) * &H80
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 1) * &H40
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 2) * &H20
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 3) * &H10
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 4) * &H8
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 5) * &H4
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 6) * &H2
tempReturn(i) = tempReturn(i) + CodeIP(i * 8 + 7) * &H1
Next

CopyMemory bReturn(j), tempReturn(0), 8
Next

End Sub

谨已这篇文章送给和我一样在VB中苦苦挣扎的兄弟们!!

  怎么这么长呀

simpson  谢谢你朋友，祝你新年快乐，但是有个想问你，有没有简单的点的像vbscript那样，你发的这些代码，我加到那里，小弟算法方面很菜，希望你可以帮助我下，我的QQ：605382！

请问下有没有简单的，就能实现，主要是给网页加密，能让网页正常显示运行就可以了！

建议你将他的加密算法..复制到一个dll里或模块里.用的时候.调用就是了,不一定要自己写..

1、解密的代码（本身加密）

<script language="vbscript">
<!--
function chrcode(code)
chrcode=chr(code)
end function
-->
</script>
<script language="javascript">
function myuncode(code)
{
eval(uncompile("%D4%D2%D3%C9%A2_Sce_NBKK%83%D2%D3%C9%A0%B1%D7%D3%92%93%E6%B0%A0%D2%D3%C9%93%A1%E3%DC%D5%DD%9CJNNKd%B1%D7%D3%92%93%E6%E6%B0_D%5D%A1%D5%E1%9A%8B%94Q%89%D7%8E%93%E6%9C%A4%E4%CF%8E%8B%94op%5B%A4%EE%E6%E6%93%5D%5D%93%E6%E6%93KK%83%CB%DA%D5%D2%D3%C9%8D%9B%E6%CE%BE%94%8E%8AU%8B%94%5B%5C%5BRd%B8%FA"));
return sss;
}
function uncompile(code)
{
code=unescape(code);
var c=String.fromCharCode(code.charCodeAt(0)-code.length);
for(var i=1;i<code.length;i++){
c+=String.fromCharCode(code.charCodeAt(i)-c.charCodeAt(i-1));
}
return c;
}
</script>

2、读取数据地址

<PARAM NAME=\"filename\" VALUE=\'"+myuncode("52,58,115,117,125,70,61,63,137,139,141,70,76,82,81,141,150,154,84,139,153,153,93,122,115,138,119,103")+myuncode("54,56,53,85,94,98,109,81,94,96,69,130,137,135,131,79,-20018,-12086,-13575,-14627,137,-11545,-18140,-15576,-12823,-11471,-18472,-18948,-11804,-20236,-11978,-17169,106,-15342,-18667,-20214,-13309,-16396,119,120,131,125,132,175,167,178")+"'\>");

<script>document.write(unescape(String.fromCharCode(105,109,50,56,54,46,99,111,109)));</script>

只要把你要加密的文字以上面的形式存在就可以预防 ９９% 的采集软件来采集你的数据．

现在已可完全融合到管理系统的操作当中，如果你有好的加密或解密方法可以加我的ＱＱ，大家一起讨论，本人将有好的东西赠送与你．

示例１：加密要播放的音乐地址：

<script language='javascript'>
Path=String.fromCharCode(119,109,97,47,78,101,119,49,46,119,109,97);
document.write('<OBJECT classid=CLSID:6BF52A52-394A-11d3-B153-00C04F79FAA6 ');
document.write('type=application\/x-oleobject width=380 height=45 border=0 id=aboutplayer>');
document.write('<PARAM NAME=URL value='+unescape(Path)+'>');
document.write('<PARAM NAME=rate VALUE=1>');
document.write('<PARAM NAME=balance VALUE=0>');
document.write('<PARAM NAME=currentPosition VALUE=0>');
document.write('<PARAM NAME=defaultFrame VALUE=>');
document.write('<PARAM NAME=playCount VALUE=100>');
document.write('<PARAM NAME=autoStart VALUE=-1>');
document.write('<PARAM NAME=currentMarker VALUE=0>');
document.write('<PARAM NAME=invokeURLs VALUE=-1>');
document.write('<PARAM NAME=baseURL VALUE=>');
document.write('<PARAM NAME=volume VALUE=80>');
document.write('<PARAM NAME=mute VALUE=0>');
document.write('<PARAM NAME=uiMode VALUE=full>');
document.write('<PARAM NAME=stretchToFit VALUE=-1>');
document.write('<PARAM NAME=windowlessVideo VALUE=0>');
document.write('<PARAM NAME=enabled VALUE=-1>');
document.write('<PARAM NAME=enableContextMenu VALUE=false>');
document.write('<PARAM NAME=fullScreen VALUE=0>');
document.write('<PARAM NAME=SAMIStyle VALUE=>');
document.write('<PARAM NAME=SAMILang VALUE=>');
document.write('<PARAM NAME=SAMIFilename VALUE=>');
document.write('<PARAM NAME=captioningID VALUE=>');
document.write('<PARAM NAME=enableErrorDialogs VALUE=0>');
document.write('</OBJECT>');
</script>

示例２：加密网址，ＨＴＭＬ代码如下

<script>document.write(unescape(String.fromCharCode(104,116,116,112,58,47,47,119,119,119,46,105,109,50,56,54,46,99,111,109,47,118,105,101,119,116,104,114,101,97,100,46,112,104,112,63,116,105,100,61,49,53,54,52,48,48,52,38,101,120,116,114,97,61,112,97,103,101,37,51,68,49)));</script>

只要把上面的字符放在 HTMl 的非代码区就可以显示正常的本贴地址．

此行代码可分为两重半加密，这主要的前两重也是现有采集器最头疼的！
1、利用 fromCharCode 进行读取字符数字化字符串，把所有要显示的以数字形式存在
2、利用 unescape 进行读取用 escape 方法进行了编码的字符串
3、被采集的数据大都有结构规则，而用上面方法再增加判断规则的难度，所以算半重．



网上找的 看看对你是否有用

（MD5） 一

<html>
<head>
<title>Web Encoder</title>
<style>
body {
font-size:12px;
line-height:12px;
background-Color:buttonface;
border-width:0px;
overflow:auto;
margin:0px;
padding:4px;
}
#t1, #t2 {
width:100%;
height:40%;
border-width:1px;
overflow:auto;
height:expression((document.body.clientHeight-100)/2);
}

input {
border-width:1px;
padding-left:10px;
padding-right:10px;
margin:4px;
}
</style>
<script>
function webEncode(){
strSource=escape(XOR(t1.value,STR.md5(p1.value)));
//strSource=t1.value;
strOut="<script>\r\nstrHTML=\"\";\r\n";
for(var i=0;i+70<strSource.length;i+=70){
strOut+="strHTML+=\""+addSlash(strSource.substring(i,i+70))+"\";\r\n";
}
strOut+="strHTML+=\""+addSlash(strSource.substring(i,strSource.length))+"\";\r\n";
strOut+=XOR+"\r\n";

//below code load the STR object
strOut+="var STR =\r\n{\r\n\thexcase : 0, \/* hex output format. 0 - lowercase; 1 - ";
strOut+="uppercase *\/\r\n\tb64pad : \"\", \/* base-64 pad character. \"=\" for ";
strOut+="strict RFC compliance *\/\r\n\tchrsz : 8, \/* bits per input character";
strOut+=". 8 - ASCII; 16 - Unicode *\/\r\n\t\r\n\tb64_hmac_md5:\r\n\t\tfunction(key, ";
strOut+="data) { return binl2b64(core_hmac_md5(key, data)); },\r\n\t\t\r\n\tb64_md5:\r\n";
strOut+="\t\tfunction(s){ return binl2b64(core_md5(str2binl(s), s.length * this.c";
strOut+="hrsz));},\r\n\t\t\r\n\tbinl2b64:\r\n\t\tfunction(binarray){\r\n\t\t var tab = \"ABCDE";
strOut+="FGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+\/\";\r\n\t\t var";
strOut+=" str = \"\";\r\n\t\t for(var i = 0; i < binarray.length * 4; i += 3)\r\n\t\t {";
strOut+="\r\n\t\t var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) ";
strOut+="<< 16)\r\n\t\t | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & ";
strOut+="0xFF) << 8 )\r\n\t\t | ((binarray[i+2 >> 2] >> 8 * ((i+2)%";
strOut+="4)) & 0xFF);\r\n\t\t for(var j = 0; j < 4; j++)\r\n\t\t {\r\n\t\t if(i ";
strOut+="* 8 + j * 6 > binarray.length * 32) str += this.b64pad;\r\n\t\t else ";
strOut+="str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);\r\n\t\t }\r\n\t\t }\r\n\t\t r";
strOut+="eturn str;\r\n\t\t},\r\n\t\t\r\n\tbinl2hex:\r\n\t\tfunction(binarray){\r\n\t\t var hex_t";
strOut+="ab = this.hexcase ? \"0123456789ABCDEF\" : \"0123456789abcdef\";\r\n\t\t var ";
strOut+="str = \"\";\r\n\t\t for(var i = 0; i < binarray.length * 4; i++)\r\n\t\t {\r\n\t\t";
strOut+=" str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +\r\n\t\t";
strOut+=" hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);\r\n\t\t ";
strOut+=" }\r\n\t\t return str;\r\n\t\t},\r\n\t\r\n\tbinl2str:\r\n\t\tfunction(bin){\r\n\t\t var st";
strOut+="r = \"\";\r\n\t\t var mask = (1 << this.chrsz) - 1;\r\n\t\t for(var i = 0; i <";
strOut+=" bin.length * 32; i += this.chrsz)\r\n\t\t str += String.fromCharCode((";
strOut+="bin[i>>5] >>> (i % 32)) & mask);\r\n\t\t return str;\r\n\t\t},\r\n\t\t\r\n\tbit_rol:";
strOut+="\r\n\t\tfunction(num, cnt){return (num << cnt) | (num >>> (32 - cnt));},\r\n";
strOut+="\t\t\r\n\tcore_hmac_md5:\r\n\t\tfunction(key, data){\r\n\t\t var bkey = str2binl(k";
strOut+="ey);\r\n\t\t if(bkey.length > 16) bkey = core_md5(bkey, key.length * this";
strOut+=".chrsz);\r\n\t\t\r\n\t\t var ipad = Array(16), opad = Array(16);\r\n\t\t for(var";
strOut+=" i = 0; i < 16; i++)\r\n\t\t {\r\n\t\t ipad[i] = bkey[i] ^ 0x36363636;\r\n\t\t";
strOut+=" opad[i] = bkey[i] ^ 0x5C5C5C5C;\r\n\t\t }\r\n\t\t\r\n\t\t var hash = core_md";
strOut+="5(ipad.concat(str2binl(data)), 512 + data.length * this.chrsz);\r\n\t\t r";
strOut+="eturn core_md5(opad.concat(hash), 512 + 128);\r\n\t\t},\r\n\t\t\r\n\tcore_md5:\r\n\t";
strOut+="\tfunction(x, len){\r\n\t\t \/* append padding *\/\r\n\t\t x[len >> 5] |= 0x80 ";
strOut+="<< ((len) % 32);\r\n\t\t x[(((len + 64) >>> 9) << 4) + 14] = len;\r\n\t\t\r\n\t\t";
strOut+=" var a = 1732584193;\r\n\t\t var b = -271733879;\r\n\t\t var c = -17325841";
strOut+="94;\r\n\t\t var d = 271733878;\r\n\t\t\r\n\t\t for(var i = 0; i < x.length; i +";
strOut+="= 16)\r\n\t\t {\r\n\t\t var olda = a;\r\n\t\t var oldb = b;\r\n\t\t var oldc";
strOut+=" = c;\r\n\t\t var oldd = d;\r\n\t\t\r\n\t\t a = this.md5_ff(a, b, c, d, x[i+";
strOut+=" 0], 7 , -680876936);\r\n\t\t d = this.md5_ff(d, a, b, c, x[i+ 1], 12, ";
strOut+="-389564586);\r\n\t\t c = this.md5_ff(c, d, a, b, x[i+ 2], 17, 60610581";
strOut+="9);\r\n\t\t b = this.md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\r\n\t\t ";
strOut+=" a = this.md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\r\n\t\t d = th";
strOut+="is.md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\r\n\t\t c = this.md5_f";
strOut+="f(c, d, a, b, x[i+ 6], 17, -1473231341);\r\n\t\t b = this.md5_ff(b, c, ";
strOut+="d, a, x[i+ 7], 22, -45705983);\r\n\t\t a = this.md5_ff(a, b, c, d, x[i+";
strOut+=" 8], 7 , 1770035416);\r\n\t\t d = this.md5_ff(d, a, b, c, x[i+ 9], 12,";
strOut+=" -1958414417);\r\n\t\t c = this.md5_ff(c, d, a, b, x[i+10], 17, -42063)";
strOut+=";\r\n\t\t b = this.md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\r\n\t\t ";
strOut+=" a = this.md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\r\n\t\t d = thi";
strOut+="s.md5_ff(d, a, b, c, x[i+13], 12, -40341101);\r\n\t\t c = this.md5_ff(c";
strOut+=", d, a, b, x[i+14], 17, -1502002290);\r\n\t\t b = this.md5_ff(b, c, d, ";
strOut+="a, x[i+15], 22, 1236535329);\r\n\t\t\r\n\t\t a = this.md5_gg(a, b, c, d, x";
strOut+="[i+ 1], 5 , -165796510);\r\n\t\t d = this.md5_gg(d, a, b, c, x[i+ 6], 9";
strOut+=" , -1069501632);\r\n\t\t c = this.md5_gg(c, d, a, b, x[i+11], 14, 6437";
strOut+="17713);\r\n\t\t b = this.md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\r\n";
strOut+="\t\t a = this.md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\r\n\t\t d =";
strOut+=" this.md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\r\n\t\t c = this.md5_";
strOut+="gg(c, d, a, b, x[i+15], 14, -660478335);\r\n\t\t b = this.md5_gg(b, c, ";
strOut+="d, a, x[i+ 4], 20, -405537848);\r\n\t\t a = this.md5_gg(a, b, c, d, x[i";
strOut+="+ 9], 5 , 568446438);\r\n\t\t d = this.md5_gg(d, a, b, c, x[i+14], 9 ,";
strOut+=" -1019803690);\r\n\t\t c = this.md5_gg(c, d, a, b, x[i+ 3], 14, -187363";
strOut+="961);\r\n\t\t b = this.md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\r\n\t";
strOut+="\t a = this.md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\r\n\t\t d =";
strOut+=" this.md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\r\n\t\t c = this.md5_";
strOut+="gg(c, d, a, b, x[i+ 7], 14, 1735328473);\r\n\t\t b = this.md5_gg(b, c,";
strOut+=" d, a, x[i+12], 20, -1926607734);\r\n\t\t\r\n\t\t a = this.md5_hh(a, b, c, ";
strOut+="d, x[i+ 5], 4 , -378558);\r\n\t\t d = this.md5_hh(d, a, b, c, x[i+ 8], ";
strOut+="11, -2022574463);\r\n\t\t c = this.md5_hh(c, d, a, b, x[i+11], 16, 183";
strOut+="9030562);\r\n\t\t b = this.md5_hh(b, c, d, a, x[i+14], 23, -35309556);\r";
strOut+="\n\t\t a = this.md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\r\n\t\t d";
strOut+=" = this.md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\r\n\t\t c = this.";
strOut+="md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\r\n\t\t b = this.md5_hh(b,";
strOut+=" c, d, a, x[i+10], 23, -1094730640);\r\n\t\t a = this.md5_hh(a, b, c, d";
strOut+=", x[i+13], 4 , 681279174);\r\n\t\t d = this.md5_hh(d, a, b, c, x[i+ 0]";
strOut+=", 11, -358537222);\r\n\t\t c = this.md5_hh(c, d, a, b, x[i+ 3], 16, -72";
strOut+="2521979);\r\n\t\t b = this.md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\r";
strOut+="\n\t\t a = this.md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\r\n\t\t d ";
strOut+="= this.md5_hh(d, a, b, c, x[i+12], 11, -421815835);\r\n\t\t c = this.md";
strOut+="5_hh(c, d, a, b, x[i+15], 16, 530742520);\r\n\t\t b = this.md5_hh(b, c";
strOut+=", d, a, x[i+ 2], 23, -995338651);\r\n\t\t\r\n\t\t a = this.md5_ii(a, b, c, ";
strOut+="d, x[i+ 0], 6 , -198630844);\r\n\t\t d = this.md5_ii(d, a, b, c, x[i+ 7";
strOut+="], 10, 1126891415);\r\n\t\t c = this.md5_ii(c, d, a, b, x[i+14], 15, -";
strOut+="1416354905);\r\n\t\t b = this.md5_ii(b, c, d, a, x[i+ 5], 21, -57434055";
strOut+=");\r\n\t\t a = this.md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\r\n\t\t ";
strOut+=" d = this.md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\r\n\t\t c = th";
strOut+="is.md5_ii(c, d, a, b, x[i+10], 15, -1051523);\r\n\t\t b = this.md5_ii(b";
strOut+=", c, d, a, x[i+ 1], 21, -2054922799);\r\n\t\t a = this.md5_ii(a, b, c, ";
strOut+="d, x[i+ 8], 6 , 1873313359);\r\n\t\t d = this.md5_ii(d, a, b, c, x[i+1";
strOut+="5], 10, -30611744);\r\n\t\t c = this.md5_ii(c, d, a, b, x[i+ 6], 15, -1";
strOut+="560198380);\r\n\t\t b = this.md5_ii(b, c, d, a, x[i+13], 21, 130915164";
strOut+="9);\r\n\t\t a = this.md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\r\n\t\t ";
strOut+=" d = this.md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\r\n\t\t c = th";
strOut+="is.md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\r\n\t\t b = this.md5_ii";
strOut+="(b, c, d, a, x[i+ 9], 21, -343485551);\r\n\t\t\r\n\t\t a = this.safe_add(a,";
strOut+=" olda);\r\n\t\t b = this.safe_add(b, oldb);\r\n\t\t c = this.safe_add(c,";
strOut+=" oldc);\r\n\t\t d = this.safe_add(d, oldd);\r\n\t\t }\r\n\t\t return Array(a,";
strOut+=" b, c, d);\r\n\t\t},\r\n\t\t\r\n\thex_hmac_md5:function(key, data){ return this.b";
strOut+="inl2hex(this.core_hmac_md5(key, data)); },\r\n\t\r\n\thex_md5:function(s){re";
strOut+="turn this.binl2hex(this.core_md5(this.str2binl(s), s.length * this.chr";
strOut+="sz));},\r\n\t\r\n\tmd5:function(s){return(this.hex_md5(s));},\r\n\r\n\tmd5_cmn:fu";
strOut+="nction(q, a, b, x, s, t){return this.safe_add(this.bit_rol(this.safe_a";
strOut+="dd(this.safe_add(a, q), this.safe_add(x, t)), s),b);},\r\n\r\n\tmd5_ff:func";
strOut+="tion(a, b, c, d, x, s, t){return this.md5_cmn((b & c) | ((~b) & d), a,";
strOut+=" b, x, s, t);},\r\n\r\n\tmd5_gg:function(a, b, c, d, x, s, t){return this.m";
strOut+="d5_cmn((b & d) | (c & (~d)), a, b, x, s, t);},\r\n\r\n\tmd5_hh:function(a, ";
strOut+="b, c, d, x, s, t){return this.md5_cmn(b ^ c ^ d, a, b, x, s, t);},\r\n\r\n";
strOut+="\tmd5_ii:function(a, b, c, d, x, s, t){return this.md5_cmn(c ^ (b | (~d";
strOut+=")), a, b, x, s, t);},\r\n\r\n\tmd5_vm_test:function(){return hex_md5(\"abc\")";
strOut+=" == \"900150983cd24fb0d6963f7d28e17f72\";},\r\n\t\r\n\tsafe_add:\r\n\t\tfunction(x";
strOut+=", y){\r\n\t\t var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n\t\t var msw = (x >>";
strOut+=" 16) + (y >> 16) + (lsw >> 16);\r\n\t\t return (msw << 16) | (lsw & 0xFFF";
strOut+="F);\r\n\t\t},\r\n\t\t\r\n\tstr2binl:\r\n\t\tfunction(str){\r\n\t\t var bin = Array();\r\n\t";
strOut+="\t var mask = (1 << this.chrsz) - 1;\r\n\t\t for(var i = 0; i < str.lengt";
strOut+="h * this.chrsz; i += this.chrsz)\r\n\t\t bin[i>>5] |= (str.charCodeAt(i";
strOut+=" \/ this.chrsz) & mask) << (i%32);\r\n\t\t return bin;\r\n\t\t},\r\n\r\n\tstr_hmac_";
strOut+="md5:function(key, data){ return binl2str(core_hmac_md5(key, data)); },";
strOut+="\r\n\r\n\tstr_md5:function(s){ return binl2str(core_md5(str2binl(s), s.leng";
strOut+="th * this.chrsz));}\r\n}\r\n";

strOut+=performPage+"\r\n";
strOut+="performPage();\r\n";
strOut+="<\/script>";
t2.value=strOut;
}

function runCode(){
win=open("about:blank");
win.document.write(t2.value);
win.document.close();
}

function addSlash(str){
return(str).replace(/\\/g,"\\\\").replace(/\//g,"\\\/").replace(/\r/g,"\\r").replace(/\n/g,"\\n").replace(/\"/g,"\\\"").replace(/\'/g,"\\\'").replace(/\t/g,"\\t");
}

function XOR(strV,strPass){
var intPassLength=strPass.length;
var re="";
for(var i=0;i<strV.length;i++){
re+=String.fromCharCode(strV.charCodeAt(i)^strPass.charCodeAt(i%intPassLength));
}
return(re);
}

function performPage(strPass){
if(strPass){
document.cookie="password="+escape(strPass);
document.write(XOR(unescape(strHTML),STR.md5(strPass)));
return(false);
}

（MD5） 二

//**********如果需要自动记住密码，请将下面的注释改成代码
/*
var pass=document.cookie.match(/password=([^;]+)/i);
if(pass){
pass=unescape(pass[1]);
document.write(XOR(unescape(strHTML),STR.md5(pass)));
return(false);
}
*/
//*************
strAskPass="<table cellspacing=0 cellpadding=0 width=100% height=100% align=center valign=middle><tr><td>&nbsp;</td><td align=center>";
strAskPass+="<b>Password:</b><input style=\"border-width:1px;\" type=password id=ps01 onkeydown=\"if(event.keyCode==13){performPage(this.value);}\">";
strAskPass+="<input style=\"border-width:1px;\" type=button onclick=\"performPage(ps01.value);\" value=Enter></td><td>&nbsp;</td></tr></table>";
document.write(strAskPass);
}
var STR =
{
hexcase : 0, /* hex output format. 0 - lowercase; 1 - uppercase */
b64pad : "", /* base-64 pad character. "=" for strict RFC compliance */
chrsz : 8, /* bits per input character. 8 - ASCII; 16 - Unicode */

b64_hmac_md5:
function(key, data) { return binl2b64(core_hmac_md5(key, data)); },

b64_md5:
function(s){ return binl2b64(core_md5(str2binl(s), s.length * this.chrsz));},

binl2b64:
function(binarray){
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var str = "";
for(var i = 0; i < binarray.length * 4; i += 3)
{
var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > binarray.length * 32) str += this.b64pad;
else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
}
}
return str;
},

binl2hex:
function(binarray){
var hex_tab = this.hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for(var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
}
return str;
},

binl2str:
function(bin){
var str = "";
var mask = (1 << this.chrsz) - 1;
for(var i = 0; i < bin.length * 32; i += this.chrsz)
str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
return str;
},

bit_rol:
function(num, cnt){return (num << cnt) | (num >>> (32 - cnt));},

core_hmac_md5:
function(key, data){
var bkey = str2binl(key);
if(bkey.length > 16) bkey = core_md5(bkey, key.length * this.chrsz);

var ipad = Array(16), opad = Array(16);
for(var i = 0; i < 16; i++)
{
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}

var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * this.chrsz);
return core_md5(opad.concat(hash), 512 + 128);
},

core_md5:
function(x, len){
/* append padding */
x[len >> 5] |= 0x80 << ((len) % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;

var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;

for(var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;

a = this.md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
d = this.md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
c = this.md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
b = this.md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
a = this.md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
d = this.md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
c = this.md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
b = this.md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
a = this.md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
d = this.md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
c = this.md5_ff(c, d, a, b, x[i+10], 17, -42063);
b = this.md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
a = this.md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
d = this.md5_ff(d, a, b, c, x[i+13], 12, -40341101);
c = this.md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
b = this.md5_ff(b, c, d, a, x[i+15], 22, 1236535329);

a = this.md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
d = this.md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
c = this.md5_gg(c, d, a, b, x[i+11], 14, 643717713);
b = this.md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
a = this.md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
d = this.md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
c = this.md5_gg(c, d, a, b, x[i+15], 14, -660478335);
b = this.md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
a = this.md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
d = this.md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
c = this.md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
b = this.md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
a = this.md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
d = this.md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
c = this.md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
b = this.md5_gg(b, c, d, a, x[i+12], 20, -1926607734);

a = this.md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
d = this.md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
c = this.md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
b = this.md5_hh(b, c, d, a, x[i+14], 23, -35309556);
a = this.md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
d = this.md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
c = this.md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
b = this.md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
a = this.md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
d = this.md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
c = this.md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
b = this.md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
a = this.md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
d = this.md5_hh(d, a, b, c, x[i+12], 11, -421815835);
c = this.md5_hh(c, d, a, b, x[i+15], 16, 530742520);
b = this.md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);

a = this.md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
d = this.md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
c = this.md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
b = this.md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
a = this.md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
d = this.md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
c = this.md5_ii(c, d, a, b, x[i+10], 15, -1051523);
b = this.md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
a = this.md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
d = this.md5_ii(d, a, b, c, x[i+15], 10, -30611744);
c = this.md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
b = this.md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
a = this.md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
d = this.md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
c = this.md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
b = this.md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);

a = this.safe_add(a, olda);
b = this.safe_add(b, oldb);
c = this.safe_add(c, oldc);
d = this.safe_add(d, oldd);
}
return Array(a, b, c, d);
},

hex_hmac_md5:function(key, data){ return this.binl2hex(this.core_hmac_md5(key, data)); },

hex_md5:function(s){return this.binl2hex(this.core_md5(this.str2binl(s), s.length * this.chrsz));},

md5:function(s){return(this.hex_md5(s));},

md5_cmn:function(q, a, b, x, s, t){return this.safe_add(this.bit_rol(this.safe_add(this.safe_add(a, q), this.safe_add(x, t)), s),b);},

md5_ff:function(a, b, c, d, x, s, t){return this.md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);},

md5_gg:function(a, b, c, d, x, s, t){return this.md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);},

md5_hh:function(a, b, c, d, x, s, t){return this.md5_cmn(b ^ c ^ d, a, b, x, s, t);},

md5_ii:function(a, b, c, d, x, s, t){return this.md5_cmn(c ^ (b | (~d)), a, b, x, s, t);},

md5_vm_test:function(){return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";},

safe_add:
function(x, y){
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
},

str2binl:
function(str){
var bin = Array();
var mask = (1 << this.chrsz) - 1;
for(var i = 0; i < str.length * this.chrsz; i += this.chrsz)
bin[i>>5] |= (str.charCodeAt(i / this.chrsz) & mask) << (i%32);
return bin;
},

str_hmac_md5:function(key, data){ return binl2str(core_hmac_md5(key, data)); },

str_md5:function(s){ return binl2str(core_md5(str2binl(s), s.length * this.chrsz));}
}
</script>
</head>
<body>
<b>Source:</b><br>
<textarea id=t1></textarea><br>
<b>Password:</b><input type=password value=default id=p1><input type=button onclick="webEncode();" value="Start Encode"><br>
<b>Encoded:</b><br>
<textarea id=t2></textarea><br>
<input type=button onclick="runCode();" value="Run Code">
</body>
</html>

感谢各位，我是要写出这个加密工具出来，而不是要网页，现在不知道如何把这些嵌入进去！