aboutsummaryrefslogtreecommitdiffstats
path: root/Source/charon/testcases/hasher_sha1_test.c
diff options
context:
space:
mode:
Diffstat (limited to 'Source/charon/testcases/hasher_sha1_test.c')
-rw-r--r--Source/charon/testcases/hasher_sha1_test.c106
1 files changed, 0 insertions, 106 deletions
diff --git a/Source/charon/testcases/hasher_sha1_test.c b/Source/charon/testcases/hasher_sha1_test.c
deleted file mode 100644
index 79b9a1d4f..000000000
--- a/Source/charon/testcases/hasher_sha1_test.c
+++ /dev/null
@@ -1,106 +0,0 @@
-/**
- * @file hasher_sha1_test.h
- *
- * @brief Tests the sha1 hasher
- *
- */
-
-/*
- * Copyright (C) 2005 Jan Hutter, Martin Willi
- * Hochschule fuer Technik Rapperswil
- *
- * This program is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License as published by the
- * Free Software Foundation; either version 2 of the License, or (at your
- * option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
- *
- * This program is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
- * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
- * for more details.
- */
-
-#include <string.h>
-
-#include "hasher_sha1_test.h"
-
-#include <utils/allocator.h>
-
-
-/*
- * described in Header-File
- */
-void test_hasher_sha1(tester_t *tester)
-{
- /*
- * Test Vectors (from FIPS PUB 180-1)
- * "abc"
- * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
- * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
- * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
- * A million repetitions of "a"
- * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
- */
- hasher_t *hasher = hasher_create(HASH_SHA1);
- u_int8_t hash_buffer[20];
- chunk_t abc, abcdb, aaa, hash_chunk;
- u_int32_t i;
- u_int8_t hash_abc[] = {
- 0xA9,0x99,0x3E,0x36,
- 0x47,0x06,0x81,0x6A,
- 0xBA,0x3E,0x25,0x71,
- 0x78,0x50,0xC2,0x6C,
- 0x9C,0xD0,0xD8,0x9D
- };
- u_int8_t hash_abcdb[] = {
- 0x84,0x98,0x3E,0x44,
- 0x1C,0x3B,0xD2,0x6E,
- 0xBA,0xAE,0x4A,0xA1,
- 0xF9,0x51,0x29,0xE5,
- 0xE5,0x46,0x70,0xF1
- };
- u_int8_t hash_aaa[] = {
- 0x34,0xAA,0x97,0x3C,
- 0xD4,0xC4,0xDA,0xA4,
- 0xF6,0x1E,0xEB,0x2B,
- 0xDB,0xAD,0x27,0x31,
- 0x65,0x34,0x01,0x6F
- };
- abc.ptr = "abc";
- abc.len = 3;
- abcdb.ptr = "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
- abcdb.len = strlen(abcdb.ptr);
- aaa.ptr = "aaaaaaaaaa"; /* 10 a's */
- aaa.len = 10;
-
- tester->assert_true(tester, hasher->get_block_size(hasher) == 20, "block size");
-
- /* simple hashing, using "abc" */
- hasher->get_hash(hasher, abc, hash_buffer);
- tester->assert_false(tester, memcmp(hash_buffer, hash_abc, 20), "hash for abc");
-
- /* with allocation, using "abcdb..." */
- hasher->reset(hasher);
- hasher->allocate_hash(hasher, abcdb, &hash_chunk);
- tester->assert_true(tester, hash_chunk.len == 20, "chunk len");
- tester->assert_false(tester, memcmp(hash_chunk.ptr, hash_abcdb, hash_chunk.len), "hash for abcdb...");
- allocator_free(hash_chunk.ptr);
-
- /* updating, using "aaaaaaa..." */
- hasher->reset(hasher);
- for(i=0; i<100000; i++)
- {
- if (i != 99999)
- {
- hasher->get_hash(hasher, aaa, NULL);
- }
- else
- {
- hasher->get_hash(hasher, aaa, hash_buffer);
- }
- }
- tester->assert_false(tester, memcmp(hash_buffer, hash_aaa, 20), "hash for aaa...");
-
-
- tester->assert_true(tester, (hasher->destroy(hasher) == SUCCESS), "destroy call test");
-}