J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright 1996-2006 Sun Microsystems, Inc. All Rights Reserved. |
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | * |
| 5 | * This code is free software; you can redistribute it and/or modify it |
| 6 | * under the terms of the GNU General Public License version 2 only, as |
| 7 | * published by the Free Software Foundation. Sun designates this |
| 8 | * particular file as subject to the "Classpath" exception as provided |
| 9 | * by Sun in the LICENSE file that accompanied this code. |
| 10 | * |
| 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 14 | * version 2 for more details (a copy is included in the LICENSE file that |
| 15 | * accompanied this code). |
| 16 | * |
| 17 | * You should have received a copy of the GNU General Public License version |
| 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 20 | * |
| 21 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 22 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| 23 | * have any questions. |
| 24 | */ |
| 25 | |
| 26 | package sun.security.provider; |
| 27 | |
| 28 | import static sun.security.provider.ByteArrayAccess.*; |
| 29 | |
| 30 | /** |
| 31 | * The MD5 class is used to compute an MD5 message digest over a given |
| 32 | * buffer of bytes. It is an implementation of the RSA Data Security Inc |
| 33 | * MD5 algorithim as described in internet RFC 1321. |
| 34 | * |
| 35 | * @author Chuck McManis |
| 36 | * @author Benjamin Renaud |
| 37 | * @author Andreas Sterbenz |
| 38 | */ |
| 39 | public final class MD5 extends DigestBase { |
| 40 | |
| 41 | // state of this object |
| 42 | private final int[] state; |
| 43 | // temporary buffer, used by implCompress() |
| 44 | private final int[] x; |
| 45 | |
| 46 | // rotation constants |
| 47 | private static final int S11 = 7; |
| 48 | private static final int S12 = 12; |
| 49 | private static final int S13 = 17; |
| 50 | private static final int S14 = 22; |
| 51 | private static final int S21 = 5; |
| 52 | private static final int S22 = 9; |
| 53 | private static final int S23 = 14; |
| 54 | private static final int S24 = 20; |
| 55 | private static final int S31 = 4; |
| 56 | private static final int S32 = 11; |
| 57 | private static final int S33 = 16; |
| 58 | private static final int S34 = 23; |
| 59 | private static final int S41 = 6; |
| 60 | private static final int S42 = 10; |
| 61 | private static final int S43 = 15; |
| 62 | private static final int S44 = 21; |
| 63 | |
| 64 | // Standard constructor, creates a new MD5 instance. |
| 65 | public MD5() { |
| 66 | super("MD5", 16, 64); |
| 67 | state = new int[4]; |
| 68 | x = new int[16]; |
| 69 | implReset(); |
| 70 | } |
| 71 | |
| 72 | // Cloning constructor |
| 73 | private MD5(MD5 base) { |
| 74 | super(base); |
| 75 | this.state = base.state.clone(); |
| 76 | this.x = new int[16]; |
| 77 | } |
| 78 | |
| 79 | // clone this object |
| 80 | public Object clone() { |
| 81 | return new MD5(this); |
| 82 | } |
| 83 | |
| 84 | /** |
| 85 | * Reset the state of this object. |
| 86 | */ |
| 87 | void implReset() { |
| 88 | // Load magic initialization constants. |
| 89 | state[0] = 0x67452301; |
| 90 | state[1] = 0xefcdab89; |
| 91 | state[2] = 0x98badcfe; |
| 92 | state[3] = 0x10325476; |
| 93 | } |
| 94 | |
| 95 | /** |
| 96 | * Perform the final computations, any buffered bytes are added |
| 97 | * to the digest, the count is added to the digest, and the resulting |
| 98 | * digest is stored. |
| 99 | */ |
| 100 | void implDigest(byte[] out, int ofs) { |
| 101 | long bitsProcessed = bytesProcessed << 3; |
| 102 | |
| 103 | int index = (int)bytesProcessed & 0x3f; |
| 104 | int padLen = (index < 56) ? (56 - index) : (120 - index); |
| 105 | engineUpdate(padding, 0, padLen); |
| 106 | |
| 107 | i2bLittle4((int)bitsProcessed, buffer, 56); |
| 108 | i2bLittle4((int)(bitsProcessed >>> 32), buffer, 60); |
| 109 | implCompress(buffer, 0); |
| 110 | |
| 111 | i2bLittle(state, 0, out, ofs, 16); |
| 112 | } |
| 113 | |
| 114 | /* ********************************************************** |
| 115 | * The MD5 Functions. The results of this |
| 116 | * implementation were checked against the RSADSI version. |
| 117 | * ********************************************************** |
| 118 | */ |
| 119 | |
| 120 | private static int FF(int a, int b, int c, int d, int x, int s, int ac) { |
| 121 | a += ((b & c) | ((~b) & d)) + x + ac; |
| 122 | return ((a << s) | (a >>> (32 - s))) + b; |
| 123 | } |
| 124 | |
| 125 | private static int GG(int a, int b, int c, int d, int x, int s, int ac) { |
| 126 | a += ((b & d) | (c & (~d))) + x + ac; |
| 127 | return ((a << s) | (a >>> (32 - s))) + b; |
| 128 | } |
| 129 | |
| 130 | private static int HH(int a, int b, int c, int d, int x, int s, int ac) { |
| 131 | a += ((b ^ c) ^ d) + x + ac; |
| 132 | return ((a << s) | (a >>> (32 - s))) + b; |
| 133 | } |
| 134 | |
| 135 | private static int II(int a, int b, int c, int d, int x, int s, int ac) { |
| 136 | a += (c ^ (b | (~d))) + x + ac; |
| 137 | return ((a << s) | (a >>> (32 - s))) + b; |
| 138 | } |
| 139 | |
| 140 | /** |
| 141 | * This is where the functions come together as the generic MD5 |
| 142 | * transformation operation. It consumes sixteen |
| 143 | * bytes from the buffer, beginning at the specified offset. |
| 144 | */ |
| 145 | void implCompress(byte[] buf, int ofs) { |
| 146 | b2iLittle64(buf, ofs, x); |
| 147 | |
| 148 | int a = state[0]; |
| 149 | int b = state[1]; |
| 150 | int c = state[2]; |
| 151 | int d = state[3]; |
| 152 | |
| 153 | /* Round 1 */ |
| 154 | a = FF ( a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ |
| 155 | d = FF ( d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ |
| 156 | c = FF ( c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ |
| 157 | b = FF ( b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ |
| 158 | a = FF ( a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ |
| 159 | d = FF ( d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ |
| 160 | c = FF ( c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ |
| 161 | b = FF ( b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ |
| 162 | a = FF ( a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ |
| 163 | d = FF ( d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ |
| 164 | c = FF ( c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ |
| 165 | b = FF ( b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ |
| 166 | a = FF ( a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ |
| 167 | d = FF ( d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ |
| 168 | c = FF ( c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ |
| 169 | b = FF ( b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ |
| 170 | |
| 171 | /* Round 2 */ |
| 172 | a = GG ( a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ |
| 173 | d = GG ( d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ |
| 174 | c = GG ( c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ |
| 175 | b = GG ( b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ |
| 176 | a = GG ( a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ |
| 177 | d = GG ( d, a, b, c, x[10], S22, 0x2441453); /* 22 */ |
| 178 | c = GG ( c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ |
| 179 | b = GG ( b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ |
| 180 | a = GG ( a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ |
| 181 | d = GG ( d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ |
| 182 | c = GG ( c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ |
| 183 | b = GG ( b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ |
| 184 | a = GG ( a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ |
| 185 | d = GG ( d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ |
| 186 | c = GG ( c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ |
| 187 | b = GG ( b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ |
| 188 | |
| 189 | /* Round 3 */ |
| 190 | a = HH ( a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ |
| 191 | d = HH ( d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ |
| 192 | c = HH ( c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ |
| 193 | b = HH ( b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ |
| 194 | a = HH ( a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ |
| 195 | d = HH ( d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ |
| 196 | c = HH ( c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ |
| 197 | b = HH ( b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ |
| 198 | a = HH ( a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ |
| 199 | d = HH ( d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ |
| 200 | c = HH ( c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ |
| 201 | b = HH ( b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ |
| 202 | a = HH ( a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ |
| 203 | d = HH ( d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ |
| 204 | c = HH ( c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ |
| 205 | b = HH ( b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ |
| 206 | |
| 207 | /* Round 4 */ |
| 208 | a = II ( a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ |
| 209 | d = II ( d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ |
| 210 | c = II ( c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ |
| 211 | b = II ( b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ |
| 212 | a = II ( a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ |
| 213 | d = II ( d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ |
| 214 | c = II ( c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ |
| 215 | b = II ( b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ |
| 216 | a = II ( a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ |
| 217 | d = II ( d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ |
| 218 | c = II ( c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ |
| 219 | b = II ( b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ |
| 220 | a = II ( a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ |
| 221 | d = II ( d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ |
| 222 | c = II ( c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ |
| 223 | b = II ( b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ |
| 224 | |
| 225 | state[0] += a; |
| 226 | state[1] += b; |
| 227 | state[2] += c; |
| 228 | state[3] += d; |
| 229 | } |
| 230 | |
| 231 | } |