/*- * Copyright (c) 2012 The University of Oslo * Copyright (c) 2012 Dag-Erling Smørgrav * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote * products derived from this software without specific prior written * permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include "cryb/impl.h" #include #include #include #include #include "t.h" #if WITH_OPENSSL #include #include #include #define HMAC_SHA384_MAC_LEN SHA384_DIGEST_LENGTH static void t_hmac_sha384_complete(const void *key, size_t keylen, const void *msg, size_t msglen, uint8_t *mac) { HMAC_CTX ctx; HMAC_CTX_init(&ctx); HMAC_Init_ex(&ctx, key, keylen, EVP_sha384(), NULL); HMAC_Update(&ctx, msg, msglen); HMAC_Final(&ctx, mac, NULL); HMAC_CTX_cleanup(&ctx); } #else #include #include #define t_hmac_sha384_complete(key, keylen, msg, msglen, mac) \ hmac_sha384_complete(key, keylen, msg, msglen, mac) #endif /* * Test vectors from NIST CSRC * http://csrc.nist.gov/groups/ST/toolkit/examples.html */ static struct t_vector { const char *desc; const uint8_t *key; size_t keylen; const char *msg; const uint8_t mac[HMAC_SHA384_MAC_LEN]; } t_hmac_sha384_vectors[] = { { "zero-length key, zero-length message", t_zero, 0, "", { 0x6c, 0x1f, 0x2e, 0xe9, 0x38, 0xfa, 0xd2, 0xe2, 0x4b, 0xd9, 0x12, 0x98, 0x47, 0x43, 0x82, 0xca, 0x21, 0x8c, 0x75, 0xdb, 0x3d, 0x83, 0xe1, 0x14, 0xb3, 0xd4, 0x36, 0x77, 0x76, 0xd1, 0x4d, 0x35, 0x51, 0x28, 0x9e, 0x75, 0xe8, 0x20, 0x9c, 0xd4, 0xb7, 0x92, 0x30, 0x28, 0x40, 0x23, 0x4a, 0xdc, }, }, { "NIST CSRC example 1 (128-byte key)", t_seq8, 128, "Sample message for keylen=blocklen", { 0x63, 0xc5, 0xda, 0xa5, 0xe6, 0x51, 0x84, 0x7c, 0xa8, 0x97, 0xc9, 0x58, 0x14, 0xab, 0x83, 0x0b, 0xed, 0xed, 0xc7, 0xd2, 0x5e, 0x83, 0xee, 0xf9, 0x19, 0x5c, 0xd4, 0x58, 0x57, 0xa3, 0x7f, 0x44, 0x89, 0x47, 0x85, 0x8f, 0x5a, 0xf5, 0x0c, 0xc2, 0xb1, 0xb7, 0x30, 0xdd, 0xf2, 0x96, 0x71, 0xa9, }, }, { "NIST CSRC example 2 (48-byte key)", t_seq8, 48, "Sample message for keylenblocklen */ "Sample message for keylen=blocklen", { 0x5b, 0x66, 0x44, 0x36, 0xdf, 0x69, 0xb0, 0xca, 0x22, 0x55, 0x12, 0x31, 0xa3, 0xf0, 0xa3, 0xd5, 0xb4, 0xf9, 0x79, 0x91, 0x71, 0x3c, 0xfa, 0x84, 0xbf, 0xf4, 0xd0, 0x79, 0x2e, 0xff, 0x96, 0xc2, 0x7d, 0xcc, 0xbb, 0xb6, 0xf7, 0x9b, 0x65, 0xd5, 0x48, 0xb4, 0x0e, 0x85, 0x64, 0xce, 0xf5, 0x94, }, }, { "NIST CSRC example 4 (49-byte key)", t_seq8, 49, "Sample message for keylenkey, vector->keylen, (const uint8_t *)vector->msg, strlen(vector->msg), mac); return (t_compare_mem(vector->mac, mac, HMAC_SHA384_MAC_LEN)); } /*************************************************************************** * Boilerplate */ int t_prepare(int argc, char *argv[]) { int i, n; (void)argc; (void)argv; n = sizeof t_hmac_sha384_vectors / sizeof t_hmac_sha384_vectors[0]; for (i = 0; i < n; ++i) t_add_test(t_hmac_sha384_vector, &t_hmac_sha384_vectors[i], t_hmac_sha384_vectors[i].desc); return (0); } void t_cleanup(void) { }