OLD | NEW |
| (Empty) |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | |
2 // for details. All rights reserved. Use of this source code is governed by a | |
3 // BSD-style license that can be found in the LICENSE file. | |
4 | |
5 part of dart.crypto; | |
6 | |
7 // The MD5 hasher is used to compute an MD5 message digest. | |
8 class _MD5 extends _HashBase implements MD5 { | |
9 _MD5() : super(16, 4, false) { | |
10 _h[0] = 0x67452301; | |
11 _h[1] = 0xefcdab89; | |
12 _h[2] = 0x98badcfe; | |
13 _h[3] = 0x10325476; | |
14 } | |
15 | |
16 // Returns a new instance of this Hash. | |
17 MD5 newInstance() { | |
18 return new MD5(); | |
19 } | |
20 | |
21 static const _k = const [ | |
22 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, | |
23 0xa8304613, 0xfd469501, 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, | |
24 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, 0xf61e2562, 0xc040b340, | |
25 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8, | |
26 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905, 0xfcefa3f8, | |
27 0x676f02d9, 0x8d2a4c8a, 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, | |
28 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, 0x289b7ec6, 0xeaa127fa, | |
29 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, | |
30 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, | |
31 0xffeff47d, 0x85845dd1, 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, | |
32 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 ]; | |
33 | |
34 static const _r = const [ | |
35 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, | |
36 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4, 11, 16, 23, 4, 11, | |
37 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, | |
38 10, 15, 21, 6, 10, 15, 21 ]; | |
39 | |
40 // Compute one iteration of the MD5 algorithm with a chunk of | |
41 // 16 32-bit pieces. | |
42 void _updateHash(List<int> m) { | |
43 assert(m.length == 16); | |
44 | |
45 var a = _h[0]; | |
46 var b = _h[1]; | |
47 var c = _h[2]; | |
48 var d = _h[3]; | |
49 | |
50 var t0; | |
51 var t1; | |
52 | |
53 for (var i = 0; i < 64; i++) { | |
54 if (i < 16) { | |
55 t0 = (b & c) | ((~b & _MASK_32) & d); | |
56 t1 = i; | |
57 } else if (i < 32) { | |
58 t0 = (d & b) | ((~d & _MASK_32) & c); | |
59 t1 = ((5 * i) + 1) % 16; | |
60 } else if (i < 48) { | |
61 t0 = b ^ c ^ d; | |
62 t1 = ((3 * i) + 5) % 16; | |
63 } else { | |
64 t0 = c ^ (b | (~d & _MASK_32)); | |
65 t1 = (7 * i) % 16; | |
66 } | |
67 | |
68 var temp = d; | |
69 d = c; | |
70 c = b; | |
71 b = _add32(b, _rotl32(_add32(_add32(a, t0), | |
72 _add32(_k[i], m[t1])), | |
73 _r[i])); | |
74 a = temp; | |
75 } | |
76 | |
77 _h[0] = _add32(a, _h[0]); | |
78 _h[1] = _add32(b, _h[1]); | |
79 _h[2] = _add32(c, _h[2]); | |
80 _h[3] = _add32(d, _h[3]); | |
81 } | |
82 } | |
OLD | NEW |