2 * Copyright (C) 2012 Michael Brown <mbrown@fensystems.co.uk>.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation; either version 2 of the
7 * License, or any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
20 FILE_LICENCE ( GPL2_OR_LATER );
29 #include <ipxe/sha1.h>
30 #include <ipxe/test.h>
31 #include "digest_test.h"
33 /** An SHA-1 test vector */
34 struct sha1_test_vector {
37 /** Test data length */
39 /** Expected digest */
40 uint8_t digest[SHA1_DIGEST_SIZE];
43 /** SHA-1 test vectors */
44 static struct sha1_test_vector sha1_test_vectors[] = {
47 * Expected digest value obtained from "sha1sum /dev/null"
50 { 0xda, 0x39, 0xa3, 0xee, 0x5e, 0x6b, 0x4b, 0x0d, 0x32, 0x55,
51 0xbf, 0xef, 0x95, 0x60, 0x18, 0x90, 0xaf, 0xd8, 0x07, 0x09 } },
52 /* Test data and expected digests taken from the NIST
53 * Cryptographic Toolkit Algorithm Examples at
54 * http://csrc.nist.gov/groups/ST/toolkit/documents/Examples/SHA1.pdf
57 { 0xa9, 0x99, 0x3e, 0x36, 0x47, 0x06, 0x81, 0x6a, 0xba, 0x3e,
58 0x25, 0x71, 0x78, 0x50, 0xc2, 0x6c, 0x9c, 0xd0, 0xd8, 0x9d } },
59 { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56,
60 { 0x84, 0x98, 0x3e, 0x44, 0x1c, 0x3b, 0xd2, 0x6e, 0xba, 0xae,
61 0x4a, 0xa1, 0xf9, 0x51, 0x29, 0xe5, 0xe5, 0x46, 0x70, 0xf1 } },
64 /** SHA-1 test fragment lists */
65 static struct digest_test_fragments sha1_test_fragments[] = {
67 { { 1, 1, 1, 1, 1, 1, 1, 1 } },
68 { { 2, 0, 23, 4, 6, 1, 0 } },
72 * Perform SHA-1 self-test
75 static void sha1_test_exec ( void ) {
76 struct digest_algorithm *digest = &sha1_algorithm;
77 struct sha1_test_vector *test;
82 /* Correctness test */
83 for ( i = 0 ; i < ( sizeof ( sha1_test_vectors ) /
84 sizeof ( sha1_test_vectors[0] ) ) ; i++ ) {
85 test = &sha1_test_vectors[i];
86 /* Test with a single pass */
87 digest_ok ( digest, NULL, test->data, test->len, test->digest );
88 /* Test with fragment lists */
89 for ( j = 0 ; j < ( sizeof ( sha1_test_fragments ) /
90 sizeof ( sha1_test_fragments[0] ) ) ; j++ ){
91 digest_ok ( digest, &sha1_test_fragments[j],
92 test->data, test->len, test->digest );
97 cost = digest_cost ( digest );
98 DBG ( "SHA1 required %ld cycles per byte\n", cost );
101 /** SHA-1 self-test */
102 struct self_test sha1_test __self_test = {
104 .exec = sha1_test_exec,