1 /* Copyright (c) 2000 The Legion Of The Bouncy Castle
2 * (http://www.bouncycastle.org)
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
19 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
20 * DEALINGS IN THE SOFTWARE.
23 package org.ibex.crypto;
26 * base implementation of MD4 family style digest as outlined in
27 * "Handbook of Applied Cryptography", pages 344 - 347.
34 private long byteCount;
37 * Standard constructor
50 if (xBufOff == xBuf.length)
65 // fill the current word
67 while ((xBufOff != 0) && (len > 0))
76 // process whole words.
78 while (len > xBuf.length)
80 processWord(in, inOff);
84 byteCount += xBuf.length;
88 // load in the remainder.
99 protected void finish()
101 long bitLength = (byteCount << 3);
104 // add the pad bytes.
113 processLength(bitLength);
123 for ( int i = 0; i < xBuf.length; i++ ) {
128 protected abstract void processWord(byte[] in, int inOff);
130 protected abstract void processLength(long bitLength);
132 protected abstract void processBlock();