Source/charon/testcases/hasher_sha1_test.c

   1 /**
   2  * @file hasher_sha1_test.h
   3  *
   4  * @brief Tests the sha1 hasher
   5  *
   6  */
   7
   8 /*
   9  * Copyright (C) 2005 Jan Hutter, Martin Willi
  10  * Hochschule fuer Technik Rapperswil
  11  *
  12  * This program is free software; you can redistribute it and/or modify it
  13  * under the terms of the GNU General Public License as published by the
  14  * Free Software Foundation; either version 2 of the License, or (at your
  15  * option) any later version.  See <http://www.fsf.org/copyleft/gpl.txt>.
  16  *
  17  * This program is distributed in the hope that it will be useful, but
  18  * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  19  * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  20  * for more details.
  21  */
  22
  23 #include <string.h>
  24
  25 #include "hasher_sha1_test.h"
  26
  27 #include "../utils/allocator.h"
  28
  29
  30 /*
  31  * described in Header-File
  32  */
  33 void test_hasher_sha1(tester_t *tester)
  34 {
  35         /*
  36          *      Test Vectors (from FIPS PUB 180-1)
  37          *      "abc"
  38          *              A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
  39          *      "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  40          *              84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
  41          *      A million repetitions of "a"
  42          *              34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
  43          */
  44         hasher_t *hasher = hasher_create(HASH_SHA1);
  45         u_int8_t hash_buffer[20];
  46         chunk_t abc, abcdb, aaa, hash_chunk;
  47         u_int32_t i;
  48         u_int8_t hash_abc[] = {
  49                 0xA9,0x99,0x3E,0x36,
  50                 0x47,0x06,0x81,0x6A,
  51                 0xBA,0x3E,0x25,0x71,
  52                 0x78,0x50,0xC2,0x6C,
  53                 0x9C,0xD0,0xD8,0x9D
  54         };
  55         u_int8_t hash_abcdb[] = {
  56                 0x84,0x98,0x3E,0x44,
  57                 0x1C,0x3B,0xD2,0x6E,
  58                 0xBA,0xAE,0x4A,0xA1,
  59                 0xF9,0x51,0x29,0xE5,
  60                 0xE5,0x46,0x70,0xF1
  61         };
  62         u_int8_t hash_aaa[] = {
  63                 0x34,0xAA,0x97,0x3C,
  64                 0xD4,0xC4,0xDA,0xA4,
  65                 0xF6,0x1E,0xEB,0x2B,
  66                 0xDB,0xAD,0x27,0x31,
  67                 0x65,0x34,0x01,0x6F
  68         };
  69         abc.ptr = "abc";
  70         abc.len = 3;
  71         abcdb.ptr = "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
  72         abcdb.len = strlen(abcdb.ptr);
  73         aaa.ptr = "aaaaaaaaaa"; /* 10 a's */
  74         aaa.len = 10;
  75
  76         tester->assert_true(tester, hasher->get_block_size(hasher) == 20, "block size");
  77
  78         /* simple hashing, using "abc" */
  79         hasher->get_hash(hasher, abc, hash_buffer);
  80         tester->assert_false(tester, memcmp(hash_buffer, hash_abc, 20), "hash for abc");
  81
  82         /* with allocation, using "abcdb..." */
  83         hasher->reset(hasher);
  84         hasher->allocate_hash(hasher, abcdb, &hash_chunk);
  85         tester->assert_true(tester, hash_chunk.len == 20, "chunk len");
  86         tester->assert_false(tester, memcmp(hash_chunk.ptr, hash_abcdb, hash_chunk.len), "hash for abcdb...");
  87         allocator_free(hash_chunk.ptr);
  88
  89         /* updating, using "aaaaaaa..." */
  90         hasher->reset(hasher);
  91         for(i=0; i<100000; i++)
  92         {
  93                 if (i != 99999)
  94                 {
  95                         hasher->get_hash(hasher, aaa, NULL);
  96                 }
  97                 else
  98                 {
  99                         hasher->get_hash(hasher, aaa, hash_buffer);
 100                 }
 101         }
 102         tester->assert_false(tester, memcmp(hash_buffer, hash_aaa, 20), "hash for aaa...");
 103 }