Secure Programming Cookbook for C and C++: Recipes for Cryptography, Authentication, Input Validation & More

6.8.1 Problem

You want to harden a hash function against birthday attacks instead of switching to an algorithm with a longer digest.

6.8.2 Solution

Use a nonce or salt before and after your message (preferably a securely generated random salt), padding the nonce to the internal block size of the hash function.

6.8.3 Discussion

In most cases, when using a nonce or salt with a hash function, where the nonce is as large as the output length of the hash function, you double the effective strength of the hash function in circumstances where a birthday attack would apply. Even smaller nonces help improve security.

To ensure the best security, we strongly recommend that you follow these steps:

1. Select a nonce using a well-seeded cryptographic random number generator (see Chapter 11). If you're going to have multiple messages to process, select a random portion that is common to all messages (at least 64 bits) and use a counter for the rest. (The counter should be big enough to handle any possible number of messages. Here we also recommend dedicating at least 64 bits.)

2. Determine the internal block length of the hash function (discussed later in this section).

3. Pad the nonce to the internal block length by adding as many zero-bytes as necessary.

4. Add the padded nonce to both the beginning and the end of the message.

5. Hash, creating a value V.

6. Hash V to get the final output. This final step protects against length-extension attacks, as discussed in Recipe 6.7.

One thing that you need to be sure to avoid is a situation in which the attacker can control the nonce value. A nonce works well only if it cannot be reused. If an attacker can control the nonce, he can generally guarantee it gets reused, in which case problems like the birthday attack still apply.

In cases where having a nonce that the attacker can't control isn't appropriate, you can probably live with birthday attacks if you're using SHA1 or better. To protect against other attacks without using a nonce, see Recipe 6.7.

All hash functions have a compression function as an element. The size to which that function compresses is the internal block size of the function, and it is usually larger than the actual digest value. For hash functions based on block ciphers, the internal block size is the output length of the hash function (and the compression function is usually built around XOR'ing multiple pieces of block-sized data). Table 6-4 lists the internal block sizes of common message digest functions not based on block ciphers.

Here's a pair of functions that do all-in-one wrapping of the OpenSSL EVP message digest interface:

#include <openssl/evp.h> #include <openssl/rand.h> #include <string.h> unsigned char *spc_create_nonced_digest(EVP_MD *type, unsigned char *in, unsigned long n, unsigned int *outlen) { int bsz, dlen; EVP_MD_CTX ctx; unsigned char *pad, *ret; EVP_DigestInit(&ctx, type); dlen = EVP_MD_CTX_size(&ctx); if (!(ret = (unsigned char *)malloc(dlen * 2))) return 0; RAND_bytes(ret, dlen); EVP_DigestUpdate(&ctx, ret, dlen); bsz = EVP_MD_CTX_block_size(&ctx); if (!(pad = (unsigned char *)malloc(bsz - dlen))) { free(ret); return 0; } memset(pad, 0, bsz - dlen); EVP_DigestUpdate(&ctx, pad, bsz - dlen); EVP_DigestUpdate(&ctx, in, n); EVP_DigestUpdate(&ctx, ret, dlen); EVP_DigestUpdate(&ctx, pad, bsz - dlen); free(pad); EVP_DigestFinal(&ctx, ret + dlen, outlen); *outlen *= 2; return ret; } int spc_verify_nonced_digest(EVP_MD *type, unsigned char *in, unsigned long n, unsigned char *toverify) { int dlen, outlen, bsz, i; EVP_MD_CTX ctx; unsigned char *pad, *vfy; EVP_DigestInit(&ctx, type); bsz = EVP_MD_CTX_block_size(&ctx); dlen = EVP_MD_CTX_size(&ctx); EVP_DigestUpdate(&ctx, toverify, dlen); if (!(pad = (unsigned char *)malloc(bsz - dlen))) return 0; memset(pad, 0, bsz - dlen); EVP_DigestUpdate(&ctx, pad, bsz - dlen); EVP_DigestUpdate(&ctx, in, n); EVP_DigestUpdate(&ctx, toverify, dlen); EVP_DigestUpdate(&ctx, pad, bsz - dlen); free(pad); if (!(vfy = (unsigned char *)malloc(dlen))) return 0; EVP_DigestFinal(&ctx, vfy, &outlen); in += dlen; for (i = 0; i < dlen; i++) if (vfy[i] != toverify[i + dlen]) { free(vfy); return 0; } free(vfy); return 1; }

The first function, spc_create_nonced_digest( ), automatically selects a nonce from the OpenSSL random number generator and returns twice the digest size in output, where the first digest-sized block is the nonce and the second is the hash. The second function, spc_verify_nonced_digest( ), takes data consisting of a nonce concatenated with a hash value, and returns 1 if the hash validates, and 0 otherwise.

Two macros can make extracting the nonce and the hash easier:

#include <stdio.h> #include <string.h> #include <openssl/evp.h> /* Here, l is the output length of spc_create_nonced_digest( ) */ #define spc_extract_nonce(l, s) (s) #define spc_extract_digest(l, s) ((s)+((l) / 2))

Here's a sample program using this API:

int main(int argc, char *argv[ ]) { unsigned int i, ol; unsigned char *s = "Testing hashes with nonces."; unsigned char *dgst, *nonce, *ret; ret = spc_create_nonced_digest(EVP_sha1( ), s, strlen(s), &ol); nonce = spc_extract_nonce(ol, ret); dgst = spc_extract_digest(ol, ret); printf("Nonce = "); for(i = 0; i < ol / 2; i++) printf("%02x", nonce[i]); printf("\nSHA1-Nonced(Nonce, \"%s\") = \n\t", s); for(i = 0; i < ol / 2; i++) printf("%02x", dgst[i]); printf("\n"); if (spc_verify_nonced_digest(EVP_sha1( ), s, strlen(s), ret)) printf("Recalculation verified integrity.\n"); else printf("Recalculation FAILED to match.\n"); return 0; }

6.8.4 See Also

Recipe 6.7