Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/dh/dh_gen.c	Lines:	28	34	82.4 %
Date:	2017-11-07	Branches:	21	44	47.7 %


/* $OpenBSD: dh_gen.c,v 1.16 2017/01/29 17:49:22 beck Exp $ */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * 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 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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

/* NB: These functions have been upgraded - the previous prototypes are in
 * dh_depr.c as wrappers to these ones.
 *  - Geoff
 */

#include <stdio.h>

#include <openssl/bn.h>
#include <openssl/dh.h>
#include <openssl/err.h>

static int dh_builtin_genparams(DH *ret, int prime_len, int generator,
	    BN_GENCB *cb);

int
DH_generate_parameters_ex(DH *ret, int prime_len, int generator, BN_GENCB *cb)
{
	if (ret->meth->generate_params)
		return ret->meth->generate_params(ret, prime_len, generator, cb);
	return dh_builtin_genparams(ret, prime_len, generator, cb);
}

/*
 * We generate DH parameters as follows:
 * find a prime q which is prime_len/2 bits long.
 * p=(2*q)+1 or (p-1)/2 = q
 * For this case, g is a generator if
 * g^((p-1)/q) mod p != 1 for values of q which are the factors of p-1.
 * Since the factors of p-1 are q and 2, we just need to check
 * g^2 mod p != 1 and g^q mod p != 1.
 *
 * Having said all that,
 * there is another special case method for the generators 2, 3 and 5.
 * for 2, p mod 24 == 11
 * for 3, p mod 12 == 5  <<<<< does not work for safe primes.
 * for 5, p mod 10 == 3 or 7
 *
 * Thanks to Phil Karn <karn@qualcomm.com> for the pointers about the
 * special generators and for answering some of my questions.
 *
 * I've implemented the second simple method :-).
 * Since DH should be using a safe prime (both p and q are prime),
 * this generator function can take a very very long time to run.
 */
/* Actually there is no reason to insist that 'generator' be a generator.
 * It's just as OK (and in some sense better) to use a generator of the
 * order-q subgroup.
 */
