source: code/Website/open-flash-chart/com/adobe/crypto/MD5.as

Last change on this file was 7849, checked in by dennisw, 15 years ago
File size: 9.4 KB
RevLine 
[7849]1/*
2Adobe Systems Incorporated(r) Source Code License Agreement
3Copyright(c) 2005 Adobe Systems Incorporated. All rights reserved.
4
5Please read this Source Code License Agreement carefully before using
6the source code.
7
8Adobe Systems Incorporated grants to you a perpetual, worldwide, non-exclusive,
9no-charge, royalty-free, irrevocable copyright license, to reproduce,
10prepare derivative works of, publicly display, publicly perform, and
11distribute this source code and such derivative works in source or
12object code form without any attribution requirements.
13
14The name "Adobe Systems Incorporated" must not be used to endorse or promote products
15derived from the source code without prior written permission.
16
17You agree to indemnify, hold harmless and defend Adobe Systems Incorporated from and
18against any loss, damage, claims or lawsuits, including attorney's
19fees that arise or result from your use or distribution of the source
20code.
21
22THIS SOURCE CODE IS PROVIDED "AS IS" AND "WITH ALL FAULTS", WITHOUT
23ANY TECHNICAL SUPPORT OR ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING,
24BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25FOR A PARTICULAR PURPOSE ARE DISCLAIMED. ALSO, THERE IS NO WARRANTY OF
26NON-INFRINGEMENT, TITLE OR QUIET ENJOYMENT. IN NO EVENT SHALL MACROMEDIA
27OR ITS SUPPLIERS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
28EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
29PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
30OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
31WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
32OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOURCE CODE, EVEN IF
33ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34*/
35
36package com.adobe.crypto {
37
38 import com.adobe.utils.IntUtil;
39
40 /**
41 * The MD5 Message-Digest Algorithm
42 *
43 * Implementation based on algorithm description at
44 * http://www.faqs.org/rfcs/rfc1321.html
45 */
46 public class MD5 {
47
48 /**
49 * Performs the MD5 hash algorithm on a string.
50 *
51 * @param s The string to hash
52 * @return A string containing the hash value of s
53 * @langversion ActionScript 3.0
54 * @playerversion Flash 9.0
55 * @tiptext
56 */
57 public static function hash( s:String ):String {
58 // initialize the md buffers
59 var a:int = 1732584193;
60 var b:int = -271733879;
61 var c:int = -1732584194;
62 var d:int = 271733878;
63
64 // variables to store previous values
65 var aa:int;
66 var bb:int;
67 var cc:int;
68 var dd:int;
69
70 // create the blocks from the string and
71 // save the length as a local var to reduce
72 // lookup in the loop below
73 var x:Array = createBlocks( s );
74 var len:int = x.length;
75
76 // loop over all of the blocks
77 for ( var i:int = 0; i < len; i += 16) {
78 // save previous values
79 aa = a;
80 bb = b;
81 cc = c;
82 dd = d;
83
84 // Round 1
85 a = ff( a, b, c, d, x[i+ 0], 7, -680876936 ); // 1
86 d = ff( d, a, b, c, x[i+ 1], 12, -389564586 ); // 2
87 c = ff( c, d, a, b, x[i+ 2], 17, 606105819 ); // 3
88 b = ff( b, c, d, a, x[i+ 3], 22, -1044525330 ); // 4
89 a = ff( a, b, c, d, x[i+ 4], 7, -176418897 ); // 5
90 d = ff( d, a, b, c, x[i+ 5], 12, 1200080426 ); // 6
91 c = ff( c, d, a, b, x[i+ 6], 17, -1473231341 ); // 7
92 b = ff( b, c, d, a, x[i+ 7], 22, -45705983 ); // 8
93 a = ff( a, b, c, d, x[i+ 8], 7, 1770035416 ); // 9
94 d = ff( d, a, b, c, x[i+ 9], 12, -1958414417 ); // 10
95 c = ff( c, d, a, b, x[i+10], 17, -42063 ); // 11
96 b = ff( b, c, d, a, x[i+11], 22, -1990404162 ); // 12
97 a = ff( a, b, c, d, x[i+12], 7, 1804603682 ); // 13
98 d = ff( d, a, b, c, x[i+13], 12, -40341101 ); // 14
99 c = ff( c, d, a, b, x[i+14], 17, -1502002290 ); // 15
100 b = ff( b, c, d, a, x[i+15], 22, 1236535329 ); // 16
101
102 // Round 2
103 a = gg( a, b, c, d, x[i+ 1], 5, -165796510 ); // 17
104 d = gg( d, a, b, c, x[i+ 6], 9, -1069501632 ); // 18
105 c = gg( c, d, a, b, x[i+11], 14, 643717713 ); // 19
106 b = gg( b, c, d, a, x[i+ 0], 20, -373897302 ); // 20
107 a = gg( a, b, c, d, x[i+ 5], 5, -701558691 ); // 21
108 d = gg( d, a, b, c, x[i+10], 9, 38016083 ); // 22
109 c = gg( c, d, a, b, x[i+15], 14, -660478335 ); // 23
110 b = gg( b, c, d, a, x[i+ 4], 20, -405537848 ); // 24
111 a = gg( a, b, c, d, x[i+ 9], 5, 568446438 ); // 25
112 d = gg( d, a, b, c, x[i+14], 9, -1019803690 ); // 26
113 c = gg( c, d, a, b, x[i+ 3], 14, -187363961 ); // 27
114 b = gg( b, c, d, a, x[i+ 8], 20, 1163531501 ); // 28
115 a = gg( a, b, c, d, x[i+13], 5, -1444681467 ); // 29
116 d = gg( d, a, b, c, x[i+ 2], 9, -51403784 ); // 30
117 c = gg( c, d, a, b, x[i+ 7], 14, 1735328473 ); // 31
118 b = gg( b, c, d, a, x[i+12], 20, -1926607734 ); // 32
119
120 // Round 3
121 a = hh( a, b, c, d, x[i+ 5], 4, -378558 ); // 33
122 d = hh( d, a, b, c, x[i+ 8], 11, -2022574463 ); // 34
123 c = hh( c, d, a, b, x[i+11], 16, 1839030562 ); // 35
124 b = hh( b, c, d, a, x[i+14], 23, -35309556 ); // 36
125 a = hh( a, b, c, d, x[i+ 1], 4, -1530992060 ); // 37
126 d = hh( d, a, b, c, x[i+ 4], 11, 1272893353 ); // 38
127 c = hh( c, d, a, b, x[i+ 7], 16, -155497632 ); // 39
128 b = hh( b, c, d, a, x[i+10], 23, -1094730640 ); // 40
129 a = hh( a, b, c, d, x[i+13], 4, 681279174 ); // 41
130 d = hh( d, a, b, c, x[i+ 0], 11, -358537222 ); // 42
131 c = hh( c, d, a, b, x[i+ 3], 16, -722521979 ); // 43
132 b = hh( b, c, d, a, x[i+ 6], 23, 76029189 ); // 44
133 a = hh( a, b, c, d, x[i+ 9], 4, -640364487 ); // 45
134 d = hh( d, a, b, c, x[i+12], 11, -421815835 ); // 46
135 c = hh( c, d, a, b, x[i+15], 16, 530742520 ); // 47
136 b = hh( b, c, d, a, x[i+ 2], 23, -995338651 ); // 48
137
138 // Round 4
139 a = ii( a, b, c, d, x[i+ 0], 6, -198630844 ); // 49
140 d = ii( d, a, b, c, x[i+ 7], 10, 1126891415 ); // 50
141 c = ii( c, d, a, b, x[i+14], 15, -1416354905 ); // 51
142 b = ii( b, c, d, a, x[i+ 5], 21, -57434055 ); // 52
143 a = ii( a, b, c, d, x[i+12], 6, 1700485571 ); // 53
144 d = ii( d, a, b, c, x[i+ 3], 10, -1894986606 ); // 54
145 c = ii( c, d, a, b, x[i+10], 15, -1051523 ); // 55
146 b = ii( b, c, d, a, x[i+ 1], 21, -2054922799 ); // 56
147 a = ii( a, b, c, d, x[i+ 8], 6, 1873313359 ); // 57
148 d = ii( d, a, b, c, x[i+15], 10, -30611744 ); // 58
149 c = ii( c, d, a, b, x[i+ 6], 15, -1560198380 ); // 59
150 b = ii( b, c, d, a, x[i+13], 21, 1309151649 ); // 60
151 a = ii( a, b, c, d, x[i+ 4], 6, -145523070 ); // 61
152 d = ii( d, a, b, c, x[i+11], 10, -1120210379 ); // 62
153 c = ii( c, d, a, b, x[i+ 2], 15, 718787259 ); // 63
154 b = ii( b, c, d, a, x[i+ 9], 21, -343485551 ); // 64
155
156 a += aa;
157 b += bb;
158 c += cc;
159 d += dd;
160 }
161
162 // Finish up by concatening the buffers with their hex output
163 return IntUtil.toHex( a ) + IntUtil.toHex( b ) + IntUtil.toHex( c ) + IntUtil.toHex( d );
164 }
165
166 /**
167 * Auxiliary function f as defined in RFC
168 */
169 private static function f( x:int, y:int, z:int ):int {
170 return ( x & y ) | ( (~x) & z );
171 }
172
173 /**
174 * Auxiliary function g as defined in RFC
175 */
176 private static function g( x:int, y:int, z:int ):int {
177 return ( x & z ) | ( y & (~z) );
178 }
179
180 /**
181 * Auxiliary function h as defined in RFC
182 */
183 private static function h( x:int, y:int, z:int ):int {
184 return x ^ y ^ z;
185 }
186
187 /**
188 * Auxiliary function i as defined in RFC
189 */
190 private static function i( x:int, y:int, z:int ):int {
191 return y ^ ( x | (~z) );
192 }
193
194 /**
195 * A generic transformation function. The logic of ff, gg, hh, and
196 * ii are all the same, minus the function used, so pull that logic
197 * out and simplify the method bodies for the transoformation functions.
198 */
199 private static function transform( func:Function, a:int, b:int, c:int, d:int, x:int, s:int, t:int):int {
200 var tmp:int = a + int( func( b, c, d ) ) + x + t;
201 return IntUtil.rol( tmp, s ) + b;
202 }
203
204 /**
205 * ff transformation function
206 */
207 private static function ff ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
208 return transform( f, a, b, c, d, x, s, t );
209 }
210
211 /**
212 * gg transformation function
213 */
214 private static function gg ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
215 return transform( g, a, b, c, d, x, s, t );
216 }
217
218 /**
219 * hh transformation function
220 */
221 private static function hh ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
222 return transform( h, a, b, c, d, x, s, t );
223 }
224
225 /**
226 * ii transformation function
227 */
228 private static function ii ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
229 return transform( i, a, b, c, d, x, s, t );
230 }
231
232 /**
233 * Converts a string to a sequence of 16-word blocks
234 * that we'll do the processing on. Appends padding
235 * and length in the process.
236 *
237 * @param s The string to split into blocks
238 * @return An array containing the blocks that s was
239 * split into.
240 */
241 private static function createBlocks( s:String ):Array {
242 var blocks:Array = new Array();
243 var len:int = s.length * 8;
244 var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
245 for( var i:int = 0; i < len; i += 8 ) {
246 blocks[ i >> 5 ] |= ( s.charCodeAt( i / 8 ) & mask ) << ( i % 32 );
247 }
248
249 // append padding and length
250 blocks[ len >> 5 ] |= 0x80 << ( len % 32 );
251 blocks[ ( ( ( len + 64 ) >>> 9 ) << 4 ) + 14 ] = len;
252 return blocks;
253 }
254
255 }
256}
Note: See TracBrowser for help on using the repository browser.