blob: a61e5cfa7b55f0a62ed2012a3c95e30346b7d5c4 [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_H
124#define OPENSSL_HEADER_BN_H
125
126#include <openssl/base.h>
Adam Langley683d7bd2015-04-13 11:04:14 -0700127#include <openssl/thread.h>
Adam Langley95c29f32014-06-20 12:00:00 -0700128
Matt Braithwaitee7b32c32015-04-30 13:02:30 -0700129#include <inttypes.h> /* for PRIu64 and friends */
Adam Langley95c29f32014-06-20 12:00:00 -0700130#include <stdio.h> /* for FILE* */
131
132#if defined(__cplusplus)
133extern "C" {
134#endif
135
136
137/* BN provides support for working with arbitary sized integers. For example,
138 * although the largest integer supported by the compiler might be 64 bits, BN
139 * will allow you to work with numbers until you run out of memory. */
140
141
David Benjaminc561aa62015-05-09 01:38:06 -0400142/* BN_ULONG is the native word size when working with big integers.
143 *
144 * Note: on some platforms, inttypes.h does not define print format macros in
145 * C++ unless |__STDC_FORMAT_MACROS| defined. As this is a public header, bn.h
146 * does not define |__STDC_FORMAT_MACROS| itself. C++ source files which use the
147 * FMT macros must define it externally. */
Adam Langley95c29f32014-06-20 12:00:00 -0700148#if defined(OPENSSL_64_BIT)
149#define BN_ULONG uint64_t
150#define BN_BITS2 64
Matt Braithwaitee7b32c32015-04-30 13:02:30 -0700151#define BN_DEC_FMT1 "%" PRIu64
152#define BN_DEC_FMT2 "%019" PRIu64
153#define BN_HEX_FMT1 "%" PRIx64
Adam Langley95c29f32014-06-20 12:00:00 -0700154#elif defined(OPENSSL_32_BIT)
155#define BN_ULONG uint32_t
156#define BN_BITS2 32
Matt Braithwaitee7b32c32015-04-30 13:02:30 -0700157#define BN_DEC_FMT1 "%" PRIu32
158#define BN_DEC_FMT2 "%09" PRIu32
159#define BN_HEX_FMT1 "%" PRIx32
Adam Langley95c29f32014-06-20 12:00:00 -0700160#else
161#error "Must define either OPENSSL_32_BIT or OPENSSL_64_BIT"
162#endif
163
164
165/* Allocation and freeing. */
166
167/* BN_new creates a new, allocated BIGNUM and initialises it. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700168OPENSSL_EXPORT BIGNUM *BN_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700169
170/* BN_init initialises a stack allocated |BIGNUM|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700171OPENSSL_EXPORT void BN_init(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700172
173/* BN_free frees the data referenced by |bn| and, if |bn| was originally
174 * allocated on the heap, frees |bn| also. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700175OPENSSL_EXPORT void BN_free(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700176
177/* BN_clear_free erases and frees the data referenced by |bn| and, if |bn| was
178 * originally allocated on the heap, frees |bn| also. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700179OPENSSL_EXPORT void BN_clear_free(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700180
181/* BN_dup allocates a new BIGNUM and sets it equal to |src|. It returns the
182 * allocated BIGNUM on success or NULL otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700183OPENSSL_EXPORT BIGNUM *BN_dup(const BIGNUM *src);
Adam Langley95c29f32014-06-20 12:00:00 -0700184
David Benjamin1c703cb2015-06-11 21:42:14 -0400185/* BN_copy sets |dest| equal to |src| and returns |dest| or NULL on allocation
186 * failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700187OPENSSL_EXPORT BIGNUM *BN_copy(BIGNUM *dest, const BIGNUM *src);
Adam Langley95c29f32014-06-20 12:00:00 -0700188
189/* BN_clear sets |bn| to zero and erases the old data. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700190OPENSSL_EXPORT void BN_clear(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700191
192/* BN_value_one returns a static BIGNUM with value 1. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700193OPENSSL_EXPORT const BIGNUM *BN_value_one(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700194
195/* BN_with_flags initialises a stack allocated |BIGNUM| with pointers to the
196 * contents of |in| but with |flags| ORed into the flags field.
197 *
198 * Note: the two BIGNUMs share state and so |out| should /not/ be passed to
199 * |BN_free|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700200OPENSSL_EXPORT void BN_with_flags(BIGNUM *out, const BIGNUM *in, int flags);
Adam Langley95c29f32014-06-20 12:00:00 -0700201
202
203/* Basic functions. */
204
205/* BN_num_bits returns the minimum number of bits needed to represent the
206 * absolute value of |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700207OPENSSL_EXPORT unsigned BN_num_bits(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700208
209/* BN_num_bytes returns the minimum number of bytes needed to represent the
210 * absolute value of |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700211OPENSSL_EXPORT unsigned BN_num_bytes(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700212
213/* BN_zero sets |bn| to zero. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700214OPENSSL_EXPORT void BN_zero(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700215
216/* BN_one sets |bn| to one. It returns one on success or zero on allocation
217 * failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700218OPENSSL_EXPORT int BN_one(BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700219
220/* BN_set_word sets |bn| to |value|. It returns one on success or zero on
221 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700222OPENSSL_EXPORT int BN_set_word(BIGNUM *bn, BN_ULONG value);
Adam Langley95c29f32014-06-20 12:00:00 -0700223
224/* BN_set_negative sets the sign of |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700225OPENSSL_EXPORT void BN_set_negative(BIGNUM *bn, int sign);
Adam Langley95c29f32014-06-20 12:00:00 -0700226
227/* BN_is_negative returns one if |bn| is negative and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700228OPENSSL_EXPORT int BN_is_negative(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700229
230/* BN_get_flags returns |bn->flags| & |flags|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700231OPENSSL_EXPORT int BN_get_flags(const BIGNUM *bn, int flags);
Adam Langley95c29f32014-06-20 12:00:00 -0700232
233/* BN_set_flags sets |flags| on |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700234OPENSSL_EXPORT void BN_set_flags(BIGNUM *bn, int flags);
Adam Langley95c29f32014-06-20 12:00:00 -0700235
236
237/* Conversion functions. */
238
239/* BN_bin2bn sets |*ret| to the value of |len| bytes from |in|, interpreted as
240 * a big-endian number, and returns |ret|. If |ret| is NULL then a fresh
241 * |BIGNUM| is allocated and returned. It returns NULL on allocation
242 * failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700243OPENSSL_EXPORT BIGNUM *BN_bin2bn(const uint8_t *in, size_t len, BIGNUM *ret);
Adam Langley95c29f32014-06-20 12:00:00 -0700244
245/* BN_bn2bin serialises the absolute value of |in| to |out| as a big-endian
246 * integer, which must have |BN_num_bytes| of space available. It returns the
247 * number of bytes written. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700248OPENSSL_EXPORT size_t BN_bn2bin(const BIGNUM *in, uint8_t *out);
Adam Langley95c29f32014-06-20 12:00:00 -0700249
Adam Langley6887edb2014-06-20 12:00:00 -0700250/* BN_bn2bin_padded serialises the absolute value of |in| to |out| as a
251 * big-endian integer. The integer is padded with leading zeros up to size
252 * |len|. If |len| is smaller than |BN_num_bytes|, the function fails and
253 * returns 0. Otherwise, it returns 1. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700254OPENSSL_EXPORT int BN_bn2bin_padded(uint8_t *out, size_t len, const BIGNUM *in);
Adam Langley6887edb2014-06-20 12:00:00 -0700255
Adam Langley95c29f32014-06-20 12:00:00 -0700256/* BN_bn2hex returns an allocated string that contains a NUL-terminated, hex
257 * representation of |bn|. If |bn| is negative, the first char in the resulting
258 * string will be '-'. Returns NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700259OPENSSL_EXPORT char *BN_bn2hex(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700260
261/* BN_hex2bn parses the leading hex number from |in|, which may be proceeded by
262 * a '-' to indicate a negative number and may contain trailing, non-hex data.
263 * If |outp| is not NULL, it constructs a BIGNUM equal to the hex number and
264 * stores it in |*outp|. If |*outp| is NULL then it allocates a new BIGNUM and
265 * updates |*outp|. It returns the number of bytes of |in| processed or zero on
266 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700267OPENSSL_EXPORT int BN_hex2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700268
269/* BN_bn2dec returns an allocated string that contains a NUL-terminated,
270 * decimal representation of |bn|. If |bn| is negative, the first char in the
271 * resulting string will be '-'. Returns NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700272OPENSSL_EXPORT char *BN_bn2dec(const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700273
274/* BN_dec2bn parses the leading decimal number from |in|, which may be
275 * proceeded by a '-' to indicate a negative number and may contain trailing,
276 * non-decimal data. If |outp| is not NULL, it constructs a BIGNUM equal to the
277 * decimal number and stores it in |*outp|. If |*outp| is NULL then it
278 * allocates a new BIGNUM and updates |*outp|. It returns the number of bytes
279 * of |in| processed or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700280OPENSSL_EXPORT int BN_dec2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700281
282/* BN_asc2bn acts like |BN_dec2bn| or |BN_hex2bn| depending on whether |in|
283 * begins with "0X" or "0x" (indicating hex) or not (indicating decimal). A
284 * leading '-' is still permitted and comes before the optional 0X/0x. It
285 * returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700286OPENSSL_EXPORT int BN_asc2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700287
288/* BN_print writes a hex encoding of |a| to |bio|. It returns one on success
289 * and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700290OPENSSL_EXPORT int BN_print(BIO *bio, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700291
292/* BN_print_fp acts like |BIO_print|, but wraps |fp| in a |BIO| first. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700293OPENSSL_EXPORT int BN_print_fp(FILE *fp, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700294
295/* BN_get_word returns the absolute value of |bn| as a single word. If |bn| is
296 * too large to be represented as a single word, the maximum possible value
297 * will be returned. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700298OPENSSL_EXPORT BN_ULONG BN_get_word(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700299
300
Adam Langleyb8b54782014-08-13 10:31:52 -0700301/* Internal functions.
302 *
303 * These functions are useful for code that is doing low-level manipulations of
304 * BIGNUM values. However, be sure that no other function in this file does
305 * what you want before turning to these. */
306
307/* bn_correct_top decrements |bn->top| until |bn->d[top-1]| is non-zero or
308 * until |top| is zero. */
309OPENSSL_EXPORT void bn_correct_top(BIGNUM *bn);
310
311/* bn_wexpand ensures that |bn| has at least |words| works of space without
312 * altering its value. It returns one on success or zero on allocation
313 * failure. */
314OPENSSL_EXPORT BIGNUM *bn_wexpand(BIGNUM *bn, unsigned words);
315
316
Adam Langley95c29f32014-06-20 12:00:00 -0700317/* BIGNUM pools.
318 *
319 * Certain BIGNUM operations need to use many temporary variables and
320 * allocating and freeing them can be quite slow. Thus such opertions typically
321 * take a |BN_CTX| parameter, which contains a pool of |BIGNUMs|. The |ctx|
322 * argument to a public function may be NULL, in which case a local |BN_CTX|
323 * will be created just for the lifetime of that call.
324 *
325 * A function must call |BN_CTX_start| first. Then, |BN_CTX_get| may be called
326 * repeatedly to obtain temporary |BIGNUM|s. All |BN_CTX_get| calls must be made
327 * before calling any other functions that use the |ctx| as an argument.
328 *
329 * Finally, |BN_CTX_end| must be called before returning from the function.
330 * When |BN_CTX_end| is called, the |BIGNUM| pointers obtained from
331 * |BN_CTX_get| become invalid. */
332
333/* BN_CTX_new returns a new, empty BN_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700334OPENSSL_EXPORT BN_CTX *BN_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700335
336/* BN_CTX_free frees all BIGNUMs contained in |ctx| and then frees |ctx|
337 * itself. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700338OPENSSL_EXPORT void BN_CTX_free(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700339
340/* BN_CTX_start "pushes" a new entry onto the |ctx| stack and allows future
341 * calls to |BN_CTX_get|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700342OPENSSL_EXPORT void BN_CTX_start(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700343
344/* BN_CTX_get returns a new |BIGNUM|, or NULL on allocation failure. Once
345 * |BN_CTX_get| has returned NULL, all future calls will also return NULL until
346 * |BN_CTX_end| is called. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700347OPENSSL_EXPORT BIGNUM *BN_CTX_get(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700348
349/* BN_CTX_end invalidates all |BIGNUM|s returned from |BN_CTX_get| since the
350 * matching |BN_CTX_start| call. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700351OPENSSL_EXPORT void BN_CTX_end(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700352
353
354/* Simple arithmetic */
355
356/* BN_add sets |r| = |a| + |b|, where |r| may be the same pointer as either |a|
357 * or |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700358OPENSSL_EXPORT int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700359
360/* BN_uadd sets |r| = |a| + |b|, where |a| and |b| are non-negative and |r| may
361 * be the same pointer as either |a| or |b|. It returns one on success and zero
362 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700363OPENSSL_EXPORT int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700364
365/* BN_add_word adds |w| to |a|. It returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700366OPENSSL_EXPORT int BN_add_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700367
David Benjamin25c93ff2014-08-27 12:09:26 -0400368/* BN_sub sets |r| = |a| - |b|, where |r| must be a distinct pointer from |a|
Adam Langley95c29f32014-06-20 12:00:00 -0700369 * and |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700370OPENSSL_EXPORT int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700371
David Benjamin25c93ff2014-08-27 12:09:26 -0400372/* BN_usub sets |r| = |a| - |b|, where |a| and |b| are non-negative integers,
Adam Langley95c29f32014-06-20 12:00:00 -0700373 * |b| < |a| and |r| must be a distinct pointer from |a| and |b|. It returns
374 * one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700375OPENSSL_EXPORT int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700376
377/* BN_sub_word subtracts |w| from |a|. It returns one on success and zero on
378 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700379OPENSSL_EXPORT int BN_sub_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700380
381/* BN_mul sets |r| = |a| * |b|, where |r| may be the same pointer as |a| or
382 * |b|. Returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700383OPENSSL_EXPORT int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
384 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700385
386/* BN_mul_word sets |bn| = |bn| * |w|. It returns one on success or zero on
387 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700388OPENSSL_EXPORT int BN_mul_word(BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700389
390/* BN_sqr sets |r| = |a|^2 (i.e. squares), where |r| may be the same pointer as
391 * |a|. Returns one on success and zero otherwise. This is more efficient than
392 * BN_mul(r, a, a, ctx). */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700393OPENSSL_EXPORT int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700394
395/* BN_div divides |numerator| by |divisor| and places the result in |quotient|
396 * and the remainder in |rem|. Either of |quotient| or |rem| may be NULL, in
397 * which case the respective value is not returned. The result is rounded
398 * towards zero; thus if |numerator| is negative, the remainder will be zero or
399 * negative. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700400OPENSSL_EXPORT int BN_div(BIGNUM *quotient, BIGNUM *rem,
401 const BIGNUM *numerator, const BIGNUM *divisor,
402 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700403
404/* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the
405 * remainder or (BN_ULONG)-1 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700406OPENSSL_EXPORT BN_ULONG BN_div_word(BIGNUM *numerator, BN_ULONG divisor);
Adam Langley95c29f32014-06-20 12:00:00 -0700407
Adam Langley409766d2014-06-20 12:00:00 -0700408/* BN_sqrt sets |*out_sqrt| (which may be the same |BIGNUM| as |in|) to the
409 * square root of |in|, using |ctx|. It returns one on success or zero on
410 * error. Negative numbers and non-square numbers will result in an error with
411 * appropriate errors on the error queue. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700412OPENSSL_EXPORT int BN_sqrt(BIGNUM *out_sqrt, const BIGNUM *in, BN_CTX *ctx);
Adam Langley409766d2014-06-20 12:00:00 -0700413
Adam Langley95c29f32014-06-20 12:00:00 -0700414
415/* Comparison functions */
416
417/* BN_cmp returns a value less than, equal to or greater than zero if |a| is
418 * less than, equal to or greater than |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700419OPENSSL_EXPORT int BN_cmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700420
421/* BN_ucmp returns a value less than, equal to or greater than zero if the
422 * absolute value of |a| is less than, equal to or greater than the absolute
423 * value of |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700424OPENSSL_EXPORT int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700425
426/* BN_abs_is_word returns one if the absolute value of |bn| equals |w| and zero
427 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700428OPENSSL_EXPORT int BN_abs_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700429
430/* BN_is_zero returns one if |bn| is zero and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700431OPENSSL_EXPORT int BN_is_zero(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700432
433/* BN_is_one returns one if |bn| equals one and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700434OPENSSL_EXPORT int BN_is_one(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700435
436/* BN_is_word returns one if |bn| is exactly |w| and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700437OPENSSL_EXPORT int BN_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700438
439/* BN_is_odd returns one if |bn| is odd and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700440OPENSSL_EXPORT int BN_is_odd(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700441
442
443/* Bitwise operations. */
444
445/* BN_lshift sets |r| equal to |a| << n. The |a| and |r| arguments may be the
446 * same |BIGNUM|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700447OPENSSL_EXPORT int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700448
449/* BN_lshift1 sets |r| equal to |a| << 1, where |r| and |a| may be the same
450 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700451OPENSSL_EXPORT int BN_lshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700452
453/* BN_rshift sets |r| equal to |a| >> n, where |r| and |a| may be the same
454 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700455OPENSSL_EXPORT int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700456
457/* BN_rshift1 sets |r| equal to |a| >> 1, where |r| and |a| may be the same
458 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700459OPENSSL_EXPORT int BN_rshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700460
461/* BN_set_bit sets the |n|th, least-significant bit in |a|. For example, if |a|
462 * is 2 then setting bit zero will make it 3. It returns one on success or zero
463 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700464OPENSSL_EXPORT int BN_set_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700465
466/* BN_clear_bit clears the |n|th, least-significant bit in |a|. For example, if
467 * |a| is 3, clearing bit zero will make it two. It returns one on success or
468 * zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700469OPENSSL_EXPORT int BN_clear_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700470
471/* BN_is_bit_set returns the value of the |n|th, least-significant bit in |a|,
472 * or zero if the bit doesn't exist. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700473OPENSSL_EXPORT int BN_is_bit_set(const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700474
475/* BN_mask_bits truncates |a| so that it is only |n| bits long. It returns one
476 * on success or zero if |n| is greater than the length of |a| already. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700477OPENSSL_EXPORT int BN_mask_bits(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700478
479
480/* Modulo arithmetic. */
481
482/* BN_mod_word returns |a| mod |w|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700483OPENSSL_EXPORT BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700484
485/* BN_mod is a helper macro that calls |BN_div| and discards the quotient. */
486#define BN_mod(rem, numerator, divisor, ctx) \
487 BN_div(NULL, (rem), (numerator), (divisor), (ctx))
488
489/* BN_nnmod is a non-negative modulo function. It acts like |BN_mod|, but 0 <=
David Benjamina5974bf2015-03-25 23:49:37 -0400490 * |rem| < |divisor| is always true. It returns one on success and zero on
491 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700492OPENSSL_EXPORT int BN_nnmod(BIGNUM *rem, const BIGNUM *numerator,
493 const BIGNUM *divisor, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700494
495/* BN_mod_add sets |r| = |a| + |b| mod |m|. It returns one on success and zero
496 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700497OPENSSL_EXPORT int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
498 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700499
500/* BN_mod_add_quick acts like |BN_mod_add| but requires that |a| and |b| be
501 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700502OPENSSL_EXPORT int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
503 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700504
505/* BN_mod_sub sets |r| = |a| - |b| mod |m|. It returns one on success and zero
506 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700507OPENSSL_EXPORT int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
508 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700509
510/* BN_mod_sub_quick acts like |BN_mod_sub| but requires that |a| and |b| be
511 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700512OPENSSL_EXPORT int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
513 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700514
515/* BN_mod_mul sets |r| = |a|*|b| mod |m|. It returns one on success and zero
516 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700517OPENSSL_EXPORT int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
518 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700519
520/* BN_mod_mul sets |r| = |a|^2 mod |m|. It returns one on success and zero
521 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700522OPENSSL_EXPORT int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
523 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700524
525/* BN_mod_lshift sets |r| = (|a| << n) mod |m|, where |r| and |a| may be the
526 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700527OPENSSL_EXPORT int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n,
528 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700529
530/* BN_mod_lshift_quick acts like |BN_mod_lshift| but requires that |a| be
531 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700532OPENSSL_EXPORT int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n,
533 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700534
535/* BN_mod_lshift1 sets |r| = (|a| << 1) mod |m|, where |r| and |a| may be the
536 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700537OPENSSL_EXPORT int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
538 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700539
540/* BN_mod_lshift1_quick acts like |BN_mod_lshift1| but requires that |a| be
541 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700542OPENSSL_EXPORT int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a,
543 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700544
545/* BN_mod_sqrt returns a |BIGNUM|, r, such that r^2 == a (mod p). */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700546OPENSSL_EXPORT BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p,
547 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700548
549
550/* Random and prime number generation. */
551
David Benjaminb3a7b512015-05-26 18:35:28 -0400552/* BN_rand sets |rnd| to a random number of length |bits|. If |top| is zero, the
553 * most-significant bit, if any, will be set. If |top| is one, the two most
554 * significant bits, if any, will be set.
Adam Langley95c29f32014-06-20 12:00:00 -0700555 *
556 * If |top| is -1 then no extra action will be taken and |BN_num_bits(rnd)| may
557 * not equal |bits| if the most significant bits randomly ended up as zeros.
558 *
David Benjaminb3a7b512015-05-26 18:35:28 -0400559 * If |bottom| is non-zero, the least-significant bit, if any, will be set. The
560 * function returns one on success or zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700561OPENSSL_EXPORT int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700562
563/* BN_pseudo_rand is an alias for |BN_rand|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700564OPENSSL_EXPORT int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700565
566/* BN_rand_range sets |rnd| to a random value [0..range). It returns one on
567 * success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700568OPENSSL_EXPORT int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700569
570/* BN_pseudo_rand_range is an alias for BN_rand_range. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700571OPENSSL_EXPORT int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700572
Adam Langleyd4b4f082014-06-20 12:00:00 -0700573/* BN_generate_dsa_nonce generates a random number 0 <= out < range. Unlike
574 * BN_rand_range, it also includes the contents of |priv| and |message| in the
575 * generation so that an RNG failure isn't fatal as long as |priv| remains
576 * secret. This is intended for use in DSA and ECDSA where an RNG weakness
577 * leads directly to private key exposure unless this function is used.
578 * It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700579OPENSSL_EXPORT int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
580 const BIGNUM *priv,
581 const uint8_t *message,
582 size_t message_len, BN_CTX *ctx);
Adam Langleyd4b4f082014-06-20 12:00:00 -0700583
Adam Langley95c29f32014-06-20 12:00:00 -0700584/* BN_GENCB holds a callback function that is used by generation functions that
585 * can take a very long time to complete. Use |BN_GENCB_set| to initialise a
586 * |BN_GENCB| structure.
587 *
588 * The callback receives the address of that |BN_GENCB| structure as its last
589 * argument and the user is free to put an arbitary pointer in |arg|. The other
590 * arguments are set as follows:
591 * event=BN_GENCB_GENERATED, n=i: after generating the i'th possible prime
592 * number.
593 * event=BN_GENCB_PRIME_TEST, n=-1: when finished trial division primality
594 * checks.
595 * event=BN_GENCB_PRIME_TEST, n=i: when the i'th primality test has finished.
596 *
597 * The callback can return zero to abort the generation progress or one to
598 * allow it to continue.
599 *
600 * When other code needs to call a BN generation function it will often take a
601 * BN_GENCB argument and may call the function with other argument values. */
602#define BN_GENCB_GENERATED 0
603#define BN_GENCB_PRIME_TEST 1
604
605struct bn_gencb_st {
606 void *arg; /* callback-specific data */
607 int (*callback)(int event, int n, struct bn_gencb_st *);
608};
609
610/* BN_GENCB_set configures |callback| to call |f| and sets |callout->arg| to
611 * |arg|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700612OPENSSL_EXPORT void BN_GENCB_set(BN_GENCB *callback,
613 int (*f)(int event, int n,
614 struct bn_gencb_st *),
615 void *arg);
Adam Langley95c29f32014-06-20 12:00:00 -0700616
617/* BN_GENCB_call calls |callback|, if not NULL, and returns the return value of
618 * the callback, or 1 if |callback| is NULL. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700619OPENSSL_EXPORT int BN_GENCB_call(BN_GENCB *callback, int event, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700620
621/* BN_generate_prime_ex sets |ret| to a prime number of |bits| length. If safe
622 * is non-zero then the prime will be such that (ret-1)/2 is also a prime.
623 * (This is needed for Diffie-Hellman groups to ensure that the only subgroups
624 * are of size 2 and (p-1)/2.).
625 *
626 * If |add| is not NULL, the prime will fulfill the condition |ret| % |add| ==
627 * |rem| in order to suit a given generator. (If |rem| is NULL then |ret| %
628 * |add| == 1.)
629 *
630 * If |cb| is not NULL, it will be called during processing to give an
631 * indication of progress. See the comments for |BN_GENCB|. It returns one on
632 * success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700633OPENSSL_EXPORT int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
634 const BIGNUM *add, const BIGNUM *rem,
635 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700636
637/* BN_prime_checks is magic value that can be used as the |checks| argument to
638 * the primality testing functions in order to automatically select a number of
639 * Miller-Rabin checks that gives a false positive rate of ~2^{-80}. */
640#define BN_prime_checks 0
641
642/* BN_primality_test sets |*is_probably_prime| to one if |candidate| is
643 * probably a prime number by the Miller-Rabin test or zero if it's certainly
644 * not.
645 *
646 * If |do_trial_division| is non-zero then |candidate| will be tested against a
647 * list of small primes before Miller-Rabin tests. The probability of this
648 * function returning a false positive is 2^{2*checks}. If |checks| is
649 * |BN_prime_checks| then a value that results in approximately 2^{-80} false
650 * positive probability is used. If |cb| is not NULL then it is called during
651 * the checking process. See the comment above |BN_GENCB|.
652 *
653 * The function returns one on success and zero on error.
654 *
655 * (If you are unsure whether you want |do_trial_division|, don't set it.) */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700656OPENSSL_EXPORT int BN_primality_test(int *is_probably_prime,
657 const BIGNUM *candidate, int checks,
658 BN_CTX *ctx, int do_trial_division,
659 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700660
661/* BN_is_prime_fasttest_ex returns one if |candidate| is probably a prime
662 * number by the Miller-Rabin test, zero if it's certainly not and -1 on error.
663 *
664 * If |do_trial_division| is non-zero then |candidate| will be tested against a
665 * list of small primes before Miller-Rabin tests. The probability of this
666 * function returning one when |candidate| is composite is 2^{2*checks}. If
667 * |checks| is |BN_prime_checks| then a value that results in approximately
668 * 2^{-80} false positive probability is used. If |cb| is not NULL then it is
669 * called during the checking process. See the comment above |BN_GENCB|.
670 *
671 * WARNING: deprecated. Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700672OPENSSL_EXPORT int BN_is_prime_fasttest_ex(const BIGNUM *candidate, int checks,
673 BN_CTX *ctx, int do_trial_division,
674 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700675
676/* BN_is_prime_ex acts the same as |BN_is_prime_fasttest_ex| with
677 * |do_trial_division| set to zero.
678 *
679 * WARNING: deprecated: Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700680OPENSSL_EXPORT int BN_is_prime_ex(const BIGNUM *candidate, int checks,
681 BN_CTX *ctx, BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700682
683
684/* Number theory functions */
685
686/* BN_gcd sets |r| = gcd(|a|, |b|). It returns one on success and zero
687 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700688OPENSSL_EXPORT int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
689 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700690
691/* BN_mod_inverse sets |out| equal to |a|^-1, mod |n|. If either of |a| or |n|
692 * have |BN_FLG_CONSTTIME| set then the operation is performed in constant
693 * time. If |out| is NULL, a fresh BIGNUM is allocated. It returns the result
694 * or NULL on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700695OPENSSL_EXPORT BIGNUM *BN_mod_inverse(BIGNUM *out, const BIGNUM *a,
696 const BIGNUM *n, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700697
698/* BN_kronecker returns the Kronecker symbol of |a| and |b| (which is -1, 0 or
699 * 1), or -2 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700700OPENSSL_EXPORT int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700701
702
703/* Montgomery arithmetic. */
704
705/* BN_MONT_CTX contains the precomputed values needed to work in a specific
706 * Montgomery domain. */
707
708/* BN_MONT_CTX_new returns a fresh BN_MONT_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700709OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700710
711/* BN_MONT_CTX_init initialises a stack allocated |BN_MONT_CTX|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700712OPENSSL_EXPORT void BN_MONT_CTX_init(BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700713
714/* BN_MONT_CTX_free frees the contexts of |mont| and, if it was originally
715 * allocated with |BN_MONT_CTX_new|, |mont| itself. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700716OPENSSL_EXPORT void BN_MONT_CTX_free(BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700717
718/* BN_MONT_CTX_copy sets |to| equal to |from|. It returns |to| on success or
719 * NULL on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700720OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,
721 BN_MONT_CTX *from);
Adam Langley95c29f32014-06-20 12:00:00 -0700722
723/* BN_MONT_CTX_set sets up a Montgomery context given the modulus, |mod|. It
724 * returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700725OPENSSL_EXPORT int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod,
726 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700727
Adam Langley683d7bd2015-04-13 11:04:14 -0700728/* BN_MONT_CTX_set_locked takes |lock| and checks whether |*pmont| is NULL. If
729 * so, it creates a new |BN_MONT_CTX| and sets the modulus for it to |mod|. It
730 * then stores it as |*pmont| and returns it, or NULL on error.
Adam Langley95c29f32014-06-20 12:00:00 -0700731 *
732 * If |*pmont| is already non-NULL then the existing value is returned. */
Adam Langley683d7bd2015-04-13 11:04:14 -0700733BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_MUTEX *lock,
734 const BIGNUM *mod, BN_CTX *bn_ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700735
736/* BN_to_montgomery sets |ret| equal to |a| in the Montgomery domain. It
737 * returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700738OPENSSL_EXPORT int BN_to_montgomery(BIGNUM *ret, const BIGNUM *a,
739 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700740
741/* BN_from_montgomery sets |ret| equal to |a| * R^-1, i.e. translates values
742 * out of the Montgomery domain. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700743OPENSSL_EXPORT int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a,
744 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700745
746/* BN_mod_mul_montgomery set |r| equal to |a| * |b|, in the Montgomery domain.
747 * Both |a| and |b| must already be in the Montgomery domain (by
748 * |BN_to_montgomery|). It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700749OPENSSL_EXPORT int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a,
750 const BIGNUM *b,
751 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700752
753
754/* Exponentiation. */
755
756/* BN_exp sets |r| equal to |a|^{|p|}. It does so with a square-and-multiply
757 * algorithm that leaks side-channel information. It returns one on success or
758 * zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700759OPENSSL_EXPORT int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
760 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700761
Adam Langley5d17dd62014-06-30 14:22:32 -0700762/* BN_mod_exp sets |r| equal to |a|^{|p|} mod |m|. It does so with the best
Adam Langley95c29f32014-06-20 12:00:00 -0700763 * algorithm for the values provided and can run in constant time if
764 * |BN_FLG_CONSTTIME| is set for |p|. It returns one on success or zero
765 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700766OPENSSL_EXPORT int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
767 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700768
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700769OPENSSL_EXPORT int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
770 const BIGNUM *m, BN_CTX *ctx,
771 BN_MONT_CTX *m_ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700772
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700773OPENSSL_EXPORT int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a,
774 const BIGNUM *p, const BIGNUM *m,
775 BN_CTX *ctx, BN_MONT_CTX *in_mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700776
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700777OPENSSL_EXPORT int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
778 const BIGNUM *m, BN_CTX *ctx,
779 BN_MONT_CTX *m_ctx);
780OPENSSL_EXPORT int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1,
781 const BIGNUM *p1, const BIGNUM *a2,
782 const BIGNUM *p2, const BIGNUM *m,
783 BN_CTX *ctx, BN_MONT_CTX *m_ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700784
785
786/* Private functions */
787
788struct bignum_st {
789 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks in little-endian
790 order. */
791 int top; /* Index of last used element in |d|, plus one. */
792 int dmax; /* Size of |d|, in words. */
793 int neg; /* one if the number is negative */
794 int flags; /* bitmask of BN_FLG_* values */
795};
796
797struct bn_mont_ctx_st {
798 BIGNUM RR; /* used to convert to montgomery form */
799 BIGNUM N; /* The modulus */
800 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1
801 * (Ni is only stored for bignum algorithm) */
802 BN_ULONG n0[2]; /* least significant word(s) of Ni;
803 (type changed with 0.9.9, was "BN_ULONG n0;" before) */
804 int flags;
805 int ri; /* number of bits in R */
806};
807
Adam Langley214cd442014-08-18 11:35:45 -0700808OPENSSL_EXPORT unsigned BN_num_bits_word(BN_ULONG l);
Adam Langley95c29f32014-06-20 12:00:00 -0700809
810#define BN_FLG_MALLOCED 0x01
811#define BN_FLG_STATIC_DATA 0x02
812/* avoid leaking exponent information through timing, BN_mod_exp_mont() will
813 * call BN_mod_exp_mont_consttime, BN_div() will call BN_div_no_branch,
814 * BN_mod_inverse() will call BN_mod_inverse_no_branch. */
815#define BN_FLG_CONSTTIME 0x04
816
817
Adam Langley7cc3f992015-01-07 15:06:31 -0800818/* Android compatibility section.
819 *
820 * These functions are declared, temporarily, for Android because
821 * wpa_supplicant will take a little time to sync with upstream. Outside of
822 * Android they'll have no definition. */
823
824OPENSSL_EXPORT BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
825
826
Adam Langley95c29f32014-06-20 12:00:00 -0700827#if defined(__cplusplus)
828} /* extern C */
829#endif
830
David Benjamin689be0f2015-02-11 15:55:26 -0500831#define BN_F_BN_CTX_get 100
832#define BN_F_BN_CTX_new 101
833#define BN_F_BN_CTX_start 102
834#define BN_F_BN_bn2dec 103
835#define BN_F_BN_bn2hex 104
836#define BN_F_BN_div 105
837#define BN_F_BN_div_recp 106
838#define BN_F_BN_exp 107
839#define BN_F_BN_generate_dsa_nonce 108
840#define BN_F_BN_generate_prime_ex 109
841#define BN_F_BN_mod_exp2_mont 110
842#define BN_F_BN_mod_exp_mont 111
843#define BN_F_BN_mod_exp_mont_consttime 112
844#define BN_F_BN_mod_exp_mont_word 113
845#define BN_F_BN_mod_inverse 114
846#define BN_F_BN_mod_inverse_no_branch 115
847#define BN_F_BN_mod_lshift_quick 116
848#define BN_F_BN_mod_sqrt 117
849#define BN_F_BN_new 118
850#define BN_F_BN_rand 119
851#define BN_F_BN_rand_range 120
852#define BN_F_BN_sqrt 121
853#define BN_F_BN_usub 122
854#define BN_F_bn_wexpand 123
855#define BN_F_mod_exp_recp 124
David Benjamin074cc042015-05-26 18:23:16 -0400856#define BN_F_BN_lshift 125
857#define BN_F_BN_rshift 126
David Benjamin689be0f2015-02-11 15:55:26 -0500858#define BN_R_ARG2_LT_ARG3 100
859#define BN_R_BAD_RECIPROCAL 101
860#define BN_R_BIGNUM_TOO_LONG 102
861#define BN_R_BITS_TOO_SMALL 103
862#define BN_R_CALLED_WITH_EVEN_MODULUS 104
863#define BN_R_DIV_BY_ZERO 105
864#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 106
865#define BN_R_INPUT_NOT_REDUCED 107
866#define BN_R_INVALID_RANGE 108
867#define BN_R_NEGATIVE_NUMBER 109
868#define BN_R_NOT_A_SQUARE 110
869#define BN_R_NOT_INITIALIZED 111
870#define BN_R_NO_INVERSE 112
871#define BN_R_PRIVATE_KEY_TOO_LARGE 113
872#define BN_R_P_IS_NOT_PRIME 114
873#define BN_R_TOO_MANY_ITERATIONS 115
874#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 116
Adam Langley95c29f32014-06-20 12:00:00 -0700875
876#endif /* OPENSSL_HEADER_BN_H */