2 * Copyright (c) 2009 Nicira Networks.
4 * Permission to use, copy, modify, and/or distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
32 const uint8_t output[20];
35 static const struct test_vector vectors[] = {
39 { 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,
40 0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D }
42 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56,
43 { 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,
44 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },
49 "0123456701234567012345670123456701234567012345670123456701234567"
50 "0123456701234567012345670123456701234567012345670123456701234567"
51 "0123456701234567012345670123456701234567012345670123456701234567"
52 "0123456701234567012345670123456701234567012345670123456701234567"
53 "0123456701234567012345670123456701234567012345670123456701234567"
54 "0123456701234567012345670123456701234567012345670123456701234567"
55 "0123456701234567012345670123456701234567012345670123456701234567"
56 "0123456701234567012345670123456701234567012345670123456701234567"
57 "0123456701234567012345670123456701234567012345670123456701234567"
58 "0123456701234567012345670123456701234567012345670123456701234567",
60 { 0xDE, 0xA3, 0x56, 0xA2, 0xCD, 0xDD, 0x90, 0xC7, 0xA7, 0xEC,
61 0xED, 0xC5, 0xEB, 0xB5, 0x63, 0x93, 0x4F, 0x46, 0x04, 0x52 },
64 /* http://www.febooti.com/products/filetweak/members/hash-and-crc/test-vectors/ */
67 { 0xda, 0x39, 0xa3, 0xee, 0x5e, 0x6b, 0x4b, 0x0d, 0x32, 0x55,
68 0xbf, 0xef, 0x95, 0x60, 0x18, 0x90, 0xaf, 0xd8, 0x07, 0x09 }
70 "Test vector from febooti.com", 28,
71 { 0xa7, 0x63, 0x17, 0x95, 0xf6, 0xd5, 0x9c, 0xd6, 0xd1, 0x4e,
72 0xbd, 0x00, 0x58, 0xa6, 0x39, 0x4a, 0x4b, 0x93, 0xd8, 0x68 }
75 /* http://en.wikipedia.org/wiki/SHA_hash_functions */
77 "The quick brown fox jumps over the lazy dog", 43,
78 { 0x2f, 0xd4, 0xe1, 0xc6, 0x7a, 0x2d, 0x28, 0xfc, 0xed, 0x84,
79 0x9e, 0xe1, 0xbb, 0x76, 0xe7, 0x39, 0x1b, 0x93, 0xeb, 0x12 },
81 "The quick brown fox jumps over the lazy cog", 43,
82 { 0xde, 0x9f, 0x2c, 0x7f, 0xd2, 0x5e, 0x1b, 0x3a, 0xfa, 0xd3,
83 0xe8, 0x5a, 0x0b, 0xd1, 0x7d, 0x9b, 0x10, 0x0d, 0xb4, 0xb3 },
86 /* http://www.hashcash.org/docs/sha1-hashcash.html */
88 "0:030626:adam@cypherspace.org:6470e06d773e05a8", 46,
89 { 0x00, 0x00, 0x00, 0x00, 0xc7, 0x0d, 0xb7, 0x38, 0x9f, 0x24,
90 0x1b, 0x8f, 0x44, 0x1f, 0xcf, 0x06, 0x8a, 0xea, 0xd3, 0xf0 },
95 test_one(const struct test_vector *vec)
97 uint8_t md[SHA1HashSize];
101 SHA1Bytes(vec->data, vec->size, md);
102 assert(!memcmp(md, vec->output, SHA1HashSize));
105 for (i = 0; i < 20; i++) {
106 int n0 = vec->size ? random_range(vec->size) : 0;
107 int n1 = vec->size - n0;
110 assert(SHA1Reset(&sha1) == shaSuccess);
111 assert(SHA1Input(&sha1, (const void *) vec->data, n0) == shaSuccess);
112 assert(SHA1Input(&sha1, (const void *) (vec->data + n0), n1)
114 assert(SHA1Result(&sha1, md) == shaSuccess);
115 assert(!memcmp(md, vec->output, SHA1HashSize));
123 test_big_vector(void)
125 enum { SIZE = 1000000 };
126 struct test_vector vec = {
128 { 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,
129 0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }
132 vec.data = xmalloc(SIZE);
133 memset(vec.data, 'a', SIZE);
143 for (i = 0; i < ARRAY_SIZE(vectors); i++) {
144 test_one(&vectors[i]);