/* * Copyright (C) 2015 Southern Storm Software, Pty Ltd. * * Permission is hereby granted, free of charge, to any person obtaining a * 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. */ /* This example runs tests on the SHA1 implementation to verify correct behaviour. */ #include #include #include #define HASH_SIZE 20 struct TestHashVector { const char *name; const char *data; uint8_t hash[HASH_SIZE]; }; static TestHashVector const testVectorSHA1_1 = { "SHA-1 #1", "abc", {0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E, 0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D} }; static TestHashVector const testVectorSHA1_2 = { "SHA-1 #2", "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", {0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE, 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1} }; SHA1 sha1; byte buffer[128]; bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc) { size_t size = strlen(test->data); size_t posn, len; uint8_t value[HASH_SIZE]; for (posn = 0; posn < size; posn += inc) { len = size - posn; if (len > inc) len = inc; hash->update(test->data + posn, len); } hash->finalize(value, sizeof(value)); if (memcmp(value, test->hash, sizeof(value)) != 0) return false; // Try again to make sure the hash resets. for (posn = 0; posn < size; posn += inc) { len = size - posn; if (len > inc) len = inc; hash->update(test->data + posn, len); } hash->finalize(value, sizeof(value)); if (memcmp(value, test->hash, sizeof(value)) != 0) return false; return true; } void testHash(Hash *hash, const struct TestHashVector *test) { bool ok; Serial.print(test->name); Serial.print(" ... "); ok = testHash_N(hash, test, strlen(test->data)); ok &= testHash_N(hash, test, 1); ok &= testHash_N(hash, test, 2); ok &= testHash_N(hash, test, 5); ok &= testHash_N(hash, test, 8); ok &= testHash_N(hash, test, 13); ok &= testHash_N(hash, test, 16); ok &= testHash_N(hash, test, 24); ok &= testHash_N(hash, test, 63); ok &= testHash_N(hash, test, 64); if (ok) Serial.println("Passed"); else Serial.println("Failed"); } void perfHash(Hash *hash) { unsigned long start; unsigned long elapsed; int count; Serial.print("Hashing ... "); for (size_t posn = 0; posn < sizeof(buffer); ++posn) buffer[posn] = (uint8_t)posn; hash->reset(); start = micros(); for (count = 0; count < 1000; ++count) { hash->update(buffer, sizeof(buffer)); } elapsed = micros() - start; Serial.print(elapsed / (sizeof(buffer) * 1000.0)); Serial.print("us per byte, "); Serial.print((sizeof(buffer) * 1000.0 * 1000000.0) / elapsed); Serial.println(" bytes per second"); } void setup() { Serial.begin(9600); Serial.println(); Serial.println("Test Vectors:"); testHash(&sha1, &testVectorSHA1_1); testHash(&sha1, &testVectorSHA1_2); Serial.println(); Serial.println("Performance Tests:"); perfHash(&sha1); } void loop() { }