blob: 1ee29fd4992bed81f46b0537618f0bedae4bf110 [file] [log] [blame]
Adam Langley95c29f32014-06-20 12:00:00 -07001/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
2 * All rights reserved.
3 *
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
7 *
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
14 *
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
21 *
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
24 * are met:
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
39 *
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
50 * SUCH DAMAGE.
51 *
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.]
56 */
57/* ====================================================================
58 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
59 *
60 * Redistribution and use in source and binary forms, with or without
61 * modification, are permitted provided that the following conditions
62 * are met:
63 *
64 * 1. Redistributions of source code must retain the above copyright
65 * notice, this list of conditions and the following disclaimer.
66 *
67 * 2. Redistributions in binary form must reproduce the above copyright
68 * notice, this list of conditions and the following disclaimer in
69 * the documentation and/or other materials provided with the
70 * distribution.
71 *
72 * 3. All advertising materials mentioning features or use of this
73 * software must display the following acknowledgment:
74 * "This product includes software developed by the OpenSSL Project
75 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
76 *
77 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
78 * endorse or promote products derived from this software without
79 * prior written permission. For written permission, please contact
80 * openssl-core@openssl.org.
81 *
82 * 5. Products derived from this software may not be called "OpenSSL"
83 * nor may "OpenSSL" appear in their names without prior written
84 * permission of the OpenSSL Project.
85 *
86 * 6. Redistributions of any form whatsoever must retain the following
87 * acknowledgment:
88 * "This product includes software developed by the OpenSSL Project
89 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
90 *
91 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
92 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
93 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
94 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
95 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
96 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
97 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
98 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
99 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
100 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
101 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
102 * OF THE POSSIBILITY OF SUCH DAMAGE.
103 * ====================================================================
104 *
105 * This product includes cryptographic software written by Eric Young
106 * (eay@cryptsoft.com). This product includes software written by Tim
107 * Hudson (tjh@cryptsoft.com).
108 *
109 */
110/* ====================================================================
111 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
112 *
113 * Portions of the attached software ("Contribution") are developed by
114 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
115 *
116 * The Contribution is licensed pursuant to the Eric Young open source
117 * license provided above.
118 *
119 * The binary polynomial arithmetic software is originally written by
120 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems
121 * Laboratories. */
122
123#ifndef OPENSSL_HEADER_BN_INTERNAL_H
124#define OPENSSL_HEADER_BN_INTERNAL_H
125
126#include <openssl/base.h>
127
Brian Smith926f2192016-02-03 20:26:25 -1000128#if defined(OPENSSL_X86_64) && defined(_MSC_VER)
David Benjamina353cdb2016-06-09 16:48:33 -0400129OPENSSL_MSVC_PRAGMA(warning(push, 3))
David Benjamin61f10852014-12-03 17:57:04 -0500130#include <intrin.h>
David Benjamina353cdb2016-06-09 16:48:33 -0400131OPENSSL_MSVC_PRAGMA(warning(pop))
David Benjamin61f10852014-12-03 17:57:04 -0500132#pragma intrinsic(__umulh, _umul128)
133#endif
134
Brian Smith24e42882016-01-26 15:16:37 -1000135#include "../internal.h"
136
Adam Langley95c29f32014-06-20 12:00:00 -0700137#if defined(__cplusplus)
138extern "C" {
139#endif
140
David Benjamin719220e2015-08-11 12:05:02 -0400141/* bn_expand acts the same as |bn_wexpand|, but takes a number of bits rather
Adam Langley95c29f32014-06-20 12:00:00 -0700142 * than a number of words. */
David Benjamin719220e2015-08-11 12:05:02 -0400143BIGNUM *bn_expand(BIGNUM *bn, size_t bits);
Adam Langley95c29f32014-06-20 12:00:00 -0700144
Adam Langley95c29f32014-06-20 12:00:00 -0700145#if defined(OPENSSL_64_BIT)
146
Adam Langley3e652652015-01-09 15:44:37 -0800147#if !defined(_MSC_VER)
148/* MSVC doesn't support two-word integers on 64-bit. */
Brian Smith24e42882016-01-26 15:16:37 -1000149#define BN_ULLONG uint128_t
Adam Langley3e652652015-01-09 15:44:37 -0800150#endif
151
Adam Langley3e652652015-01-09 15:44:37 -0800152#define BN_BITS2 64
Adam Langley95c29f32014-06-20 12:00:00 -0700153#define BN_BYTES 8
154#define BN_BITS4 32
David Benjamin81edc9b2015-11-18 15:57:00 -0500155#define BN_MASK2 (0xffffffffffffffffUL)
156#define BN_MASK2l (0xffffffffUL)
157#define BN_MASK2h (0xffffffff00000000UL)
158#define BN_MASK2h1 (0xffffffff80000000UL)
Brian Smith7fcbfdb2016-07-29 16:19:46 -1000159#define BN_MONT_CTX_N0_LIMBS 1
David Benjamin81edc9b2015-11-18 15:57:00 -0500160#define BN_TBIT (0x8000000000000000UL)
Adam Langley95c29f32014-06-20 12:00:00 -0700161#define BN_DEC_CONV (10000000000000000000UL)
Adam Langley95c29f32014-06-20 12:00:00 -0700162#define BN_DEC_NUM 19
David Benjamin35c8afd2016-10-24 15:25:11 -0400163#define TOBN(hi, lo) ((BN_ULONG)(hi) << 32 | (lo))
Adam Langley95c29f32014-06-20 12:00:00 -0700164
165#elif defined(OPENSSL_32_BIT)
166
Adam Langley3e652652015-01-09 15:44:37 -0800167#define BN_ULLONG uint64_t
Adam Langley3e652652015-01-09 15:44:37 -0800168#define BN_BITS2 32
Adam Langley95c29f32014-06-20 12:00:00 -0700169#define BN_BYTES 4
170#define BN_BITS4 16
David Benjamin81edc9b2015-11-18 15:57:00 -0500171#define BN_MASK2 (0xffffffffUL)
172#define BN_MASK2l (0xffffUL)
173#define BN_MASK2h1 (0xffff8000UL)
174#define BN_MASK2h (0xffff0000UL)
Brian Smith7fcbfdb2016-07-29 16:19:46 -1000175/* On some 32-bit platforms, Montgomery multiplication is done using 64-bit
176 * arithmetic with SIMD instructions. On such platforms, |BN_MONT_CTX::n0|
177 * needs to be two words long. Only certain 32-bit platforms actually make use
178 * of n0[1] and shorter R value would suffice for the others. However,
179 * currently only the assembly files know which is which. */
180#define BN_MONT_CTX_N0_LIMBS 2
David Benjamin81edc9b2015-11-18 15:57:00 -0500181#define BN_TBIT (0x80000000UL)
182#define BN_DEC_CONV (1000000000UL)
Adam Langley95c29f32014-06-20 12:00:00 -0700183#define BN_DEC_NUM 9
David Benjamin35c8afd2016-10-24 15:25:11 -0400184#define TOBN(hi, lo) (lo), (hi)
Adam Langley95c29f32014-06-20 12:00:00 -0700185
186#else
187#error "Must define either OPENSSL_32_BIT or OPENSSL_64_BIT"
188#endif
189
Brian Smith7af36e12015-11-17 22:00:09 -1000190
David Benjaminb1133e92016-10-18 13:05:01 -0400191#define STATIC_BIGNUM(x) \
192 { \
193 (BN_ULONG *)(x), sizeof(x) / sizeof(BN_ULONG), \
194 sizeof(x) / sizeof(BN_ULONG), 0, BN_FLG_STATIC_DATA \
Brian Smith7af36e12015-11-17 22:00:09 -1000195 }
196
David Benjamin81edc9b2015-11-18 15:57:00 -0500197#if defined(BN_ULLONG)
Adam Langley3e652652015-01-09 15:44:37 -0800198#define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
199#define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
200#endif
201
Brian Smithd279a212016-03-08 17:09:40 -1000202/* bn_set_words sets |bn| to the value encoded in the |num| words in |words|,
203 * least significant word first. */
204int bn_set_words(BIGNUM *bn, const BN_ULONG *words, size_t num);
205
Adam Langley95c29f32014-06-20 12:00:00 -0700206BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
207BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
208void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
Adam Langley95c29f32014-06-20 12:00:00 -0700209BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
210BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
211
212void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
213void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
214void bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a);
215void bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a);
216
217/* bn_cmp_words returns a value less than, equal to or greater than zero if
218 * the, length |n|, array |a| is less than, equal to or greater than |b|. */
219int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n);
220
221/* bn_cmp_words returns a value less than, equal to or greater than zero if the
222 * array |a| is less than, equal to or greater than |b|. The arrays can be of
223 * different lengths: |cl| gives the minimum of the two lengths and |dl| gives
224 * the length of |a| minus the length of |b|. */
225int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl);
226
227int bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
228 const BN_ULONG *np, const BN_ULONG *n0, int num);
229
Brian Smith7fcbfdb2016-07-29 16:19:46 -1000230uint64_t bn_mont_n0(const BIGNUM *n);
Brian Smith16bfff72016-08-19 13:58:40 -1000231int bn_mod_exp_base_2_vartime(BIGNUM *r, unsigned p, const BIGNUM *n);
Brian Smith7fcbfdb2016-07-29 16:19:46 -1000232
Brian Smithf98be212016-02-03 21:12:08 -1000233#if defined(OPENSSL_X86_64) && defined(_MSC_VER)
Brian Smitha051bdd2016-02-03 21:12:37 -1000234#define BN_UMULT_LOHI(low, high, a, b) ((low) = _umul128((a), (b), &(high)))
235#endif
236
237#if !defined(BN_ULLONG) && !defined(BN_UMULT_LOHI)
238#error "Either BN_ULLONG or BN_UMULT_LOHI must be defined on every platform."
Adam Langley95c29f32014-06-20 12:00:00 -0700239#endif
240
David Benjamin0b8dc302016-12-17 14:27:16 -0500241/* bn_mod_inverse_prime sets |out| to the modular inverse of |a| modulo |p|,
242 * computed with Fermat's Little Theorem. It returns one on success and zero on
243 * error. If |mont_p| is NULL, one will be computed temporarily. */
244int bn_mod_inverse_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
245 BN_CTX *ctx, const BN_MONT_CTX *mont_p);
246
247/* bn_mod_inverse_secret_prime behaves like |bn_mod_inverse_prime| but uses
248 * |BN_mod_exp_mont_consttime| instead of |BN_mod_exp_mont| in hopes of
249 * protecting the exponent. */
250int bn_mod_inverse_secret_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
251 BN_CTX *ctx, const BN_MONT_CTX *mont_p);
252
Adam Langley95c29f32014-06-20 12:00:00 -0700253
254#if defined(__cplusplus)
255} /* extern C */
256#endif
257
258#endif /* OPENSSL_HEADER_BN_INTERNAL_H */