Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libutil/bcrypt_pbkdf.c	Lines:	67	69	97.1 %
Date:	2017-11-07	Branches:	22	24	91.7 %


/* $OpenBSD: bcrypt_pbkdf.c,v 1.13 2015/01/12 03:20:04 tedu Exp $ */
/*
 * Copyright (c) 2013 Ted Unangst <tedu@openbsd.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <sys/types.h>

#include <stdint.h>
#include <stdlib.h>
#include <blf.h>
#include <sha2.h>
#include <string.h>
#include <util.h>

#define	MINIMUM(a,b) (((a) < (b)) ? (a) : (b))

/*
 * pkcs #5 pbkdf2 implementation using the "bcrypt" hash
 *
 * The bcrypt hash function is derived from the bcrypt password hashing
 * function with the following modifications:
 * 1. The input password and salt are preprocessed with SHA512.
 * 2. The output length is expanded to 256 bits.
 * 3. Subsequently the magic string to be encrypted is lengthened and modifed
 *    to "OxychromaticBlowfishSwatDynamite"
 * 4. The hash function is defined to perform 64 rounds of initial state
 *    expansion. (More rounds are performed by iterating the hash.)
 *
 * Note that this implementation pulls the SHA512 operations into the caller
 * as a performance optimization.
 *
 * One modification from official pbkdf2. Instead of outputting key material
 * linearly, we mix it. pbkdf2 has a known weakness where if one uses it to
 * generate (e.g.) 512 bits of key material for use as two 256 bit keys, an
 * attacker can merely run once through the outer loop, but the user
 * always runs it twice. Shuffling output bytes requires computing the
 * entirety of the key material to assemble any subkey. This is something a
 * wise caller could do; we just do it for you.
 */

#define BCRYPT_WORDS 8
#define BCRYPT_HASHSIZE (BCRYPT_WORDS * 4)

static void
bcrypt_hash(uint8_t *sha2pass, uint8_t *sha2salt, uint8_t *out)
{
	blf_ctx state;
	uint8_t ciphertext[BCRYPT_HASHSIZE] =
	    "OxychromaticBlowfishSwatDynamite";
	uint32_t cdata[BCRYPT_WORDS];
	int i;
	uint16_t j;
	size_t shalen = SHA512_DIGEST_LENGTH;

	/* key expansion */
	Blowfish_initstate(&state);
	Blowfish_expandstate(&state, sha2salt, shalen, sha2pass, shalen);
	for (i = 0; i < 64; i++) {
		Blowfish_expand0state(&state, sha2salt, shalen);
		Blowfish_expand0state(&state, sha2pass, shalen);
	}

	/* encryption */
	j = 0;
	for (i = 0; i < BCRYPT_WORDS; i++)
		cdata[i] = Blowfish_stream2word(ciphertext, sizeof(ciphertext),
		    &j);
	for (i = 0; i < 64; i++)
		blf_enc(&state, cdata, sizeof(cdata) / sizeof(uint64_t));

	/* copy out */
	for (i = 0; i < BCRYPT_WORDS; i++) {
		out[4 * i + 3] = (cdata[i] >> 24) & 0xff;
		out[4 * i + 2] = (cdata[i] >> 16) & 0xff;
		out[4 * i + 1] = (cdata[i] >> 8) & 0xff;
		out[4 * i + 0] = cdata[i] & 0xff;
	}

	/* zap */
	explicit_bzero(ciphertext, sizeof(ciphertext));
	explicit_bzero(cdata, sizeof(cdata));
	explicit_bzero(&state, sizeof(state));
}

