emsha/test/test_emsha.cc

/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2015 K. Isom <coder@kyleisom.net>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * copy of this  software and associated documentation  files (the "Software"),
 * to deal  in the Software  without restriction, including  without limitation
 * the rights  to use,  copy, modify,  merge, publish,  distribute, sublicense,
 * and/or  sell copies  of the  Software,  and to  permit persons  to whom  the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS  PROVIDED "AS IS", WITHOUT WARRANTY OF  ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING  BUT NOT  LIMITED TO  THE WARRANTIES  OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND  NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS  OR COPYRIGHT  HOLDERS BE  LIABLE FOR  ANY CLAIM,  DAMAGES OR  OTHER
 * LIABILITY,  WHETHER IN  AN ACTION  OF CONTRACT,  TORT OR  OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.
 */


#include "emsha/emsha.h"
#include <chrono>
#include <iostream>

#include "test_utils.h"


using namespace std;


// how many test runs to benchmark hex strings?
static constexpr auto testIterations = 32768;


#ifndef EMSHA_NO_HEXSTRING
static void
hexStringTest()
{
	uint8_t buf[32];
	uint8_t out[65];
	string  const expected = "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f";

	out[64] = 0;
	for (uint32_t i = 0; i < 32; i++) {
		buf[i] = static_cast<uint8_t>(i);
	}

	emsha::HexString(out, buf, emsha::SHA256_HASH_SIZE);
	string const outs(reinterpret_cast<const char *>(out));
	if (outs != expected) {
		cerr << "FAILED: HexString\n";
		cerr << "\twanted: " << expected << "\n";
		cerr << "\thave:   " << out << "\n";
		exit(1);
	}
}
#endif // #ifndef EMSHA_NO_HEXSTRING


// TODO(kyle): build a test harness around this to verify times between
// runs.
static void
hashEqualTest()
{
	uint8_t a[emsha::SHA256_HASH_SIZE];
	uint8_t b[emsha::SHA256_HASH_SIZE];

	for (uint32_t i = 0; i < emsha::SHA256_HASH_SIZE; i++) {
		a[i] = static_cast<uint8_t>(i);
		b[i] = static_cast<uint8_t>(i);
	}

	if (!(emsha::HashEqual(a, b))) {
		string s;
		cerr << "FAILED: HashEqual\n";
		cerr << "\tHashEqual should have succeeded comparing a and b.\n";
		DumpHexString(s, a, emsha::SHA256_HASH_SIZE);
		cerr << "\ta <- " << s << "\n";
		DumpHexString(s, b, emsha::SHA256_HASH_SIZE);
		cerr << "\tb <- " << s << "\n";
		exit(1);
	}

	for (uint32_t i = 0; i < emsha::SHA256_HASH_SIZE; i++) {
		a[i] = static_cast<uint8_t>(i);
		b[i] = static_cast<uint8_t>(emsha::SHA256_HASH_SIZE - i);
	}

	if (emsha::HashEqual(a, b)) {
		string s;
		cerr << "FAILED: HashEqual\n";
		cerr << "\tHashEqual should not have succeeded comparing a and b.\n";
		DumpHexString(s, a, emsha::SHA256_HASH_SIZE);
		cerr << "\ta <- " << s << "\n";
		DumpHexString(s, b, emsha::SHA256_HASH_SIZE);
		cerr << "\tb <- " << s << "\n";
		exit(1);
	}

	// This catches the bug in the initial version where the code was
	//         res = a[i] ^ b[i];
	// instead of
	//         res += a[i] ^ b[i];
	for (uint32_t i = 0; i < emsha::SHA256_HASH_SIZE; i++) {
		a[i] = static_cast<uint8_t>(i);
		b[i] = static_cast<uint8_t>(i + 1);
	}

	b[emsha::SHA256_HASH_SIZE - 1]--;
	if (emsha::HashEqual(a, b)) {
		string s;
		cerr << "FAILED: HashEqual\n";
		cerr << "\tREGRESSION: HashEqual should not have succeeded comparing a and b.\n";
		DumpHexString(s, a, emsha::SHA256_HASH_SIZE);
		cerr << "\ta <- " << s << std::endl;
		DumpHexString(s, b, emsha::SHA256_HASH_SIZE);
		cerr << "\tb <- " << s << std::endl;
		exit(1);
	}
}


int
main()
{
	auto start = std::chrono::steady_clock::now();
	std::string testLabel;

	for (auto i = 0; i < testIterations; i++) {
#ifndef EMSHA_NO_HEXSTRING
#ifndef EMSHA_NO_HEXLUT
		testLabel = "(large LUT) ";
#endif
		hexStringTest();
#endif
		hashEqualTest();
	}

	auto end   = std::chrono::steady_clock::now();
	auto delta = (end - start);

	std::cout << "Passed HexString " << testLabel << "tests.\n";
	std::cout << "Total time: "
		  << std::chrono::duration<double, std::milli>(delta).count()
		  << " ms\n";
	std::cout << "Average over " << testIterations << " tests: "
		  << std::chrono::duration<double, std::nano>(delta).count() / testIterations
		  << " ns\n";
}