1 /* crypto/dh/dh_key.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
63 #include <openssl/bn.h>
64 #include <openssl/rand.h>
65 #include <openssl/dh.h>
67 static int generate_key(DH
*dh
);
68 static int compute_key(unsigned char *key
, const BIGNUM
*pub_key
, DH
*dh
);
69 static int dh_bn_mod_exp(const DH
*dh
, BIGNUM
*r
,
70 const BIGNUM
*a
, const BIGNUM
*p
,
71 const BIGNUM
*m
, BN_CTX
*ctx
,
73 static int dh_init(DH
*dh
);
74 static int dh_finish(DH
*dh
);
76 int DH_generate_key(DH
*dh
)
78 return dh
->meth
->generate_key(dh
);
81 int DH_compute_key(unsigned char *key
, const BIGNUM
*pub_key
, DH
*dh
)
83 return dh
->meth
->compute_key(key
, pub_key
, dh
);
86 int DH_compute_key_padded(unsigned char *key
, const BIGNUM
*pub_key
, DH
*dh
)
89 rv
= dh
->meth
->compute_key(key
, pub_key
, dh
);
92 pad
= BN_num_bytes(dh
->p
) - rv
;
95 memmove(key
+ pad
, key
, rv
);
101 static DH_METHOD dh_ossl
= {
113 const DH_METHOD
*DH_OpenSSL(void)
118 static int generate_key(DH
*dh
)
121 int generate_new_key
=0;
124 BN_MONT_CTX
*mont
=NULL
;
125 BIGNUM
*pub_key
=NULL
,*priv_key
=NULL
;
128 if (ctx
== NULL
) goto err
;
130 if (dh
->priv_key
== NULL
)
133 if (priv_key
== NULL
) goto err
;
137 priv_key
=dh
->priv_key
;
139 if (dh
->pub_key
== NULL
)
142 if (pub_key
== NULL
) goto err
;
148 if (dh
->flags
& DH_FLAG_CACHE_MONT_P
)
150 mont
= BN_MONT_CTX_set_locked(&dh
->method_mont_p
,
151 CRYPTO_LOCK_DH
, dh
->p
, ctx
);
156 if (generate_new_key
)
162 if (!BN_rand_range(priv_key
, dh
->q
))
165 while (BN_is_zero(priv_key
) || BN_is_one(priv_key
));
169 /* secret exponent length */
170 l
= dh
->length
? dh
->length
: BN_num_bits(dh
->p
)-1;
171 if (!BN_rand(priv_key
, l
, 0, 0)) goto err
;
179 if ((dh
->flags
& DH_FLAG_NO_EXP_CONSTTIME
) == 0)
183 BN_with_flags(prk
, priv_key
, BN_FLG_CONSTTIME
);
188 if (!dh
->meth
->bn_mod_exp(dh
, pub_key
, dh
->g
, prk
, dh
->p
, ctx
, mont
)) goto err
;
192 dh
->priv_key
=priv_key
;
196 DHerr(DH_F_GENERATE_KEY
,ERR_R_BN_LIB
);
198 if ((pub_key
!= NULL
) && (dh
->pub_key
== NULL
)) BN_free(pub_key
);
199 if ((priv_key
!= NULL
) && (dh
->priv_key
== NULL
)) BN_free(priv_key
);
204 static int compute_key(unsigned char *key
, const BIGNUM
*pub_key
, DH
*dh
)
207 BN_MONT_CTX
*mont
=NULL
;
212 if (BN_num_bits(dh
->p
) > OPENSSL_DH_MAX_MODULUS_BITS
)
214 DHerr(DH_F_COMPUTE_KEY
,DH_R_MODULUS_TOO_LARGE
);
219 if (ctx
== NULL
) goto err
;
221 tmp
= BN_CTX_get(ctx
);
223 if (dh
->priv_key
== NULL
)
225 DHerr(DH_F_COMPUTE_KEY
,DH_R_NO_PRIVATE_VALUE
);
229 if (dh
->flags
& DH_FLAG_CACHE_MONT_P
)
231 mont
= BN_MONT_CTX_set_locked(&dh
->method_mont_p
,
232 CRYPTO_LOCK_DH
, dh
->p
, ctx
);
233 if ((dh
->flags
& DH_FLAG_NO_EXP_CONSTTIME
) == 0)
236 BN_set_flags(dh
->priv_key
, BN_FLG_CONSTTIME
);
242 if (!DH_check_pub_key(dh
, pub_key
, &check_result
) || check_result
)
244 DHerr(DH_F_COMPUTE_KEY
,DH_R_INVALID_PUBKEY
);
248 if (!dh
->meth
->bn_mod_exp(dh
, tmp
, pub_key
, dh
->priv_key
,dh
->p
,ctx
,mont
))
250 DHerr(DH_F_COMPUTE_KEY
,ERR_R_BN_LIB
);
254 ret
=BN_bn2bin(tmp
,key
);
264 static int dh_bn_mod_exp(const DH
*dh
, BIGNUM
*r
,
265 const BIGNUM
*a
, const BIGNUM
*p
,
266 const BIGNUM
*m
, BN_CTX
*ctx
,
269 /* If a is only one word long and constant time is false, use the faster
270 * exponenentiation function.
272 if (a
->top
== 1 && ((dh
->flags
& DH_FLAG_NO_EXP_CONSTTIME
) != 0))
274 BN_ULONG A
= a
->d
[0];
275 return BN_mod_exp_mont_word(r
,A
,p
,m
,ctx
,m_ctx
);
278 return BN_mod_exp_mont(r
,a
,p
,m
,ctx
,m_ctx
);
282 static int dh_init(DH
*dh
)
284 dh
->flags
|= DH_FLAG_CACHE_MONT_P
;
288 static int dh_finish(DH
*dh
)
290 if(dh
->method_mont_p
)
291 BN_MONT_CTX_free(dh
->method_mont_p
);