int
bcrypt_pbkdf(const char *pass, size_t passlen, const uint8_t *salt, size_t saltlen,
    uint8_t *key, size_t keylen, unsigned int rounds)
{
	SHA2_CTX ctx;
	uint8_t sha2pass[SHA512_DIGEST_LENGTH];
	uint8_t sha2salt[SHA512_DIGEST_LENGTH];
	uint8_t out[BCRYPT_HASHSIZE];
	uint8_t tmpout[BCRYPT_HASHSIZE];
	uint8_t countsalt[4];
	size_t i, j, amt, stride;
	uint32_t count;
	size_t origkeylen = keylen;

	/* nothing crazy */
	if (rounds < 1)
		return -1;
	if (passlen == 0 || saltlen == 0 || keylen == 0 ||
	    keylen > sizeof(out) * sizeof(out))
		return -1;
	stride = (keylen + sizeof(out) - 1) / sizeof(out);
	amt = (keylen + stride - 1) / stride;

	/* collapse password */
	SHA512Init(&ctx);
	SHA512Update(&ctx, pass, passlen);
	SHA512Final(sha2pass, &ctx);


	/* generate key, sizeof(out) at a time */
	for (count = 1; keylen > 0; count++) {
		countsalt[0] = (count >> 24) & 0xff;
		countsalt[1] = (count >> 16) & 0xff;
		countsalt[2] = (count >> 8) & 0xff;
		countsalt[3] = count & 0xff;

		/* first round, salt is salt */
		SHA512Init(&ctx);
		SHA512Update(&ctx, salt, saltlen);
		SHA512Update(&ctx, countsalt, sizeof(countsalt));
		SHA512Final(sha2salt, &ctx);
		bcrypt_hash(sha2pass, sha2salt, tmpout);
		memcpy(out, tmpout, sizeof(out));

		for (i = 1; i < rounds; i++) {
			/* subsequent rounds, salt is previous output */
			SHA512Init(&ctx);
			SHA512Update(&ctx, tmpout, sizeof(tmpout));
			SHA512Final(sha2salt, &ctx);
			bcrypt_hash(sha2pass, sha2salt, tmpout);
			for (j = 0; j < sizeof(out); j++)
				out[j] ^= tmpout[j];
		}

		/*
		 * pbkdf2 deviation: output the key material non-linearly.
		 */
		amt = MINIMUM(amt, keylen);
		for (i = 0; i < amt; i++) {
			size_t dest = i * stride + (count - 1);
			if (dest >= origkeylen)
				break;
			key[dest] = out[i];
		}
		keylen -= i;
	}

	/* zap */
	explicit_bzero(&ctx, sizeof(ctx));
	explicit_bzero(out, sizeof(out));

	return 0;
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: bcrypt_pbkdf.c,v 1.13 2015/01/12 03:20:04 tedu Exp $ */
2			/*
3			* Copyright (c) 2013 Ted Unangst <tedu@openbsd.org>
4			*
5			* Permission to use, copy, modify, and distribute this software for any
6			* purpose with or without fee is hereby granted, provided that the above
7			* copyright notice and this permission notice appear in all copies.
8			*
9			* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10			* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11			* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12			* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13			* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14			* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15			* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16			*/
17
18			#include <sys/types.h>
19
20			#include <stdint.h>
21			#include <stdlib.h>
22			#include <blf.h>
23			#include <sha2.h>
24			#include <string.h>
25			#include <util.h>
26
27			#define MINIMUM(a,b) (((a) < (b)) ? (a) : (b))
28
29			/*
30			* pkcs #5 pbkdf2 implementation using the "bcrypt" hash
31			*
32			* The bcrypt hash function is derived from the bcrypt password hashing
33			* function with the following modifications:
34			* 1. The input password and salt are preprocessed with SHA512.
35			* 2. The output length is expanded to 256 bits.
36			* 3. Subsequently the magic string to be encrypted is lengthened and modifed
37			* to "OxychromaticBlowfishSwatDynamite"
38			* 4. The hash function is defined to perform 64 rounds of initial state
39			* expansion. (More rounds are performed by iterating the hash.)
40			*
41			* Note that this implementation pulls the SHA512 operations into the caller
42			* as a performance optimization.
43			*
44			* One modification from official pbkdf2. Instead of outputting key material
45			* linearly, we mix it. pbkdf2 has a known weakness where if one uses it to
46			* generate (e.g.) 512 bits of key material for use as two 256 bit keys, an
47			* attacker can merely run once through the outer loop, but the user
48			* always runs it twice. Shuffling output bytes requires computing the
49			* entirety of the key material to assemble any subkey. This is something a
50			* wise caller could do; we just do it for you.
51			*/
52
53			#define BCRYPT_WORDS 8
54			#define BCRYPT_HASHSIZE (BCRYPT_WORDS * 4)
55
56			static void
57			bcrypt_hash(uint8_t sha2pass, uint8_t sha2salt, uint8_t *out)
58			{
59		1392	blf_ctx state;
60		696	uint8_t ciphertext[BCRYPT_HASHSIZE] =
61			"OxychromaticBlowfishSwatDynamite";
62		696	uint32_t cdata[BCRYPT_WORDS];
63			int i;
64		696	uint16_t j;
65			size_t shalen = SHA512_DIGEST_LENGTH;
66
67			/* key expansion */
68		696	Blowfish_initstate(&state);
69		696	Blowfish_expandstate(&state, sha2salt, shalen, sha2pass, shalen);
70	✓✓	90480	for (i = 0; i < 64; i++) {
71		44544	Blowfish_expand0state(&state, sha2salt, shalen);
72		44544	Blowfish_expand0state(&state, sha2pass, shalen);
73			}
74
75			/* encryption */
76		696	j = 0;
77	✓✓	12528	for (i = 0; i < BCRYPT_WORDS; i++)
78		5568	cdata[i] = Blowfish_stream2word(ciphertext, sizeof(ciphertext),
79			&j);
80	✓✓	90480	for (i = 0; i < 64; i++)
81		44544	blf_enc(&state, cdata, sizeof(cdata) / sizeof(uint64_t));
82
83			/* copy out */
84	✓✓	12528	for (i = 0; i < BCRYPT_WORDS; i++) {
85		5568	out[4 * i + 3] = (cdata[i] >> 24) & 0xff;
86		5568	out[4 * i + 2] = (cdata[i] >> 16) & 0xff;
87		5568	out[4 * i + 1] = (cdata[i] >> 8) & 0xff;
88		5568	out[4 * i + 0] = cdata[i] & 0xff;
89			}
90
91			/* zap */
92		696	explicit_bzero(ciphertext, sizeof(ciphertext));
93		696	explicit_bzero(cdata, sizeof(cdata));
94		696	explicit_bzero(&state, sizeof(state));
95		696	}
96
97			int
98			bcrypt_pbkdf(const char pass, size_t passlen, const uint8_t salt, size_t saltlen,
99			uint8_t *key, size_t keylen, unsigned int rounds)
100			{
101		96	SHA2_CTX ctx;
102		48	uint8_t sha2pass[SHA512_DIGEST_LENGTH];
103		48	uint8_t sha2salt[SHA512_DIGEST_LENGTH];
104		48	uint8_t out[BCRYPT_HASHSIZE];
105		48	uint8_t tmpout[BCRYPT_HASHSIZE];
106		48	uint8_t countsalt[4];
107			size_t i, j, amt, stride;
108			uint32_t count;
109			size_t origkeylen = keylen;
110
111			/* nothing crazy */
112	✗✓	48	if (rounds < 1)
113			return -1;
114	✗✓	96	if (passlen == 0 \|\| saltlen == 0 \|\| keylen == 0 \|\|
115		48	keylen > sizeof(out) * sizeof(out))
116			return -1;
117		48	stride = (keylen + sizeof(out) - 1) / sizeof(out);
118		48	amt = (keylen + stride - 1) / stride;
119
120			/* collapse password */
121		48	SHA512Init(&ctx);
122		48	SHA512Update(&ctx, pass, passlen);
123		48	SHA512Final(sha2pass, &ctx);
124
125
126			/* generate key, sizeof(out) at a time */
127	✓✓	272	for (count = 1; keylen > 0; count++) {
128		88	countsalt[0] = (count >> 24) & 0xff;
129		88	countsalt[1] = (count >> 16) & 0xff;
130		88	countsalt[2] = (count >> 8) & 0xff;
131		88	countsalt[3] = count & 0xff;
132
133			/* first round, salt is salt */
134		88	SHA512Init(&ctx);
135		88	SHA512Update(&ctx, salt, saltlen);
136		88	SHA512Update(&ctx, countsalt, sizeof(countsalt));
137		88	SHA512Final(sha2salt, &ctx);
138		88	bcrypt_hash(sha2pass, sha2salt, tmpout);
139		88	memcpy(out, tmpout, sizeof(out));
140
141	✓✓	1392	for (i = 1; i < rounds; i++) {
142			/* subsequent rounds, salt is previous output */
143		608	SHA512Init(&ctx);
144		608	SHA512Update(&ctx, tmpout, sizeof(tmpout));
145		608	SHA512Final(sha2salt, &ctx);
146		608	bcrypt_hash(sha2pass, sha2salt, tmpout);
147	✓✓	40128	for (j = 0; j < sizeof(out); j++)
148		19456	out[j] ^= tmpout[j];
149			}
150
151			/*
152			* pbkdf2 deviation: output the key material non-linearly.
153			*/
154		88	amt = MINIMUM(amt, keylen);
155	✓✓	4848	for (i = 0; i < amt; i++) {
156		2340	size_t dest = i * stride + (count - 1);
157	✓✓	2340	if (dest >= origkeylen)
158		4	break;
159		2336	key[dest] = out[i];
160	✓✓	2336	}
161		88	keylen -= i;
162			}
163
164			/* zap */
165		48	explicit_bzero(&ctx, sizeof(ctx));
166		48	explicit_bzero(out, sizeof(out));
167
168		48	return 0;
169		48	}