001: /*
002: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
003: *
004: * This code is free software; you can redistribute it and/or modify it
005: * under the terms of the GNU General Public License version 2 only, as
006: * published by the Free Software Foundation. Sun designates this
007: * particular file as subject to the "Classpath" exception as provided
008: * by Sun in the LICENSE file that accompanied this code.
009: *
010: * This code is distributed in the hope that it will be useful, but WITHOUT
011: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
012: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
013: * version 2 for more details (a copy is included in the LICENSE file that
014: * accompanied this code).
015: *
016: * You should have received a copy of the GNU General Public License version
017: * 2 along with this work; if not, write to the Free Software Foundation,
018: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
019: *
020: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
021: * CA 95054 USA or visit www.sun.com if you need additional information or
022: * have any questions.
023: */
024:
025: /*
026: * (C) Copyright IBM Corp. 1999 All Rights Reserved.
027: * Copyright 1997 The Open Group Research Institute. All rights reserved.
028: */
029: // crc32.java
030: package sun.security.krb5.internal.crypto;
031:
032: import java.security.MessageDigestSpi;
033: import java.security.DigestException;
034:
035: public final class crc32 extends MessageDigestSpi implements Cloneable {
036: private static final int CRC32_LENGTH = 4; //32-bit
037: private int seed;
038: private static boolean DEBUG = sun.security.krb5.internal.Krb5.DEBUG;
039:
040: // buffer;
041: // private int bufferIndex, bufferLeft;
042:
043: public crc32() {
044: init();
045: }
046:
047: public Object clone() {
048: try {
049: crc32 crc = (crc32) super .clone();
050: crc.init();
051: return crc;
052: } catch (CloneNotSupportedException e) {
053: }
054: return null;
055: }
056:
057: /**
058: * Return the digest length in bytes
059: */
060: protected int engineGetDigestLength() {
061: return (CRC32_LENGTH);
062: }
063:
064: /**
065: */
066: protected byte[] engineDigest() {
067: byte[] result = new byte[CRC32_LENGTH];
068: result = int2quad(seed);
069: //processBuffer(buffer, 0, bufferIndex, result, 0);
070: init();
071: return result;
072: }
073:
074: /**
075: */
076: protected int engineDigest(byte[] buf, int offset, int len)
077: throws DigestException {
078: byte[] result = new byte[CRC32_LENGTH];
079: result = int2quad(seed);
080: if (len < CRC32_LENGTH) {
081: throw new DigestException("partial digests not returned");
082: }
083: if (buf.length - offset < CRC32_LENGTH) {
084: throw new DigestException(
085: "insufficient space in the output "
086: + "buffer to store the digest");
087: }
088: System.arraycopy(result, 0, buf, offset, CRC32_LENGTH);
089: //processBuffer(buffer, 0, bufferIndex, result, 0);
090: /*if (len < CRC32_LENGTH) {
091: throw new DigestException("partial digests not returned");
092: }
093: if (buf.length - offset < CRC32_LENGTH) {
094: throw new DigestException("insufficient space in the output " +
095: "buffer to store the digest");
096: }
097: System.arraycopy(result, 0, buf, offset, CRC32_LENGTH); */
098: init();
099: return CRC32_LENGTH;
100: }
101:
102: /**
103: * Update adds the passed byte to the digested data.
104: */
105: protected synchronized void engineUpdate(byte b) {
106: byte[] input = new byte[1];
107: input[0] = b;
108: //engineUpdate(input, 0, 1);
109: engineUpdate(input, seed, 1);
110: }
111:
112: /**
113: * Update adds the selected part of an array of bytes to the digest.
114: * This version is more efficient than the byte-at-a-time version;
115: * it avoids data copies and reduces per-byte call overhead.
116: */
117: protected synchronized void engineUpdate(byte input[], int offset,
118: int len) {
119: processData(input, offset, len);
120: }
121:
122: private static int[] crc32Table = { 0x00000000, 0x77073096,
123: 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f, 0xe963a535,
124: 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
125: 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064,
126: 0x6ab020f2, 0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb,
127: 0xf4d4b551, 0x83d385c7, 0x136c9856, 0x646ba8c0, 0xfd62f97a,
128: 0x8a65c9ec, 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,
129: 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172, 0x3c03e4d1,
130: 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
131: 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf,
132: 0xabd13d59, 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,
133: 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f, 0x2802b89e,
134: 0x5f058808, 0xc60cd9b2, 0xb10be924, 0x2f6f7c87, 0x58684c11,
135: 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106, 0x98d220bc,
136: 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
137: 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb,
138: 0x086d3d2d, 0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162,
139: 0x856530d8, 0xf262004e, 0x6c0695ed, 0x1b01a57b, 0x8208f4c1,
140: 0xf50fc457, 0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,
141: 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65, 0x4db26158,
142: 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
143: 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846,
144: 0xda60b8d0, 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,
145: 0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086, 0x5768b525,
146: 0x206f85b3, 0xb966d409, 0xce61e49f, 0x5edef90e, 0x29d9c998,
147: 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b,
148: 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
149: 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12,
150: 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d,
151: 0x0a00ae27, 0x7d079eb1, 0xf00f9344, 0x8708a3d2, 0x1e01f268,
152: 0x6906c2fe, 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,
153: 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc, 0xf9b9df6f,
154: 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
155: 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd,
156: 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,
157: 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79, 0xcb61b38c,
158: 0xbc66831a, 0x256fd2a0, 0x5268e236, 0xcc0c7795, 0xbb0b4703,
159: 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92,
160: 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
161: 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9,
162: 0xeb0e363f, 0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14,
163: 0x7bb12bae, 0x0cb61b38, 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7,
164: 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,
165: 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777, 0x88085ae6,
166: 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
167: 0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354,
168: 0x3903b3c2, 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,
169: 0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0, 0xa9bcae53,
170: 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9, 0xbdbdf21c, 0xcabac28a,
171: 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693, 0x54de5729,
172: 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
173: 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d };
174:
175: protected void engineReset() {
176: init();
177: }
178:
179: /**
180: * Initialize the CRC32 information
181: */
182: public void init() {
183: seed = 0;
184: }
185:
186: private void processData(byte[] data, int off, int len) {
187: int result = seed;
188: for (int i = 0; i < len; i++)
189: result = (result >>> 8)
190: ^ crc32Table[(result ^ data[i]) & 0xff];
191: seed = result;
192: }
193:
194: public static int int2crc32(int b) {
195: int crc = b;
196:
197: for (int i = 8; i > 0; i--) {
198: if ((crc & 1) != 0)
199: crc = (crc >>> 1) ^ 0xedb88320;
200: else
201: crc = crc >>> 1;
202: }
203: return crc;
204: }
205:
206: public static void printcrc32Table() {
207: String temp;
208: String zerofill = "00000000";
209:
210: System.out.print("\tpublic static int[] crc32Table = {");
211: for (int i = 0; i < 256; i++) {
212: if ((i % 4) == 0)
213: System.out.print("\n\t\t");
214: temp = Integer.toHexString(int2crc32(i));
215: System.out.print("0x" + zerofill.substring(temp.length())
216: + temp);
217: if (i != 255)
218: System.out.print(", ");
219: }
220: System.out.println("\n\t};");
221: }
222:
223: public static int byte2crc32sum(int seed, byte[] data, int size) {
224: int crc = seed;
225:
226: for (int i = 0; i < size; i++)
227: crc = (crc >>> 8) ^ crc32Table[(crc ^ data[i]) & 0xff];
228: return crc;
229: }
230:
231: public static int byte2crc32sum(int seed, byte[] data) {
232: return byte2crc32sum(seed, data, data.length);
233: }
234:
235: //sum from zero, i.e., no pre- or post-conditioning
236: public static int byte2crc32sum(byte[] data) {
237: return byte2crc32sum(0, data);
238: }
239:
240: //CCITT ITU-T 3309 CRC-32 w/ standard pre- and post-conditioning
241: public static int byte2crc32(byte[] data) {
242: return ~byte2crc32sum(0xffffffff, data);
243: }
244:
245: public static byte[] byte2crc32sum_bytes(byte[] data) {
246: int temp = byte2crc32sum(data);
247: return int2quad(temp);
248: }
249:
250: public static byte[] byte2crc32sum_bytes(byte[] data, int size) {
251: int temp = byte2crc32sum(0, data, size);
252: if (DEBUG) {
253: System.out
254: .println(">>>crc32: " + Integer.toHexString(temp));
255: System.out.println(">>>crc32: "
256: + Integer.toBinaryString(temp));
257: }
258: return int2quad(temp);
259: }
260:
261: public static byte[] int2quad(long input) {
262: byte[] output = new byte[4];
263: for (int i = 0; i < 4; i++) {
264: output[i] = (byte) ((input >>> (i * 8)) & 0xff);
265: }
266: return output;
267: }
268:
269: }
|