java.security.MessageDigestSpi
java.security.MessageDigest
tribble.security.ZoidbergDHash
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object
Zoidberg-D message digest (cryptographic hash). Computes a 160-bit (20-byte) message digest (a binary hash) from a series of input bytes.
The digest algorithm is designed to produce a unique hash vector for any given input byte stream, such that altering a single bit in the input stream results in a completely different hash value.
An input stream of bytes fed into the digest algorithm are hashed 16 bytes (128 bits) at a time. After all input bytes have been fed into the algorithm, the input is padded with a trailing count byte, and then enough zero bytes to make the total input length a multiple of 16 bytes (128 bits). The result of the digest algorithm is a 20-byte (160-bit) output byte vector.
This digest algorithm can be used as the basis of a digital signature scheme.
Note that none of these methods is synchronized.
Test Vectors
An empty input vector of zero bytes
hashes to a message digest value of
+REDO +REDO
{E0 47 A9 DC 13 99 0F A3 06 82 21 D8 7E BA 28 0B 44 17 9A 27}.
A single input byte of
{00}
hashes to a message digest value of
+REDO +REDO
{C6 E3 BF 9B B1 B4 2F A0 C7 E5 59 07 A8 5D 6E AB DF 56 BB D0}.
A single input byte of
{01}
hashes to a message digest value of
+REDO +REDO
{C0 AA 48 59 F4 65 30 8B 22 EF 59 D1 0D 5E 10 AD 38 16 BC D9}.
Two input bytes of
{0D 0A}
hash to a message digest value of
+REDO +REDO
{1D 38 C5 A4 8E A2 74 0F 9A 13 CE 30 76 CD 47 77 04 A9 D7 18}.
Four input bytes of
{01 02 03 04}
hash to a message digest value of
+REDO +REDO
{63 48 17 EE 0D 9C BD A9 47 0D 4F 86 9D 3B B0 5E 24 2C D0 94}.
16 input bytes of
{01 02 03 04 01 02 03 04 01 02 03 04 01 02 03 04}
hash to a message digest value of
+REDO +REDO
{41 F2 73 C6 14 AA 37 49 8A 27 D8 C3 1C F0 A2 E6 D6 1A 1E D0}.
16 input bytes of
{00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F}
hash to a message digest value of
+REDO +REDO
{1A D7 BA 83 A2 0A 95 77 81 CE 42 D4 B3 AA 6A 71 73 4C DF C9}.
16 input bytes of
{00 01 02 03 04 25 06 07 08 09 0A 0B 0C 0D 0E 0F}
hash to a message digest value of
+REDO +REDO
{FF B5 A6 D0 8D B5 D0 99 D0 3A E9 89 B4 F4 C4 CC 71 35 84 FF}.
17 input bytes of
{00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 00}
hash to a message digest value of
+REDO +REDO
{00 85 46 3C 62 33 B9 EB F7 D4 9D C1 FF D7 92 83 93 F4 81 CB}.
16 input bytes of
{44 61 76 69 64 20 52 2E 20 54 72 69 62 62 6C 65}
hash to a message digest value of
+REDO +REDO
{27 50 B8 15 00 E6 74 70 0C C4 89 AD CF 5C 60 CC C4 F3 3E 7F}.
Acknowledgments
This code is based on an original algorithm invented by David R. Tribble in March 2002.
License is granted to use this algorithm without fees or restrictions for all private and commercial uses.
ZoidbergAHash,
MessageDigest| Constructor Summary | |
ZoidbergDHash()
Constructor. |
|
| Method Summary | |
java.lang.Object |
clone()
Clone this message digest, making a copy of the contents accumulated up to this point. |
byte[] |
digest()
Compute the final value of this message digest. |
byte[] |
digest(byte[] in)
Hash an array of bytes, updating and computing the final message digest. |
protected byte[] |
engineDigest()
Compute the final value of this message digest. |
protected int |
engineGetDigestLength()
Retrieve the size, in bytes, of this message digest. |
protected void |
engineReset()
Reset this message digest, clearing the results of any previously accumulated hashed input data. |
protected void |
engineUpdate(byte in)
Hash a single byte, updating this message digest. |
protected void |
engineUpdate(byte[] in,
int off,
int len)
Hash an array of bytes, updating this message digest. |
protected byte[] |
getBytes()
Retrieve the output bytes of this message digest. |
protected int |
hashWords()
Hash four 32-bit input words (128 bits), updating this message digest. |
static void |
main(java.lang.String[] args)
Test driver. |
void |
reset()
Reset this message digest, clearing the results of any previously accumulated hashed input data. |
void |
update(byte in)
Hash a single byte, updating this message digest. |
void |
update(byte[] in)
Hash an array of bytes, updating this message digest. |
void |
update(byte[] in,
int off,
int len)
Hash an array of bytes, updating this message digest. |
| Methods inherited from class java.security.MessageDigest |
digest, getAlgorithm, getDigestLength, getInstance, getInstance, getInstance, getProvider, isEqual, toString |
| Methods inherited from class java.security.MessageDigestSpi |
engineDigest |
| Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
public ZoidbergDHash()
| Method Detail |
public static void main(java.lang.String[] args)
Reads bytes from the standard input, hashes them, and then prints the resulting 160-bit (20-byte) hexadecimal hash vector.
args - Command line arguments. If specified, a message digest is computed from
the first argument; otherwise the digest is computed from the bytes read
from standard input.public void reset()
public java.lang.Object clone()
A cloned copy of a message digest can be used to produce a partial message
digest. Simply clone the message digest after the partial message
contents have been fed into update(byte[]), and then call
digest() on the clone. The original message digest object can
then be used to continue hashing the rest of the message.
public void update(byte in)
in - A single byte of input data to hash.public void update(byte[] in)
in - An array of data bytes to hash.
public void update(byte[] in,
int off,
int len)
in - An array of data bytes to hash.off - The index of the first byte of array in to hash.len - The number of bytes in array in to hash.public byte[] digest()
Note that this also resets the hash vector of this message digest.
public byte[] digest(byte[] in)
Note that this also resets the hash vector of this message digest.
in - An array of data bytes to hash.
protected void engineReset()
protected int engineGetDigestLength()
protected void engineUpdate(byte in)
in - A single byte of input data to hash.
protected void engineUpdate(byte[] in,
int off,
int len)
in - An array of data bytes to hash.off - The index of the first byte of array in to hash.len - The number of bytes in array in to hash.protected byte[] engineDigest()
The input is padded with a trailing count byte, and then enough zero bytes to make the total input length a multiple of 20 bytes (160 bits).
Note that this also resets the hash vector of this message digest.
protected byte[] getBytes()
Note that the returned byte array will contain all zeros (0x00) if this message digest has not been updated with any data bytes or has been reset.
protected int hashWords()
Algorithm
The hashing algorithm is a "braiding" of five 32-bit binary words, which comprise a total of 160 bits of the hash vector. The "braiding" refers to the way in which the words are permuted (rearranged). Between each permuting operation (Pi-phase), the input vector is combined with the output of the permutation, using exclusive-or (X-phase) and two's-complement addition (A-phase).
The I-phase spreads four 32-bit input words across the current 160-bit hash vector. The four 32-bit input words comprise the first four words of the input vector; the last word of the input vector is the sum of the squares of the four input words minus one (i.e., i4 = in0**2 + in1**2 + in2**2 + in3**2 - 1).
I-phase:
+-----+ +-----+ +-----+ +-----+
| in0 | | in1 | | in2 | | in3 | Input words (128 bits)
+-----+ +-----+ +-----+ +-----+
: : : :
: : : : : : : :
: : : : : : : :
: X**2 : X**2 : X**2 : X**2 -1
: : : : : : : : :
: :.... : ..ADD... : ..ADD... : ..ADD....ADD
: : : : :
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| i0 | | i1 | | i2 | | i3 | | i4 | I (160 bits)
+-----+ +-----+ +-----+ +-----+ +-----+
The H-phase adds the input vector words with the previous hash vector.
H-phase:
+-----+ +-----+ +-----+ +-----+ +-----+
| i0 | | i1 | | i2 | | i3 | | i4 | I0 (160 bits)
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
: +-----+ : +-----+ : +-----+ : +-----+ : +-----+
: | h0 | : | h1 | : | h2 | : | h3 | : | h4 | Hi-1
: +-----+ : +-----+ : +-----+ : +-----+ : +-----+
: : : : : : : : : :
: : : : : : : : : :
ADD ADD ADD ADD ADD
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| i0 | | i1 | | i2 | | i3 | | i4 | I1
+-----+ +-----+ +-----+ +-----+ +-----+
The R, P, X, Q, and A phases are then repeated 5 times, intermixing the contents of the input vector with the hash vector. The final result of the five rounds is the output hash vector.
R-phase:
+------+ +------+ +------+ +------+ +------+
| i0 | | i1 | | i2 | | i3 | | i4 | Ii
+------+ +------+ +------+ +------+ +------+
: : : : :
ROR(17) ROR(5) ROR(23) ROR(13) ROR(29)
: : : : :
+------+ +------+ +------+ +------+ +------+
| r0 | | r1 | | r2 | | r3 | | r4 | Ri
+------+ +------+ +------+ +------+ +------+
P-phase:
+-----+ +-----+ +-----+ +-----+ +-----+
| r0 | | r1 | | r2 | | r3 | | r4 | Ri
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
: : : : :
: : : : :
: :: : :
: : : : :
: : :: :
: : : : :
: : : : :
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| p0 | | p1 | | p2 | | p3 | | p4 | Pi
+-----+ +-----+ +-----+ +-----+ +-----+
X-phase:
+------+ +------+ +------+ +------+ +------+
| p0 | | p1 | | p2 | | p3 | | p4 | Pi
+------+ +------+ +------+ +------+ +------+
: : : : :
+-----+ : +-----+ : +-----+ : +-----+ : +-----+ :
| h0 | : | h1 | : | h2 | : | h3 | : | h4 | : Hi-1
+-----+ : +-----+ : +-----+ : +-----+ : +-----+ :
: : : : : : : : : :
: NEG : : : : : : : :
: : : : : : : : : :
: : : : : : : : : :
XOR XOR XOR XOR XOR
: : : : :
+------+ +------+ +------+ +------+ +------+
| x0 | | x1 | | x2 | | x3 | | x4 | Xi
+------+ +------+ +------+ +------+ +------+
S-phase:
+-----+ +-----+ +-----+ +-----+ +-----+
| x0 | | x1 | | x2 | | x3 | | x4 | Xi
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
+-------------------------------+
| ROL(7) |
+-------------------------------+
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| s0 | | s1 | | s2 | | s3 | | s4 | Si
+-----+ +-----+ +-----+ +-----+ +-----+
Q-phase:
+-----+ +-----+ +-----+ +-----+ +-----+
| s0 | | s1 | | s2 | | s3 | | s4 | Si
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
: : : : :
: : : :
:: : : :
: : : : :
: : : ::
: : : :
: : : : :
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| q0 | | q1 | | q2 | | q3 | | q4 | Qi
+-----+ +-----+ +-----+ +-----+ +-----+
A-phase:
+-----+ +-----+ +-----+ +-----+ +-----+
| q0 | | q1 | | q2 | | q3 | | q4 | Qi
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
: +-----+ : +-----+ : +-----+ : +-----+ : +-----+
: | i0 | : | i1 | : | i2 | : | i3 | : | i4 | Ii
: +-----+ : +-----+ : +-----+ : +-----+ : +-----+
: : : : : : : : : :
: : : : : : : : : :
ADD ADD ADD ADD ADD
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| i0 | | i1 | | i2 | | i3 | | i4 | Ii+1
+-----+ +-----+ +-----+ +-----+ +-----+
The output vector of each round becomes the input vector of the next round.
The output vector of the last round is the output of the hash, i.e., the message digest.
+-----+ +-----+ +-----+ +-----+ +-----+
| i0 | | i1 | | i2 | | i3 | | i4 | I5
+-----+ +-----+ +-----+ +-----+ +-----+
: : : : :
+-----+ +-----+ +-----+ +-----+ +-----+
| h0 | | h1 | | h2 | | h3 | | h4 | O, Hi+1
+-----+ +-----+ +-----+ +-----+ +-----+
The P and Q phases permute the 5 words of the hash vector in the following braiding pattern (which repeats every 5 iterations):
0. A B C D E
1. B C D E A P iteration 1
2. C E B A D Q
3. E B A D C P iteration 2
4. B D E C A Q
5. D E C A B P iteration 3
6. E A D B C Q
7. A D B C E P iteration 4
8. D C A E B Q
9. C A E B D P iteration 5
10. A B C D E Q
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||