对于asp这种古董级的技术，这年头想找一些有用的资料已经不容易了，下面是一些常用的加密算法:
md5 (将以下代码另存为md5.inc)
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356 |
<%Private
Const BITS_TO_A_BYTE = 8Private
Const BYTES_TO_A_WORD = 4Private
Const BITS_TO_A_WORD = 32Private
m_lOnBits(30)Private
m_l2Power(30)Private
Function LShift(lValue, iShiftBits) If
iShiftBits = 0 Then LShift = lValue Exit
Function ElseIf
iShiftBits = 31 Then If
lValue And
1 Then LShift = &H80000000 Else LShift = 0 End
If Exit
Function ElseIf
iShiftBits < 0 Or
iShiftBits > 31 Then Err.Raise 6 End
If If
(lValue And
m_l2Power(31 - iShiftBits)) Then LShift = ((lValue And
m_lOnBits(31 - (iShiftBits + 1))) * m_l2Power(iShiftBits)) Or
&H80000000 Else LShift = ((lValue And
m_lOnBits(31 - iShiftBits)) * m_l2Power(iShiftBits)) End
IfEnd FunctionPrivate
Function RShift(lValue, iShiftBits) If
iShiftBits = 0 Then RShift = lValue Exit
Function ElseIf
iShiftBits = 31 Then If
lValue And
&H80000000 Then RShift = 1 Else RShift = 0 End
If Exit
Function ElseIf
iShiftBits < 0 Or
iShiftBits > 31 Then Err.Raise 6 End
If RShift = (lValue And
&H7FFFFFFE) \ m_l2Power(iShiftBits) If
(lValue And
&H80000000) Then RShift = (RShift Or
(&H40000000 \ m_l2Power(iShiftBits - 1))) End
IfEnd FunctionPrivate
Function RotateLeft(lValue, iShiftBits) RotateLeft = LShift(lValue, iShiftBits) Or
RShift(lValue, (32 - iShiftBits))End FunctionPrivate
Function AddUnsigned(lX, lY) Dim
lX4 Dim
lY4 Dim
lX8 Dim
lY8 Dim
lResult lX8 = lX And
&H80000000 lY8 = lY And
&H80000000 lX4 = lX And
&H40000000 lY4 = lY And
&H40000000 lResult = (lX And
&H3FFFFFFF) + (lY And
&H3FFFFFFF) If
lX4 And
lY4 Then lResult = lResult Xor
&H80000000 Xor
lX8 Xor
lY8 ElseIf
lX4 Or
lY4 Then If
lResult And
&H40000000 Then lResult = lResult Xor
&HC0000000 Xor
lX8 Xor
lY8 Else lResult = lResult Xor
&H40000000 Xor
lX8 Xor
lY8 End
If Else lResult = lResult Xor
lX8 Xor
lY8 End
If AddUnsigned = lResultEnd FunctionPrivate
Function md5_F(x, y, z) md5_F = (x And
y) Or ((Not x) And
z)End FunctionPrivate
Function md5_G(x, y, z) md5_G = (x And
z) Or (y And
(Not z))End FunctionPrivate
Function md5_H(x, y, z) md5_H = (x Xor
y Xor z)End FunctionPrivate
Function md5_I(x, y, z) md5_I = (y Xor
(x Or (Not z)))End
FunctionPrivate
Sub md5_FF(a, b, c, d, x, s, ac) a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_F(b, c, d), x), ac)) a = RotateLeft(a, s) a = AddUnsigned(a, b)End
SubPrivate
Sub md5_GG(a, b, c, d, x, s, ac) a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_G(b, c, d), x), ac)) a = RotateLeft(a, s) a = AddUnsigned(a, b)End
SubPrivate
Sub md5_HH(a, b, c, d, x, s, ac) a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_H(b, c, d), x), ac)) a = RotateLeft(a, s) a = AddUnsigned(a, b)End
SubPrivate
Sub md5_II(a, b, c, d, x, s, ac) a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_I(b, c, d), x), ac)) a = RotateLeft(a, s) a = AddUnsigned(a, b)End
SubPrivate
Function ConvertToWordArray(sMessage) Dim
lMessageLength Dim
lNumberOfWords Dim
lWordArray() Dim
lBytePosition Dim
lByteCount Dim
lWordCount Const
MODULUS_BITS = 512 Const
CONGRUENT_BITS = 448 lMessageLength = Len(sMessage) lNumberOfWords = (((lMessageLength + ((MODULUS_BITS - CONGRUENT_BITS) \ BITS_TO_A_BYTE)) \ (MODULUS_BITS \ BITS_TO_A_BYTE)) + 1) * (MODULUS_BITS \ BITS_TO_A_WORD) ReDim
lWordArray(lNumberOfWords - 1) lBytePosition = 0 lByteCount = 0 Do
Until lByteCount >= lMessageLength lWordCount = lByteCount \ BYTES_TO_A_WORD lBytePosition = (lByteCount Mod
BYTES_TO_A_WORD) * BITS_TO_A_BYTE lWordArray(lWordCount) = lWordArray(lWordCount) Or
LShift(Asc(Mid(sMessage, lByteCount + 1, 1)), lBytePosition) lByteCount = lByteCount + 1 Loop lWordCount = lByteCount \ BYTES_TO_A_WORD lBytePosition = (lByteCount Mod
BYTES_TO_A_WORD) * BITS_TO_A_BYTE lWordArray(lWordCount) = lWordArray(lWordCount) Or
LShift(&H80, lBytePosition) lWordArray(lNumberOfWords - 2) = LShift(lMessageLength, 3) lWordArray(lNumberOfWords - 1) = RShift(lMessageLength, 29) ConvertToWordArray = lWordArrayEnd
FunctionPrivate
Function WordToHex(lValue) Dim
lByte Dim
lCount For
lCount = 0 To
3 lByte = RShift(lValue, lCount * BITS_TO_A_BYTE) And
m_lOnBits(BITS_TO_A_BYTE - 1) WordToHex = WordToHex & Right("0"
& Hex(lByte), 2) NextEnd
FunctionPublic
Function MD5(sMessage) m_lOnBits(0) = CLng(1) m_lOnBits(1) = CLng(3) m_lOnBits(2) = CLng(7) m_lOnBits(3) = CLng(15) m_lOnBits(4) = CLng(31) m_lOnBits(5) = CLng(63) m_lOnBits(6) = CLng(127) m_lOnBits(7) = CLng(255) m_lOnBits(8) = CLng(511) m_lOnBits(9) = CLng(1023) m_lOnBits(10) = CLng(2047) m_lOnBits(11) = CLng(4095) m_lOnBits(12) = CLng(8191) m_lOnBits(13) = CLng(16383) m_lOnBits(14) = CLng(32767) m_lOnBits(15) = CLng(65535) m_lOnBits(16) = CLng(131071) m_lOnBits(17) = CLng(262143) m_lOnBits(18) = CLng(524287) m_lOnBits(19) = CLng(1048575) m_lOnBits(20) = CLng(2097151) m_lOnBits(21) = CLng(4194303) m_lOnBits(22) = CLng(8388607) m_lOnBits(23) = CLng(16777215) m_lOnBits(24) = CLng(33554431) m_lOnBits(25) = CLng(67108863) m_lOnBits(26) = CLng(134217727) m_lOnBits(27) = CLng(268435455) m_lOnBits(28) = CLng(536870911) m_lOnBits(29) = CLng(1073741823) m_lOnBits(30) = CLng(2147483647) m_l2Power(0) = CLng(1) m_l2Power(1) = CLng(2) m_l2Power(2) = CLng(4) m_l2Power(3) = CLng(8) m_l2Power(4) = CLng(16) m_l2Power(5) = CLng(32) m_l2Power(6) = CLng(64) m_l2Power(7) = CLng(128) m_l2Power(8) = CLng(256) m_l2Power(9) = CLng(512) m_l2Power(10) = CLng(1024) m_l2Power(11) = CLng(2048) m_l2Power(12) = CLng(4096) m_l2Power(13) = CLng(8192) m_l2Power(14) = CLng(16384) m_l2Power(15) = CLng(32768) m_l2Power(16) = CLng(65536) m_l2Power(17) = CLng(131072) m_l2Power(18) = CLng(262144) m_l2Power(19) = CLng(524288) m_l2Power(20) = CLng(1048576) m_l2Power(21) = CLng(2097152) m_l2Power(22) = CLng(4194304) m_l2Power(23) = CLng(8388608) m_l2Power(24) = CLng(16777216) m_l2Power(25) = CLng(33554432) m_l2Power(26) = CLng(67108864) m_l2Power(27) = CLng(134217728) m_l2Power(28) = CLng(268435456) m_l2Power(29) = CLng(536870912) m_l2Power(30) = CLng(1073741824) Dim
x Dim
k Dim
AA Dim
BB Dim
CC Dim
DD Dim
a Dim
b Dim
c Dim
d Const
S11 = 7 Const
S12 = 12 Const
S13 = 17 Const
S14 = 22 Const
S21 = 5 Const
S22 = 9 Const
S23 = 14 Const
S24 = 20 Const
S31 = 4 Const
S32 = 11 Const
S33 = 16 Const
S34 = 23 Const
S41 = 6 Const
S42 = 10 Const
S43 = 15 Const
S44 = 21 x = ConvertToWordArray(sMessage) a = &H67452301 b = &HEFCDAB89 c = &H98BADCFE d = &H10325476 For
k = 0 To
UBound(x) Step
16 AA = a BB = b CC = c DD = d md5_FF a, b, c, d, x(k + 0), S11, &HD76AA478 md5_FF d, a, b, c, x(k + 1), S12, &HE8C7B756 md5_FF c, d, a, b, x(k + 2), S13, &H242070DB md5_FF b, c, d, a, x(k + 3), S14, &HC1BDCEEE md5_FF a, b, c, d, x(k + 4), S11, &HF57C0FAF md5_FF d, a, b, c, x(k + 5), S12, &H4787C62A md5_FF c, d, a, b, x(k + 6), S13, &HA8304613 md5_FF b, c, d, a, x(k + 7), S14, &HFD469501 md5_FF a, b, c, d, x(k + 8), S11, &H698098D8 md5_FF d, a, b, c, x(k + 9), S12, &H8B44F7AF md5_FF c, d, a, b, x(k + 10), S13, &HFFFF5BB1 md5_FF b, c, d, a, x(k + 11), S14, &H895CD7BE md5_FF a, b, c, d, x(k + 12), S11, &H6B901122 md5_FF d, a, b, c, x(k + 13), S12, &HFD987193 md5_FF c, d, a, b, x(k + 14), S13, &HA679438E md5_FF b, c, d, a, x(k + 15), S14, &H49B40821 md5_GG a, b, c, d, x(k + 1), S21, &HF61E2562 md5_GG d, a, b, c, x(k + 6), S22, &HC040B340 md5_GG c, d, a, b, x(k + 11), S23, &H265E5A51 md5_GG b, c, d, a, x(k + 0), S24, &HE9B6C7AA md5_GG a, b, c, d, x(k + 5), S21, &HD62F105D md5_GG d, a, b, c, x(k + 10), S22, &H2441453 md5_GG c, d, a, b, x(k + 15), S23, &HD8A1E681 md5_GG b, c, d, a, x(k + 4), S24, &HE7D3FBC8 md5_GG a, b, c, d, x(k + 9), S21, &H21E1CDE6 md5_GG d, a, b, c, x(k + 14), S22, &HC33707D6 md5_GG c, d, a, b, x(k + 3), S23, &HF4D50D87 md5_GG b, c, d, a, x(k + 8), S24, &H455A14ED md5_GG a, b, c, d, x(k + 13), S21, &HA9E3E905 md5_GG d, a, b, c, x(k + 2), S22, &HFCEFA3F8 md5_GG c, d, a, b, x(k + 7), S23, &H676F02D9 md5_GG b, c, d, a, x(k + 12), S24, &H8D2A4C8A md5_HH a, b, c, d, x(k + 5), S31, &HFFFA3942 md5_HH d, a, b, c, x(k + 8), S32, &H8771F681 md5_HH c, d, a, b, x(k + 11), S33, &H6D9D6122 md5_HH b, c, d, a, x(k + 14), S34, &HFDE5380C md5_HH a, b, c, d, x(k + 1), S31, &HA4BEEA44 md5_HH d, a, b, c, x(k + 4), S32, &H4BDECFA9 md5_HH c, d, a, b, x(k + 7), S33, &HF6BB4B60 md5_HH b, c, d, a, x(k + 10), S34, &HBEBFBC70 md5_HH a, b, c, d, x(k + 13), S31, &H289B7EC6 md5_HH d, a, b, c, x(k + 0), S32, &HEAA127FA md5_HH c, d, a, b, x(k + 3), S33, &HD4EF3085 md5_HH b, c, d, a, x(k + 6), S34, &H4881D05 md5_HH a, b, c, d, x(k + 9), S31, &HD9D4D039 md5_HH d, a, b, c, x(k + 12), S32, &HE6DB99E5 md5_HH c, d, a, b, x(k + 15), S33, &H1FA27CF8 md5_HH b, c, d, a, x(k + 2), S34, &HC4AC5665 md5_II a, b, c, d, x(k + 0), S41, &HF4292244 md5_II d, a, b, c, x(k + 7), S42, &H432AFF97 md5_II c, d, a, b, x(k + 14), S43, &HAB9423A7 md5_II b, c, d, a, x(k + 5), S44, &HFC93A039 md5_II a, b, c, d, x(k + 12), S41, &H655B59C3 md5_II d, a, b, c, x(k + 3), S42, &H8F0CCC92 md5_II c, d, a, b, x(k + 10), S43, &HFFEFF47D md5_II b, c, d, a, x(k + 1), S44, &H85845DD1 md5_II a, b, c, d, x(k + 8), S41, &H6FA87E4F md5_II d, a, b, c, x(k + 15), S42, &HFE2CE6E0 md5_II c, d, a, b, x(k + 6), S43, &HA3014314 md5_II b, c, d, a, x(k + 13), S44, &H4E0811A1 md5_II a, b, c, d, x(k + 4), S41, &HF7537E82 md5_II d, a, b, c, x(k + 11), S42, &HBD3AF235 md5_II c, d, a, b, x(k + 2), S43, &H2AD7D2BB md5_II b, c, d, a, x(k + 9), S44, &HEB86D391 a = AddUnsigned(a, AA) b = AddUnsigned(b, BB) c = AddUnsigned(c, CC) d = AddUnsigned(d, DD) Next MD5 = LCase(WordToHex(a) & WordToHex(b) & WordToHex(c) & WordToHex(d)) ‘MD5=LCase(WordToHex(b) & WordToHex(c)) End
Function%> |
sha1 (将以下代码另存为hex_sha1_js.inc)
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204 |
<script language="javascript"
type="text/javascript"
runat="server">/* * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined * in FIPS PUB 180-1 * Version 2.1a Copyright Paul Johnston 2000 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for details. *//* * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. */var
hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */var
b64pad = "="; /* base-64 pad character. "=" for strict RFC compliance */var
chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode *//* * These are the functions you‘ll usually want to call * They take string arguments and return either hex or base-64 encoded strings */function
hex_sha1(s){return
binb2hex(core_sha1(str2binb(s),s.length * chrsz));}function
b64_sha1(s){return
binb2b64(core_sha1(str2binb(s),s.length * chrsz));}function
str_sha1(s){return
binb2str(core_sha1(str2binb(s),s.length * chrsz));}function
hex_hmac_sha1(key, data){ return
binb2hex(core_hmac_sha1(key, data));}function
b64_hmac_sha1(key, data){ return
binb2b64(core_hmac_sha1(key, data));}function
str_hmac_sha1(key, data){ return
binb2str(core_hmac_sha1(key, data));}/* * Perform a simple self-test to see if the VM is working */function
sha1_vm_test(){ return
hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";}/* * Calculate the SHA-1 of an array of big-endian words, and a bit length */function
core_sha1(x, len){ /* append padding */ x[len >> 5] |= 0x80 << (24 - len % 32); x[((len + 64 >> 9) << 4) + 15] = len; var
w = Array(80); var
a = 1732584193; var
b = -271733879; var
c = -1732584194; var
d = 271733878; var
e = -1009589776; for(var
i = 0; i < x.length; i += 16) { var
olda = a; var
oldb = b; var
oldc = c; var
oldd = d; var
olde = e; for(var
j = 0; j < 80; j++) { if(j < 16) w[j] = x[i + j]; else
w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); var
t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j))); e = d; d = c; c = rol(b, 30); b = a; a = t; } a = safe_add(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd); e = safe_add(e, olde); } return
Array(a, b, c, d, e);}/* * Perform the appropriate triplet combination function for the current * iteration */function
sha1_ft(t, b, c, d){ if(t < 20) return
(b & c) | ((~b) & d); if(t < 40) return
b ^ c ^ d; if(t < 60) return
(b & c) | (b & d) | (c & d); return
b ^ c ^ d;}/* * Determine the appropriate additive constant for the current iteration */function
sha1_kt(t){ return
(t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514;}/* * Calculate the HMAC-SHA1 of a key and some data */function
core_hmac_sha1(key, data){ var
bkey = str2binb(key); if(bkey.length > 16) bkey = core_sha1(bkey, key.length * 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_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz); return
core_sha1(opad.concat(hash), 512 + 160);}/* * Add integers, wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. */function
safe_add(x, y){ var
lsw = (x & 0xFFFF) + (y & 0xFFFF); var
msw = (x >> 16) + (y >> 16) + (lsw >> 16); return
(msw << 16) | (lsw & 0xFFFF);}/* * Bitwise rotate a 32-bit number to the left. */function
rol(num, cnt){ return
(num << cnt) | (num >>> (32 - cnt));}/* * Convert an 8-bit or 16-bit string to an array of big-endian words * In 8-bit function, characters >255 have their hi-byte silently ignored. */function
str2binb(str){ var
bin = Array(); var
mask = (1 << chrsz) - 1; for(var
i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32); return
bin;}/* * Convert an array of big-endian words to a string */function
binb2str(bin){ var
str = ""; var
mask = (1 << chrsz) - 1; for(var
i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask); return
str;}/* * Convert an array of big-endian words to a hex string. */function
binb2hex(binarray){ var
hex_tab = hexcase ? "0123456789ABCDEF"
: "0123456789abcdef"; var
str = ""; for(var
i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); } return
str;}/* * Convert an array of big-endian words to a base-64 string */function
binb2b64(binarray){ var
tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var
str = ""; for(var
i = 0; i < binarray.length * 4; i += 3) { var
triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16) | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 ) | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF); for(var
j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else
str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); } } return
str;}</script> |
sha256 (将以下代码另存为sha256.inc)
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395 |
<%‘ See the VB6 project that accompanies this sample for full code comments on how‘ it works.‘‘ ASP VBScript code for generating a SHA256 ‘digest‘ or ‘signature‘ of a string. The‘ MD5 algorithm is one of the industry standard methods for generating digital‘ signatures. It is generically known as a digest, digital signature, one-way‘ encryption, hash or checksum algorithm. A common use for SHA256 is for password‘ encryption as it is one-way in nature, that does not mean that your passwords‘ are not free from a dictionary attack. ‘‘ If you are using the routine for passwords, you can make it a little more secure‘ by concatenating some known random characters to the password before you generate‘ the signature and on subsequent tests, so even if a hacker knows you are using‘ SHA-256 for your passwords, the random characters will make it harder to dictionary‘ attack.‘‘ NOTE: Due to the way in which the string is processed the routine assumes a‘ single byte character set. VB passes unicode (2-byte) character strings, the‘ ConvertToWordArray function uses on the first byte for each character. This‘ has been done this way for ease of use, to make the routine truely portable‘ you could accept a byte array instead, it would then be up to the calling‘ routine to make sure that the byte array is generated from their string in‘ a manner consistent with the string type.‘‘ This is ‘free‘ software with the following restrictions:‘‘ You may not redistribute this code as a ‘sample‘ or ‘demo‘. However, you are free‘ to use the source code in your own code, but you may not claim that you created‘ the sample code. It is expressly forbidden to sell or profit from this source code‘ other than by the knowledge gained or the enhanced value added by your own code.‘‘ Use of this software is also done so at your own risk. The code is supplied as‘ is without warranty or guarantee of any kind.‘‘ Should you wish to commission some derivative work based on this code provided‘ here, or any consultancy work, please do not hesitate to contact us.‘‘ Web Site: http://www.frez.co.uk‘ E-mail: sales@frez.co.ukPrivate
m_lOnBits2(30)Private
m_l2Power2(30)Private
K(63)Private
Const BITS_TO_A_BYTE2 = 8Private
Const BYTES_TO_A_WORD2 = 4Private
Const BITS_TO_A_WORD2 = 32m_lOnBits2(0) = CLng(1)m_lOnBits2(1) = CLng(3)m_lOnBits2(2) = CLng(7)m_lOnBits2(3) = CLng(15)m_lOnBits2(4) = CLng(31)m_lOnBits2(5) = CLng(63)m_lOnBits2(6) = CLng(127)m_lOnBits2(7) = CLng(255)m_lOnBits2(8) = CLng(511)m_lOnBits2(9) = CLng(1023)m_lOnBits2(10) = CLng(2047)m_lOnBits2(11) = CLng(4095)m_lOnBits2(12) = CLng(8191)m_lOnBits2(13) = CLng(16383)m_lOnBits2(14) = CLng(32767)m_lOnBits2(15) = CLng(65535)m_lOnBits2(16) = CLng(131071)m_lOnBits2(17) = CLng(262143)m_lOnBits2(18) = CLng(524287)m_lOnBits2(19) = CLng(1048575)m_lOnBits2(20) = CLng(2097151)m_lOnBits2(21) = CLng(4194303)m_lOnBits2(22) = CLng(8388607)m_lOnBits2(23) = CLng(16777215)m_lOnBits2(24) = CLng(33554431)m_lOnBits2(25) = CLng(67108863)m_lOnBits2(26) = CLng(134217727)m_lOnBits2(27) = CLng(268435455)m_lOnBits2(28) = CLng(536870911)m_lOnBits2(29) = CLng(1073741823)m_lOnBits2(30) = CLng(2147483647)m_l2Power2(0) = CLng(1)m_l2Power2(1) = CLng(2)m_l2Power2(2) = CLng(4)m_l2Power2(3) = CLng(8)m_l2Power2(4) = CLng(16)m_l2Power2(5) = CLng(32)m_l2Power2(6) = CLng(64)m_l2Power2(7) = CLng(128)m_l2Power2(8) = CLng(256)m_l2Power2(9) = CLng(512)m_l2Power2(10) = CLng(1024)m_l2Power2(11) = CLng(2048)m_l2Power2(12) = CLng(4096)m_l2Power2(13) = CLng(8192)m_l2Power2(14) = CLng(16384)m_l2Power2(15) = CLng(32768)m_l2Power2(16) = CLng(65536)m_l2Power2(17) = CLng(131072)m_l2Power2(18) = CLng(262144)m_l2Power2(19) = CLng(524288)m_l2Power2(20) = CLng(1048576)m_l2Power2(21) = CLng(2097152)m_l2Power2(22) = CLng(4194304)m_l2Power2(23) = CLng(8388608)m_l2Power2(24) = CLng(16777216)m_l2Power2(25) = CLng(33554432)m_l2Power2(26) = CLng(67108864)m_l2Power2(27) = CLng(134217728)m_l2Power2(28) = CLng(268435456)m_l2Power2(29) = CLng(536870912)m_l2Power2(30) = CLng(1073741824) K(0) = &H428A2F98K(1) = &H71374491K(2) = &HB5C0FBCFK(3) = &HE9B5DBA5K(4) = &H3956C25BK(5) = &H59F111F1K(6) = &H923F82A4K(7) = &HAB1C5ED5K(8) = &HD807AA98K(9) = &H12835B01K(10) = &H243185BEK(11) = &H550C7DC3K(12) = &H72BE5D74K(13) = &H80DEB1FEK(14) = &H9BDC06A7K(15) = &HC19BF174K(16) = &HE49B69C1K(17) = &HEFBE4786K(18) = &HFC19DC6K(19) = &H240CA1CCK(20) = &H2DE92C6FK(21) = &H4A7484AAK(22) = &H5CB0A9DCK(23) = &H76F988DAK(24) = &H983E5152K(25) = &HA831C66DK(26) = &HB00327C8K(27) = &HBF597FC7K(28) = &HC6E00BF3K(29) = &HD5A79147K(30) = &H6CA6351K(31) = &H14292967K(32) = &H27B70A85K(33) = &H2E1B2138K(34) = &H4D2C6DFCK(35) = &H53380D13K(36) = &H650A7354K(37) = &H766A0ABBK(38) = &H81C2C92EK(39) = &H92722C85K(40) = &HA2BFE8A1K(41) = &HA81A664BK(42) = &HC24B8B70K(43) = &HC76C51A3K(44) = &HD192E819K(45) = &HD6990624K(46) = &HF40E3585K(47) = &H106AA070K(48) = &H19A4C116K(49) = &H1E376C08K(50) = &H2748774CK(51) = &H34B0BCB5K(52) = &H391C0CB3K(53) = &H4ED8AA4AK(54) = &H5B9CCA4FK(55) = &H682E6FF3K(56) = &H748F82EEK(57) = &H78A5636FK(58) = &H84C87814K(59) = &H8CC70208K(60) = &H90BEFFFAK(61) = &HA4506CEBK(62) = &HBEF9A3F7K(63) = &HC67178F2Private
Function LShift(lValue, iShiftBits) If
iShiftBits = 0 Then LShift = lValue Exit
Function ElseIf
iShiftBits = 31 Then If
lValue And
1 Then LShift = &H80000000 Else LShift = 0 End
If Exit
Function ElseIf
iShiftBits < 0 Or
iShiftBits > 31 Then Err.Raise 6 End
If If
(lValue And
m_l2Power2(31 - iShiftBits)) Then LShift = ((lValue And
m_lOnBits2(31 - (iShiftBits + 1))) * m_l2Power2(iShiftBits)) Or
&H80000000 Else LShift = ((lValue And
m_lOnBits2(31 - iShiftBits)) * m_l2Power2(iShiftBits)) End
IfEnd
FunctionPrivate
Function RShift(lValue, iShiftBits) If
iShiftBits = 0 Then RShift = lValue Exit
Function ElseIf
iShiftBits = 31 Then If
lValue And
&H80000000 Then RShift = 1 Else RShift = 0 End
If Exit
Function ElseIf
iShiftBits < 0 Or
iShiftBits > 31 Then Err.Raise 6 End
If RShift = (lValue And
&H7FFFFFFE) \ m_l2Power2(iShiftBits) If
(lValue And
&H80000000) Then RShift = (RShift Or
(&H40000000 \ m_l2Power2(iShiftBits - 1))) End
IfEnd
FunctionPrivate
Function AddUnsigned(lX, lY) Dim
lX4 Dim
lY4 Dim
lX8 Dim
lY8 Dim
lResult lX8 = lX And
&H80000000 lY8 = lY And
&H80000000 lX4 = lX And
&H40000000 lY4 = lY And
&H40000000 lResult = (lX And
&H3FFFFFFF) + (lY And
&H3FFFFFFF) If
lX4 And
lY4 Then lResult = lResult Xor
&H80000000 Xor
lX8 Xor
lY8 ElseIf
lX4 Or
lY4 Then If
lResult And
&H40000000 Then lResult = lResult Xor
&HC0000000 Xor
lX8 Xor
lY8 Else lResult = lResult Xor
&H40000000 Xor
lX8 Xor
lY8 End
If Else lResult = lResult Xor
lX8 Xor
lY8 End
If AddUnsigned = lResultEnd
FunctionPrivate
Function Ch(x, y, z) Ch = ((x And
y) Xor
((Not x) And
z))End
FunctionPrivate
Function Maj(x, y, z) Maj = ((x And
y) Xor
(x And
z) Xor
(y And
z))End
FunctionPrivate
Function S(x, n) S = (RShift(x, (n And
m_lOnBits2(4))) Or
LShift(x, (32 - (n And
m_lOnBits2(4)))))End
FunctionPrivate
Function R(x, n) R = RShift(x, CInt(n And
m_lOnBits2(4)))End
FunctionPrivate
Function Sigma0(x) Sigma0 = (S(x, 2) Xor
S(x, 13) Xor
S(x, 22))End
FunctionPrivate
Function Sigma1(x) Sigma1 = (S(x, 6) Xor
S(x, 11) Xor
S(x, 25))End
FunctionPrivate
Function Gamma0(x) Gamma0 = (S(x, 7) Xor
S(x, 18) Xor
R(x, 3))End
FunctionPrivate
Function Gamma1(x) Gamma1 = (S(x, 17) Xor
S(x, 19) Xor
R(x, 10))End
FunctionPrivate
Function ConvertToWordArray(sMessage) Dim
lMessageLength Dim
lNumberOfWords Dim
lWordArray() Dim
lBytePosition Dim
lByteCount Dim
lWordCount Dim
lByte Const
MODULUS_BITS = 512 Const
CONGRUENT_BITS = 448 lMessageLength = Len(sMessage) lNumberOfWords = (((lMessageLength + ((MODULUS_BITS - CONGRUENT_BITS) \ BITS_TO_A_BYTE2)) \ (MODULUS_BITS \ BITS_TO_A_BYTE2)) + 1) * (MODULUS_BITS \ BITS_TO_A_WORD2) ReDim
lWordArray(lNumberOfWords - 1) lBytePosition = 0 lByteCount = 0 Do
Until lByteCount >= lMessageLength lWordCount = lByteCount \ BYTES_TO_A_WORD2 lBytePosition = (3 - (lByteCount Mod
BYTES_TO_A_WORD2)) * BITS_TO_A_BYTE2 lByte = AscB(Mid(sMessage, lByteCount + 1, 1)) lWordArray(lWordCount) = lWordArray(lWordCount) Or
LShift(lByte, lBytePosition) lByteCount = lByteCount + 1 Loop lWordCount = lByteCount \ BYTES_TO_A_WORD2 lBytePosition = (3 - (lByteCount Mod
BYTES_TO_A_WORD2)) * BITS_TO_A_BYTE2 lWordArray(lWordCount) = lWordArray(lWordCount) Or
LShift(&H80, lBytePosition) lWordArray(lNumberOfWords - 1) = LShift(lMessageLength, 3) lWordArray(lNumberOfWords - 2) = RShift(lMessageLength, 29) ConvertToWordArray = lWordArrayEnd
FunctionPublic
Function SHA256(sMessage) Dim
HASH(7) Dim
M Dim
W(63) Dim
a Dim
b Dim
c Dim
d Dim
e Dim
f Dim
g Dim
h Dim
i Dim
j Dim
T1 Dim
T2 HASH(0) = &H6A09E667 HASH(1) = &HBB67AE85 HASH(2) = &H3C6EF372 HASH(3) = &HA54FF53A HASH(4) = &H510E527F HASH(5) = &H9B05688C HASH(6) = &H1F83D9AB HASH(7) = &H5BE0CD19 M = ConvertToWordArray(sMessage) For
i = 0 To
UBound(M) Step
16 a = HASH(0) b = HASH(1) c = HASH(2) d = HASH(3) e = HASH(4) f = HASH(5) g = HASH(6) h = HASH(7) For
j = 0 To
63 If
j < 16 Then W(j) = M(j + i) Else W(j) = AddUnsigned(AddUnsigned(AddUnsigned(Gamma1(W(j - 2)), W(j - 7)), Gamma0(W(j - 15))), W(j - 16)) End
If T1 = AddUnsigned(AddUnsigned(AddUnsigned(AddUnsigned(h, Sigma1(e)), Ch(e, f, g)), K(j)), W(j)) T2 = AddUnsigned(Sigma0(a), Maj(a, b, c)) h = g g = f f = e e = AddUnsigned(d, T1) d = c c = b b = a a = AddUnsigned(T1, T2) Next HASH(0) = AddUnsigned(a, HASH(0)) HASH(1) = AddUnsigned(b, HASH(1)) HASH(2) = AddUnsigned(c, HASH(2)) HASH(3) = AddUnsigned(d, HASH(3)) HASH(4) = AddUnsigned(e, HASH(4)) HASH(5) = AddUnsigned(f, HASH(5)) HASH(6) = AddUnsigned(g, HASH(6)) HASH(7) = AddUnsigned(h, HASH(7)) Next SHA256 = LCase(Right("00000000"
& Hex(HASH(0)), 8) & Right("00000000"
& Hex(HASH(1)), 8) & Right("00000000"
& Hex(HASH(2)), 8) & Right("00000000"
& Hex(HASH(3)), 8) & Right("00000000"
& Hex(HASH(4)), 8) & Right("00000000"
& Hex(HASH(5)), 8) & Right("00000000"
& Hex(HASH(6)), 8) & Right("00000000"
& Hex(HASH(7)), 8))End
Function%> |
使用示例：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15 |
<!-- #include file="md5.inc"
--><!-- #include file="hex_sha1_js.inc"
--><!-- #include file="sha256.inc"
--><title>encode</title><%Dim salt salt = "infosky"Dim param param = "abc"Response.Write "salt="
& salt & "<br/>"Response.Write "encode("""
& param & """)="
& md5(hex_sha1(param)&"*"&salt) & "<br/>"Response.Write "md5("""
& param & """)="
& md5(param) & "<br/>"Response.Write "sha1("""
& param & """)="
& hex_sha1(param) & "<br/>"Response.Write "sha256("""
& param & """)="
& sha256(param) & "<br/>"%> |
运行结果：
salt=infosky
encode("abc")=7ba2f8ba443a3fdd10e7fc8841686983
md5("abc")=044bb8c23806270a8b87b5105b182efa
sha1("abc")=a9993e364706816aba3e25717850c26c9cd0d89d
sha256("abc")=ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad
asp中的md5/sha1/sha256算法收集,布布扣,bubuko.com
原文地址：http://www.cnblogs.com/yjmyzz/p/3729612.html
