org.bouncycastle.crypto.test.Blake2bDigestTest Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of bcprov-ext-jdk15on Show documentation
The Bouncy Castle Crypto package is a Java implementation of cryptographic algorithms. This jar contains JCE provider and lightweight API for the Bouncy Castle Cryptography APIs for JDK 1.5 to JDK 1.8. Note: this package includes the NTRU encryption algorithms.
The newest version!
package org.bouncycastle.crypto.test;

import java.io.UnsupportedEncodingException;

import org.bouncycastle.crypto.Digest;
import org.bouncycastle.crypto.digests.Blake2bDigest;
import org.bouncycastle.util.Arrays;
import org.bouncycastle.util.encoders.Hex;
import org.bouncycastle.util.test.SimpleTest;

public class Blake2bDigestTest 
	extends SimpleTest
{

	private static final String[][] keyedTestVectors =
	{ // input/message, key, hash

			// Vectors from BLAKE2 web site: https://blake2.net/blake2b-test.txt
			{
					"",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"10ebb67700b1868efb4417987acf4690ae9d972fb7a590c2f02871799aaa4786b5e996e8f0f4eb981fc214b005f42d2ff4233499391653df7aefcbc13fc51568" },

			{
					"00",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"961f6dd1e4dd30f63901690c512e78e4b45e4742ed197c3c5e45c549fd25f2e4187b0bc9fe30492b16b0d0bc4ef9b0f34c7003fac09a5ef1532e69430234cebd" },

			{
					"0001",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"da2cfbe2d8409a0f38026113884f84b50156371ae304c4430173d08a99d9fb1b983164a3770706d537f49e0c916d9f32b95cc37a95b99d857436f0232c88a965" },

			{
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"f1aa2b044f8f0c638a3f362e677b5d891d6fd2ab0765f6ee1e4987de057ead357883d9b405b9d609eea1b869d97fb16d9b51017c553f3b93c0a1e0f1296fedcd" },

			{
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"c230f0802679cb33822ef8b3b21bf7a9a28942092901d7dac3760300831026cf354c9232df3e084d9903130c601f63c1f4a4a4b8106e468cd443bbe5a734f45f" },

			{
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3a4a5a6a7a8a9aaabacadaeafb0b1b2b3b4b5b6b7b8b9babbbcbdbebfc0c1c2c3c4c5c6c7c8c9cacbcccdcecfd0d1d2d3d4d5d6d7d8d9dadbdcdddedfe0e1e2e3e4e5e6e7e8e9eaebecedeeeff0f1f2f3f4f5f6f7f8f9fafbfcfdfe",
					"000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f",
					"142709d62e28fcccd0af97fad0f8465b971e82201dc51070faa0372aa43e92484be1c1e73ba10906d5d1853db6a4106e0a7bf9800d373d6dee2d46d62ef2a461" } };

	private final static String[][] unkeyedTestVectors =
	{ // from: http://fossies.org/linux/john/src/rawBLAKE2_512_fmt_plug.c
			// hash, input/message
			// digests without leading $BLAKE2$
			{
					"4245af08b46fbb290222ab8a68613621d92ce78577152d712467742417ebc1153668f1c9e1ec1e152a32a9c242dc686d175e087906377f0c483c5be2cb68953e",
					"blake2" },
			{
					"021ced8799296ceca557832ab941a50b4a11f83478cf141f51f933f653ab9fbcc05a037cddbed06e309bf334942c4e58cdf1a46e237911ccd7fcf9787cbc7fd0",
					"hello world" },
			{
					"1f7d9b7c9a90f7bfc66e52b69f3b6c3befbd6aee11aac860e99347a495526f30c9e51f6b0db01c24825092a09dd1a15740f0ade8def87e60c15da487571bcef7",
					"verystrongandlongpassword" },
			{
					"a8add4bdddfd93e4877d2746e62817b116364a1fa7bc148d95090bc7333b3673f82401cf7aa2e4cb1ecd90296e3f14cb5413f8ed77be73045b13914cdcd6a918",
					"The quick brown fox jumps over the lazy dog" },
			{
					"786a02f742015903c6c6fd852552d272912f4740e15847618a86e217f71f5419d25e1031afee585313896444934eb04b903a685b1448b755d56f701afe9be2ce",
					"" },
		{
				"ba80a53f981c4d0d6a2797b69f12f6e94c212f14685ac4b74b12bb6fdbffa2d17d87c5392aab792dc252d5de4533cc9518d38aa8dbf1925ab92386edd4009923",
				"abc" },
	};

	public String getName()
	{
		return "Blake2b";
	}

	private void offsetTest(
		Digest digest,
		byte[] input,
		byte[] expected)
	{
		byte[] resBuf = new byte[expected.length + 11];

		digest.update(input, 0, input.length);

        digest.doFinal(resBuf, 11);

		if (!areEqual(Arrays.copyOfRange(resBuf, 11, resBuf.length), expected))
		{
			fail("Offset failed got " + new String(Hex.encode(resBuf)));
		}
	}

	public void performTest() throws Exception
	{
		// test keyed test vectors:
		
		Blake2bDigest blake2bkeyed = new Blake2bDigest(Hex.decode(keyedTestVectors[0][1]));
		for (int tv = 0; tv < keyedTestVectors.length; tv++)
		{						

			byte[] input = Hex.decode(keyedTestVectors[tv][0]);
			blake2bkeyed.reset();

			blake2bkeyed.update(input, 0, input.length);
			byte[] keyedHash = new byte[64];
			blake2bkeyed.doFinal(keyedHash, 0);

			if (!Arrays.areEqual(Hex.decode(keyedTestVectors[tv][2]), keyedHash))
			{
				fail("Blake2b mismatch on test vector ",
						keyedTestVectors[tv][2],
						new String(Hex.encode(keyedHash)));
			}

			offsetTest(blake2bkeyed, input, keyedHash);
		}

		Blake2bDigest blake2bunkeyed = new Blake2bDigest();
		// test unkeyed test vectors:
		for (int i = 0; i < unkeyedTestVectors.length; i++)
		{

			try
			{
				// blake2bunkeyed.update(
				// unkeyedTestVectors[i][1].getBytes("UTF-8"));
				// test update(byte b)
				byte[] unkeyedInput = unkeyedTestVectors[i][1]
						.getBytes("UTF-8");
				for (int j = 0; j < unkeyedInput.length; j++)
				{
					blake2bunkeyed.update(unkeyedInput[j]);
				}
			}
            catch (UnsupportedEncodingException e)
			{
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			byte[] unkeyedHash = new byte[64];
			blake2bunkeyed.doFinal(unkeyedHash, 0);
			blake2bunkeyed.reset();

			if (!Arrays.areEqual(Hex.decode(unkeyedTestVectors[i][0]),
					unkeyedHash))
			{
				fail("Blake2b mismatch on test vector ",
						unkeyedTestVectors[i][0],
						new String(Hex.encode(unkeyedHash)));
			}
		}

		cloneTest();
		resetTest();
	}

	private void cloneTest()
	{
		Blake2bDigest blake2bCloneSource = new Blake2bDigest(Hex.decode(keyedTestVectors[3][1]), 16, Hex.decode("000102030405060708090a0b0c0d0e0f"), Hex.decode("101112131415161718191a1b1c1d1e1f"));
		byte[] expected = Hex.decode("b6d48ed5771b17414c4e08bd8d8a3bc4");

		checkClone(blake2bCloneSource, expected);

		// just digest size
		blake2bCloneSource = new Blake2bDigest(160);
		expected = Hex.decode("64202454e538279b21cea0f5a7688be656f8f484");
		checkClone(blake2bCloneSource, expected);

		// null salt and personalisation
		blake2bCloneSource = new Blake2bDigest(Hex.decode(keyedTestVectors[3][1]), 16, null, null);
		expected = Hex.decode("2b4a081fae2d7b488f5eed7e83e42a20");
		checkClone(blake2bCloneSource, expected);

		// null personalisation
		blake2bCloneSource = new Blake2bDigest(Hex.decode(keyedTestVectors[3][1]), 16, Hex.decode("000102030405060708090a0b0c0d0e0f"), null);
		expected = Hex.decode("00c3a2a02fcb9f389857626e19d706f6");
		checkClone(blake2bCloneSource, expected);

		// null salt
		blake2bCloneSource = new Blake2bDigest(Hex.decode(keyedTestVectors[3][1]), 16, null, Hex.decode("101112131415161718191a1b1c1d1e1f"));
		expected = Hex.decode("f445ec9c062a3c724f8fdef824417abb");
		checkClone(blake2bCloneSource, expected);
	}

	private void checkClone(Blake2bDigest blake2bCloneSource, byte[] expected)
	{
		byte[] message = Hex.decode(keyedTestVectors[3][0]);

		blake2bCloneSource.update(message, 0, message.length);

		byte[] hash = new byte[blake2bCloneSource.getDigestSize()];

		Blake2bDigest digClone = new Blake2bDigest(blake2bCloneSource);

		blake2bCloneSource.doFinal(hash, 0);
		if (!areEqual(expected, hash))
		{
			fail("clone source not correct");
		}

		digClone.doFinal(hash, 0);
		if (!areEqual(expected, hash))
		{
			fail("clone not correct");
		}
	}

	private void resetTest()
	{
		// Generate a non-zero key
		byte[] key = new byte[32];
		for (byte i = 0; i < key.length; i++)
		{
			key[i] = i;
		}
		// Generate some non-zero input longer than the key
		byte[] input = new byte[key.length + 1];
		for (byte i = 0; i < input.length; i++)
		{
			input[i] = i;
		}
		// Hash the input
		Blake2bDigest digest = new Blake2bDigest(key);
		digest.update(input, 0, input.length);
		byte[] hash = new byte[digest.getDigestSize()];
		digest.doFinal(hash, 0);
		// Using a second instance, hash the input without calling doFinal()
		Blake2bDigest digest1 = new Blake2bDigest(key);
		digest1.update(input, 0, input.length);
		// Reset the second instance and hash the input again
		digest1.reset();
		digest1.update(input, 0, input.length);
		byte[] hash1 = new byte[digest.getDigestSize()];
		digest1.doFinal(hash1, 0);
		// The hashes should be identical
		if (!Arrays.areEqual(hash, hash1))
		{
			fail("state was not reset");
		}
	}

	public static void main(String[] args) throws Exception
	{
		runTest(new Blake2bDigestTest());
	}
}