J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright 2005-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 java.security.*; |
| 29 | |
| 30 | import static sun.security.provider.ByteArrayAccess.*; |
| 31 | |
| 32 | /** |
| 33 | * The MD4 class is used to compute an MD4 message digest over a given |
| 34 | * buffer of bytes. It is an implementation of the RSA Data Security Inc |
| 35 | * MD4 algorithim as described in internet RFC 1320. |
| 36 | * |
| 37 | * <p>The MD4 algorithm is very weak and should not be used unless it is |
| 38 | * unavoidable. Therefore, it is not registered in our standard providers. To |
| 39 | * obtain an implementation, call the static getInstance() method in this |
| 40 | * class. |
| 41 | * |
| 42 | * @author Andreas Sterbenz |
| 43 | */ |
| 44 | public final class MD4 extends DigestBase { |
| 45 | |
| 46 | // state of this object |
| 47 | private final int[] state; |
| 48 | // temporary buffer, used by implCompress() |
| 49 | private final int[] x; |
| 50 | |
| 51 | // rotation constants |
| 52 | private static final int S11 = 3; |
| 53 | private static final int S12 = 7; |
| 54 | private static final int S13 = 11; |
| 55 | private static final int S14 = 19; |
| 56 | private static final int S21 = 3; |
| 57 | private static final int S22 = 5; |
| 58 | private static final int S23 = 9; |
| 59 | private static final int S24 = 13; |
| 60 | private static final int S31 = 3; |
| 61 | private static final int S32 = 9; |
| 62 | private static final int S33 = 11; |
| 63 | private static final int S34 = 15; |
| 64 | |
| 65 | private final static Provider md4Provider; |
| 66 | |
| 67 | static { |
| 68 | md4Provider = new Provider("MD4Provider", 1.0d, "MD4 MessageDigest") {}; |
| 69 | AccessController.doPrivileged(new PrivilegedAction<Void>() { |
| 70 | public Void run() { |
| 71 | md4Provider.put("MessageDigest.MD4", "sun.security.provider.MD4"); |
| 72 | return null; |
| 73 | } |
| 74 | }); |
| 75 | } |
| 76 | |
| 77 | public static MessageDigest getInstance() { |
| 78 | try { |
| 79 | return MessageDigest.getInstance("MD4", md4Provider); |
| 80 | } catch (NoSuchAlgorithmException e) { |
| 81 | // should never occur |
| 82 | throw new ProviderException(e); |
| 83 | } |
| 84 | } |
| 85 | |
| 86 | // Standard constructor, creates a new MD4 instance. |
| 87 | public MD4() { |
| 88 | super("MD4", 16, 64); |
| 89 | state = new int[4]; |
| 90 | x = new int[16]; |
| 91 | implReset(); |
| 92 | } |
| 93 | |
| 94 | // Cloning constructor |
| 95 | private MD4(MD4 base) { |
| 96 | super(base); |
| 97 | this.state = base.state.clone(); |
| 98 | this.x = new int[16]; |
| 99 | } |
| 100 | |
| 101 | // clone this object |
| 102 | public Object clone() { |
| 103 | return new MD4(this); |
| 104 | } |
| 105 | |
| 106 | /** |
| 107 | * Reset the state of this object. |
| 108 | */ |
| 109 | void implReset() { |
| 110 | // Load magic initialization constants. |
| 111 | state[0] = 0x67452301; |
| 112 | state[1] = 0xefcdab89; |
| 113 | state[2] = 0x98badcfe; |
| 114 | state[3] = 0x10325476; |
| 115 | } |
| 116 | |
| 117 | /** |
| 118 | * Perform the final computations, any buffered bytes are added |
| 119 | * to the digest, the count is added to the digest, and the resulting |
| 120 | * digest is stored. |
| 121 | */ |
| 122 | void implDigest(byte[] out, int ofs) { |
| 123 | long bitsProcessed = bytesProcessed << 3; |
| 124 | |
| 125 | int index = (int)bytesProcessed & 0x3f; |
| 126 | int padLen = (index < 56) ? (56 - index) : (120 - index); |
| 127 | engineUpdate(padding, 0, padLen); |
| 128 | |
| 129 | i2bLittle4((int)bitsProcessed, buffer, 56); |
| 130 | i2bLittle4((int)(bitsProcessed >>> 32), buffer, 60); |
| 131 | implCompress(buffer, 0); |
| 132 | |
| 133 | i2bLittle(state, 0, out, ofs, 16); |
| 134 | } |
| 135 | |
| 136 | private static int FF(int a, int b, int c, int d, int x, int s) { |
| 137 | a += ((b & c) | ((~b) & d)) + x; |
| 138 | return ((a << s) | (a >>> (32 - s))); |
| 139 | } |
| 140 | |
| 141 | private static int GG(int a, int b, int c, int d, int x, int s) { |
| 142 | a += ((b & c) | (b & d) | (c & d)) + x + 0x5a827999; |
| 143 | return ((a << s) | (a >>> (32 - s))); |
| 144 | } |
| 145 | |
| 146 | private static int HH(int a, int b, int c, int d, int x, int s) { |
| 147 | a += ((b ^ c) ^ d) + x + 0x6ed9eba1; |
| 148 | return ((a << s) | (a >>> (32 - s))); |
| 149 | } |
| 150 | |
| 151 | /** |
| 152 | * This is where the functions come together as the generic MD4 |
| 153 | * transformation operation. It consumes sixteen |
| 154 | * bytes from the buffer, beginning at the specified offset. |
| 155 | */ |
| 156 | void implCompress(byte[] buf, int ofs) { |
| 157 | b2iLittle64(buf, ofs, x); |
| 158 | |
| 159 | int a = state[0]; |
| 160 | int b = state[1]; |
| 161 | int c = state[2]; |
| 162 | int d = state[3]; |
| 163 | |
| 164 | /* Round 1 */ |
| 165 | a = FF (a, b, c, d, x[ 0], S11); /* 1 */ |
| 166 | d = FF (d, a, b, c, x[ 1], S12); /* 2 */ |
| 167 | c = FF (c, d, a, b, x[ 2], S13); /* 3 */ |
| 168 | b = FF (b, c, d, a, x[ 3], S14); /* 4 */ |
| 169 | a = FF (a, b, c, d, x[ 4], S11); /* 5 */ |
| 170 | d = FF (d, a, b, c, x[ 5], S12); /* 6 */ |
| 171 | c = FF (c, d, a, b, x[ 6], S13); /* 7 */ |
| 172 | b = FF (b, c, d, a, x[ 7], S14); /* 8 */ |
| 173 | a = FF (a, b, c, d, x[ 8], S11); /* 9 */ |
| 174 | d = FF (d, a, b, c, x[ 9], S12); /* 10 */ |
| 175 | c = FF (c, d, a, b, x[10], S13); /* 11 */ |
| 176 | b = FF (b, c, d, a, x[11], S14); /* 12 */ |
| 177 | a = FF (a, b, c, d, x[12], S11); /* 13 */ |
| 178 | d = FF (d, a, b, c, x[13], S12); /* 14 */ |
| 179 | c = FF (c, d, a, b, x[14], S13); /* 15 */ |
| 180 | b = FF (b, c, d, a, x[15], S14); /* 16 */ |
| 181 | |
| 182 | /* Round 2 */ |
| 183 | a = GG (a, b, c, d, x[ 0], S21); /* 17 */ |
| 184 | d = GG (d, a, b, c, x[ 4], S22); /* 18 */ |
| 185 | c = GG (c, d, a, b, x[ 8], S23); /* 19 */ |
| 186 | b = GG (b, c, d, a, x[12], S24); /* 20 */ |
| 187 | a = GG (a, b, c, d, x[ 1], S21); /* 21 */ |
| 188 | d = GG (d, a, b, c, x[ 5], S22); /* 22 */ |
| 189 | c = GG (c, d, a, b, x[ 9], S23); /* 23 */ |
| 190 | b = GG (b, c, d, a, x[13], S24); /* 24 */ |
| 191 | a = GG (a, b, c, d, x[ 2], S21); /* 25 */ |
| 192 | d = GG (d, a, b, c, x[ 6], S22); /* 26 */ |
| 193 | c = GG (c, d, a, b, x[10], S23); /* 27 */ |
| 194 | b = GG (b, c, d, a, x[14], S24); /* 28 */ |
| 195 | a = GG (a, b, c, d, x[ 3], S21); /* 29 */ |
| 196 | d = GG (d, a, b, c, x[ 7], S22); /* 30 */ |
| 197 | c = GG (c, d, a, b, x[11], S23); /* 31 */ |
| 198 | b = GG (b, c, d, a, x[15], S24); /* 32 */ |
| 199 | |
| 200 | /* Round 3 */ |
| 201 | a = HH (a, b, c, d, x[ 0], S31); /* 33 */ |
| 202 | d = HH (d, a, b, c, x[ 8], S32); /* 34 */ |
| 203 | c = HH (c, d, a, b, x[ 4], S33); /* 35 */ |
| 204 | b = HH (b, c, d, a, x[12], S34); /* 36 */ |
| 205 | a = HH (a, b, c, d, x[ 2], S31); /* 37 */ |
| 206 | d = HH (d, a, b, c, x[10], S32); /* 38 */ |
| 207 | c = HH (c, d, a, b, x[ 6], S33); /* 39 */ |
| 208 | b = HH (b, c, d, a, x[14], S34); /* 40 */ |
| 209 | a = HH (a, b, c, d, x[ 1], S31); /* 41 */ |
| 210 | d = HH (d, a, b, c, x[ 9], S32); /* 42 */ |
| 211 | c = HH (c, d, a, b, x[ 5], S33); /* 43 */ |
| 212 | b = HH (b, c, d, a, x[13], S34); /* 44 */ |
| 213 | a = HH (a, b, c, d, x[ 3], S31); /* 45 */ |
| 214 | d = HH (d, a, b, c, x[11], S32); /* 46 */ |
| 215 | c = HH (c, d, a, b, x[ 7], S33); /* 47 */ |
| 216 | b = HH (b, c, d, a, x[15], S34); /* 48 */ |
| 217 | |
| 218 | state[0] += a; |
| 219 | state[1] += b; |
| 220 | state[2] += c; |
| 221 | state[3] += d; |
| 222 | } |
| 223 | |
| 224 | } |