static int
dh_builtin_genparams(DH *ret, int prime_len, int generator, BN_GENCB *cb)
{
	BIGNUM *t1, *t2;
	int g, ok = -1;
	BN_CTX *ctx = NULL;

	ctx = BN_CTX_new();
	if (ctx == NULL)
		goto err;
	BN_CTX_start(ctx);
	if ((t1 = BN_CTX_get(ctx)) == NULL)
		goto err;
	if ((t2 = BN_CTX_get(ctx)) == NULL)
		goto err;

	/* Make sure 'ret' has the necessary elements */
	if (!ret->p && ((ret->p = BN_new()) == NULL))
		goto err;
	if (!ret->g && ((ret->g = BN_new()) == NULL))
		goto err;

	if (generator <= 1) {
		DHerror(DH_R_BAD_GENERATOR);
		goto err;
	}
	if (generator == DH_GENERATOR_2) {
		if (!BN_set_word(t1, 24))
			goto err;
		if (!BN_set_word(t2, 11))
			goto err;
		g = 2;
	} else if (generator == DH_GENERATOR_5) {
		if (!BN_set_word(t1, 10))
			goto err;
		if (!BN_set_word(t2, 3))
			goto err;
		/* BN_set_word(t3,7); just have to miss
		 * out on these ones :-( */
		g = 5;
	} else {
		/*
		 * in the general case, don't worry if 'generator' is a
		 * generator or not: since we are using safe primes,
		 * it will generate either an order-q or an order-2q group,
		 * which both is OK
		 */
		if (!BN_set_word(t1, 2))
			goto err;
		if (!BN_set_word(t2, 1))
			goto err;
		g = generator;
	}

	if (!BN_generate_prime_ex(ret->p, prime_len, 1, t1, t2, cb))
		goto err;
	if (!BN_GENCB_call(cb, 3, 0))
		goto err;
	if (!BN_set_word(ret->g, g))
		goto err;
	ok = 1;
err:
	if (ok == -1) {
		DHerror(ERR_R_BN_LIB);
		ok = 0;
	}

	if (ctx != NULL) {
		BN_CTX_end(ctx);
		BN_CTX_free(ctx);
	}
	return ok;
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: dh_gen.c,v 1.16 2017/01/29 17:49:22 beck Exp $ */
2			/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3			* All rights reserved.
4			*
5			* This package is an SSL implementation written
6			* by Eric Young (eay@cryptsoft.com).
7			* The implementation was written so as to conform with Netscapes SSL.
8			*
9			* This library is free for commercial and non-commercial use as long as
10			* the following conditions are aheared to. The following conditions
11			* apply to all code found in this distribution, be it the RC4, RSA,
12			* lhash, DES, etc., code; not just the SSL code. The SSL documentation
13			* included with this distribution is covered by the same copyright terms
14			* except that the holder is Tim Hudson (tjh@cryptsoft.com).
15			*
16			* Copyright remains Eric Young's, and as such any Copyright notices in
17			* the code are not to be removed.
18			* If this package is used in a product, Eric Young should be given attribution
19			* as the author of the parts of the library used.
20			* This can be in the form of a textual message at program startup or
21			* in documentation (online or textual) provided with the package.
22			*
23			* Redistribution and use in source and binary forms, with or without
24			* modification, are permitted provided that the following conditions
25			* are met:
26			* 1. Redistributions of source code must retain the copyright
27			* notice, this list of conditions and the following disclaimer.
28			* 2. Redistributions in binary form must reproduce the above copyright
29			* notice, this list of conditions and the following disclaimer in the
30			* documentation and/or other materials provided with the distribution.
31			* 3. All advertising materials mentioning features or use of this software
32			* must display the following acknowledgement:
33			* "This product includes cryptographic software written by
34			* Eric Young (eay@cryptsoft.com)"
35			* The word 'cryptographic' can be left out if the rouines from the library
36			* being used are not cryptographic related :-).
37			* 4. If you include any Windows specific code (or a derivative thereof) from
38			* the apps directory (application code) you must include an acknowledgement:
39			* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40			*
41			* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44			* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51			* SUCH DAMAGE.
52			*
53			* The licence and distribution terms for any publically available version or
54			* derivative of this code cannot be changed. i.e. this code cannot simply be
55			* copied and put under another distribution licence
56			* [including the GNU Public Licence.]
57			*/
58
59			/* NB: These functions have been upgraded - the previous prototypes are in
60			* dh_depr.c as wrappers to these ones.
61			* - Geoff
62			*/
63
64			#include <stdio.h>
65
66			#include <openssl/bn.h>
67			#include <openssl/dh.h>
68			#include <openssl/err.h>
69
70			static int dh_builtin_genparams(DH *ret, int prime_len, int generator,
71			BN_GENCB *cb);
72
73			int
74			DH_generate_parameters_ex(DH ret, int prime_len, int generator, BN_GENCB cb)
75			{
76	✗✓	228	if (ret->meth->generate_params)
77			return ret->meth->generate_params(ret, prime_len, generator, cb);
78		114	return dh_builtin_genparams(ret, prime_len, generator, cb);
79		114	}
80
81			/*
82			* We generate DH parameters as follows:
83			* find a prime q which is prime_len/2 bits long.
84			* p=(2*q)+1 or (p-1)/2 = q
85			* For this case, g is a generator if
86			* g^((p-1)/q) mod p != 1 for values of q which are the factors of p-1.
87			* Since the factors of p-1 are q and 2, we just need to check
88			* g^2 mod p != 1 and g^q mod p != 1.
89			*
90			* Having said all that,
91			* there is another special case method for the generators 2, 3 and 5.
92			* for 2, p mod 24 == 11
93			* for 3, p mod 12 == 5 <<<<< does not work for safe primes.
94			* for 5, p mod 10 == 3 or 7
95			*
96			* Thanks to Phil Karn <karn@qualcomm.com> for the pointers about the
97			* special generators and for answering some of my questions.
98			*
99			* I've implemented the second simple method :-).
100			* Since DH should be using a safe prime (both p and q are prime),
101			* this generator function can take a very very long time to run.
102			*/
103			/* Actually there is no reason to insist that 'generator' be a generator.
104			* It's just as OK (and in some sense better) to use a generator of the
105			* order-q subgroup.
106			*/
107			static int
108			dh_builtin_genparams(DH ret, int prime_len, int generator, BN_GENCB cb)
109			{
110			BIGNUM t1, t2;
111			int g, ok = -1;
112			BN_CTX *ctx = NULL;
113
114		228	ctx = BN_CTX_new();
115	✓✗	114	if (ctx == NULL)
116			goto err;
117		114	BN_CTX_start(ctx);
118	✓✗	114	if ((t1 = BN_CTX_get(ctx)) == NULL)
119			goto err;
120	✓✗	114	if ((t2 = BN_CTX_get(ctx)) == NULL)
121			goto err;
122
123			/* Make sure 'ret' has the necessary elements */
124	✓✗✓✗	228	if (!ret->p && ((ret->p = BN_new()) == NULL))
125			goto err;
126	✓✗✓✗	228	if (!ret->g && ((ret->g = BN_new()) == NULL))
127			goto err;
128
129	✗✓	114	if (generator <= 1) {
130			DHerror(DH_R_BAD_GENERATOR);
131			goto err;
132			}
133	✓✓	114	if (generator == DH_GENERATOR_2) {
134	✓✗	108	if (!BN_set_word(t1, 24))
135			goto err;
136	✓✗	108	if (!BN_set_word(t2, 11))
137			goto err;
138			g = 2;
139	✓✗	114	} else if (generator == DH_GENERATOR_5) {
140	✓✗	6	if (!BN_set_word(t1, 10))
141			goto err;
142	✓✗	6	if (!BN_set_word(t2, 3))
143			goto err;
144			/* BN_set_word(t3,7); just have to miss
145			* out on these ones :-( */
146			g = 5;
147		6	} else {
148			/*
149			* in the general case, don't worry if 'generator' is a
150			* generator or not: since we are using safe primes,
151			* it will generate either an order-q or an order-2q group,
152			* which both is OK
153			*/
154			if (!BN_set_word(t1, 2))
155			goto err;
156			if (!BN_set_word(t2, 1))
157			goto err;
158			g = generator;
159			}
160
161	✓✗	114	if (!BN_generate_prime_ex(ret->p, prime_len, 1, t1, t2, cb))
162			goto err;
163	✓✗	114	if (!BN_GENCB_call(cb, 3, 0))
164			goto err;
165	✓✗	114	if (!BN_set_word(ret->g, g))
166			goto err;
167		114	ok = 1;
168			err:
169	✗✓	114	if (ok == -1) {
170			DHerror(ERR_R_BN_LIB);
171			ok = 0;
172			}
173
174	✓✗	114	if (ctx != NULL) {
175		114	BN_CTX_end(ctx);
176		114	BN_CTX_free(ctx);
177		114	}
178		114	return ok;
179			}