blob: cbc1ee7af7a5bb0bc6e42d75fe5e71781585e44c [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
David Benjaminb9c579d2015-06-11 22:52:07 -0400301/* ASN.1 functions. */
302
303/* BN_cbs2unsigned parses a non-negative DER INTEGER from |cbs| writes the
304 * result to |ret|. It returns one on success and zero on failure. */
305OPENSSL_EXPORT int BN_cbs2unsigned(CBS *cbs, BIGNUM *ret);
306
David Benjamin4c60d352015-09-23 12:23:01 -0400307/* BN_cbs2unsigned_buggy acts like |BN_cbs2unsigned| but tolerates some invalid
308 * encodings. Do not use this function. */
David Benjamin231cb822015-09-15 16:47:35 -0400309OPENSSL_EXPORT int BN_cbs2unsigned_buggy(CBS *cbs, BIGNUM *ret);
310
David Benjaminb9c579d2015-06-11 22:52:07 -0400311/* BN_bn2cbb marshals |bn| as a non-negative DER INTEGER and appends the result
312 * to |cbb|. It returns one on success and zero on failure. */
313OPENSSL_EXPORT int BN_bn2cbb(CBB *cbb, const BIGNUM *bn);
314
315
Adam Langleyb8b54782014-08-13 10:31:52 -0700316/* Internal functions.
317 *
318 * These functions are useful for code that is doing low-level manipulations of
319 * BIGNUM values. However, be sure that no other function in this file does
320 * what you want before turning to these. */
321
322/* bn_correct_top decrements |bn->top| until |bn->d[top-1]| is non-zero or
323 * until |top| is zero. */
324OPENSSL_EXPORT void bn_correct_top(BIGNUM *bn);
325
326/* bn_wexpand ensures that |bn| has at least |words| works of space without
327 * altering its value. It returns one on success or zero on allocation
328 * failure. */
David Benjamin719220e2015-08-11 12:05:02 -0400329OPENSSL_EXPORT BIGNUM *bn_wexpand(BIGNUM *bn, size_t words);
Adam Langleyb8b54782014-08-13 10:31:52 -0700330
331
Adam Langley95c29f32014-06-20 12:00:00 -0700332/* BIGNUM pools.
333 *
334 * Certain BIGNUM operations need to use many temporary variables and
335 * allocating and freeing them can be quite slow. Thus such opertions typically
336 * take a |BN_CTX| parameter, which contains a pool of |BIGNUMs|. The |ctx|
337 * argument to a public function may be NULL, in which case a local |BN_CTX|
338 * will be created just for the lifetime of that call.
339 *
340 * A function must call |BN_CTX_start| first. Then, |BN_CTX_get| may be called
341 * repeatedly to obtain temporary |BIGNUM|s. All |BN_CTX_get| calls must be made
342 * before calling any other functions that use the |ctx| as an argument.
343 *
344 * Finally, |BN_CTX_end| must be called before returning from the function.
345 * When |BN_CTX_end| is called, the |BIGNUM| pointers obtained from
346 * |BN_CTX_get| become invalid. */
347
348/* BN_CTX_new returns a new, empty BN_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700349OPENSSL_EXPORT BN_CTX *BN_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700350
351/* BN_CTX_free frees all BIGNUMs contained in |ctx| and then frees |ctx|
352 * itself. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700353OPENSSL_EXPORT void BN_CTX_free(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700354
355/* BN_CTX_start "pushes" a new entry onto the |ctx| stack and allows future
356 * calls to |BN_CTX_get|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700357OPENSSL_EXPORT void BN_CTX_start(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700358
359/* BN_CTX_get returns a new |BIGNUM|, or NULL on allocation failure. Once
360 * |BN_CTX_get| has returned NULL, all future calls will also return NULL until
361 * |BN_CTX_end| is called. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700362OPENSSL_EXPORT BIGNUM *BN_CTX_get(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700363
364/* BN_CTX_end invalidates all |BIGNUM|s returned from |BN_CTX_get| since the
365 * matching |BN_CTX_start| call. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700366OPENSSL_EXPORT void BN_CTX_end(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700367
368
369/* Simple arithmetic */
370
371/* BN_add sets |r| = |a| + |b|, where |r| may be the same pointer as either |a|
372 * or |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700373OPENSSL_EXPORT int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700374
375/* BN_uadd sets |r| = |a| + |b|, where |a| and |b| are non-negative and |r| may
376 * be the same pointer as either |a| or |b|. It returns one on success and zero
377 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700378OPENSSL_EXPORT int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700379
380/* BN_add_word adds |w| to |a|. It returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700381OPENSSL_EXPORT int BN_add_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700382
David Benjamin25c93ff2014-08-27 12:09:26 -0400383/* BN_sub sets |r| = |a| - |b|, where |r| must be a distinct pointer from |a|
Adam Langley95c29f32014-06-20 12:00:00 -0700384 * and |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700385OPENSSL_EXPORT int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700386
David Benjamin25c93ff2014-08-27 12:09:26 -0400387/* BN_usub sets |r| = |a| - |b|, where |a| and |b| are non-negative integers,
Adam Langley95c29f32014-06-20 12:00:00 -0700388 * |b| < |a| and |r| must be a distinct pointer from |a| and |b|. It returns
389 * one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700390OPENSSL_EXPORT int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700391
392/* BN_sub_word subtracts |w| from |a|. It returns one on success and zero on
393 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700394OPENSSL_EXPORT int BN_sub_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700395
396/* BN_mul sets |r| = |a| * |b|, where |r| may be the same pointer as |a| or
397 * |b|. Returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700398OPENSSL_EXPORT int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
399 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700400
401/* BN_mul_word sets |bn| = |bn| * |w|. It returns one on success or zero on
402 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700403OPENSSL_EXPORT int BN_mul_word(BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700404
405/* BN_sqr sets |r| = |a|^2 (i.e. squares), where |r| may be the same pointer as
406 * |a|. Returns one on success and zero otherwise. This is more efficient than
407 * BN_mul(r, a, a, ctx). */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700408OPENSSL_EXPORT int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700409
410/* BN_div divides |numerator| by |divisor| and places the result in |quotient|
411 * and the remainder in |rem|. Either of |quotient| or |rem| may be NULL, in
412 * which case the respective value is not returned. The result is rounded
413 * towards zero; thus if |numerator| is negative, the remainder will be zero or
414 * negative. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700415OPENSSL_EXPORT int BN_div(BIGNUM *quotient, BIGNUM *rem,
416 const BIGNUM *numerator, const BIGNUM *divisor,
417 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700418
419/* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the
420 * remainder or (BN_ULONG)-1 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700421OPENSSL_EXPORT BN_ULONG BN_div_word(BIGNUM *numerator, BN_ULONG divisor);
Adam Langley95c29f32014-06-20 12:00:00 -0700422
Adam Langley409766d2014-06-20 12:00:00 -0700423/* BN_sqrt sets |*out_sqrt| (which may be the same |BIGNUM| as |in|) to the
424 * square root of |in|, using |ctx|. It returns one on success or zero on
425 * error. Negative numbers and non-square numbers will result in an error with
426 * appropriate errors on the error queue. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700427OPENSSL_EXPORT int BN_sqrt(BIGNUM *out_sqrt, const BIGNUM *in, BN_CTX *ctx);
Adam Langley409766d2014-06-20 12:00:00 -0700428
Adam Langley95c29f32014-06-20 12:00:00 -0700429
430/* Comparison functions */
431
432/* BN_cmp returns a value less than, equal to or greater than zero if |a| is
433 * less than, equal to or greater than |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700434OPENSSL_EXPORT int BN_cmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700435
436/* BN_ucmp returns a value less than, equal to or greater than zero if the
437 * absolute value of |a| is less than, equal to or greater than the absolute
438 * value of |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700439OPENSSL_EXPORT int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700440
441/* BN_abs_is_word returns one if the absolute value of |bn| equals |w| and zero
442 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700443OPENSSL_EXPORT int BN_abs_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700444
445/* BN_is_zero returns one if |bn| is zero and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700446OPENSSL_EXPORT int BN_is_zero(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700447
448/* BN_is_one returns one if |bn| equals one and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700449OPENSSL_EXPORT int BN_is_one(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700450
451/* BN_is_word returns one if |bn| is exactly |w| and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700452OPENSSL_EXPORT int BN_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700453
454/* BN_is_odd returns one if |bn| is odd and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700455OPENSSL_EXPORT int BN_is_odd(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700456
457
458/* Bitwise operations. */
459
460/* BN_lshift sets |r| equal to |a| << n. The |a| and |r| arguments may be the
461 * same |BIGNUM|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700462OPENSSL_EXPORT int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700463
464/* BN_lshift1 sets |r| equal to |a| << 1, where |r| and |a| may be the same
465 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700466OPENSSL_EXPORT int BN_lshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700467
468/* BN_rshift sets |r| equal to |a| >> n, where |r| and |a| may be the same
469 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700470OPENSSL_EXPORT int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700471
472/* BN_rshift1 sets |r| equal to |a| >> 1, where |r| and |a| may be the same
473 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700474OPENSSL_EXPORT int BN_rshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700475
476/* BN_set_bit sets the |n|th, least-significant bit in |a|. For example, if |a|
477 * is 2 then setting bit zero will make it 3. It returns one on success or zero
478 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700479OPENSSL_EXPORT int BN_set_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700480
481/* BN_clear_bit clears the |n|th, least-significant bit in |a|. For example, if
482 * |a| is 3, clearing bit zero will make it two. It returns one on success or
483 * zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700484OPENSSL_EXPORT int BN_clear_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700485
486/* BN_is_bit_set returns the value of the |n|th, least-significant bit in |a|,
487 * or zero if the bit doesn't exist. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700488OPENSSL_EXPORT int BN_is_bit_set(const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700489
490/* BN_mask_bits truncates |a| so that it is only |n| bits long. It returns one
491 * on success or zero if |n| is greater than the length of |a| already. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700492OPENSSL_EXPORT int BN_mask_bits(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700493
494
495/* Modulo arithmetic. */
496
497/* BN_mod_word returns |a| mod |w|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700498OPENSSL_EXPORT BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700499
500/* BN_mod is a helper macro that calls |BN_div| and discards the quotient. */
501#define BN_mod(rem, numerator, divisor, ctx) \
502 BN_div(NULL, (rem), (numerator), (divisor), (ctx))
503
504/* BN_nnmod is a non-negative modulo function. It acts like |BN_mod|, but 0 <=
David Benjamina5974bf2015-03-25 23:49:37 -0400505 * |rem| < |divisor| is always true. It returns one on success and zero on
506 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700507OPENSSL_EXPORT int BN_nnmod(BIGNUM *rem, const BIGNUM *numerator,
508 const BIGNUM *divisor, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700509
510/* BN_mod_add sets |r| = |a| + |b| mod |m|. It returns one on success and zero
511 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700512OPENSSL_EXPORT int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
513 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700514
515/* BN_mod_add_quick acts like |BN_mod_add| but requires that |a| and |b| be
516 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700517OPENSSL_EXPORT int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
518 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700519
520/* BN_mod_sub sets |r| = |a| - |b| mod |m|. It returns one on success and zero
521 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700522OPENSSL_EXPORT int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
523 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700524
525/* BN_mod_sub_quick acts like |BN_mod_sub| but requires that |a| and |b| be
526 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700527OPENSSL_EXPORT int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
528 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700529
530/* BN_mod_mul sets |r| = |a|*|b| mod |m|. It returns one on success and zero
531 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700532OPENSSL_EXPORT int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
533 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700534
Adam Langley5f889992015-11-04 14:05:00 -0800535/* BN_mod_sqr sets |r| = |a|^2 mod |m|. It returns one on success and zero
Adam Langley95c29f32014-06-20 12:00:00 -0700536 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700537OPENSSL_EXPORT int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
538 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700539
540/* BN_mod_lshift sets |r| = (|a| << n) mod |m|, where |r| and |a| may be the
541 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700542OPENSSL_EXPORT int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n,
543 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700544
545/* BN_mod_lshift_quick acts like |BN_mod_lshift| but requires that |a| be
546 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700547OPENSSL_EXPORT int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n,
548 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700549
550/* BN_mod_lshift1 sets |r| = (|a| << 1) mod |m|, where |r| and |a| may be the
551 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700552OPENSSL_EXPORT int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
553 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700554
555/* BN_mod_lshift1_quick acts like |BN_mod_lshift1| but requires that |a| be
556 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700557OPENSSL_EXPORT int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a,
558 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700559
560/* BN_mod_sqrt returns a |BIGNUM|, r, such that r^2 == a (mod p). */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700561OPENSSL_EXPORT BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p,
562 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700563
564
565/* Random and prime number generation. */
566
David Benjaminb3a7b512015-05-26 18:35:28 -0400567/* BN_rand sets |rnd| to a random number of length |bits|. If |top| is zero, the
568 * most-significant bit, if any, will be set. If |top| is one, the two most
569 * significant bits, if any, will be set.
Adam Langley95c29f32014-06-20 12:00:00 -0700570 *
571 * If |top| is -1 then no extra action will be taken and |BN_num_bits(rnd)| may
572 * not equal |bits| if the most significant bits randomly ended up as zeros.
573 *
David Benjaminb3a7b512015-05-26 18:35:28 -0400574 * If |bottom| is non-zero, the least-significant bit, if any, will be set. The
575 * function returns one on success or zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700576OPENSSL_EXPORT int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700577
578/* BN_pseudo_rand is an alias for |BN_rand|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700579OPENSSL_EXPORT int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700580
581/* BN_rand_range sets |rnd| to a random value [0..range). It returns one on
582 * success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700583OPENSSL_EXPORT int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700584
585/* BN_pseudo_rand_range is an alias for BN_rand_range. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700586OPENSSL_EXPORT int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700587
Adam Langleyd4b4f082014-06-20 12:00:00 -0700588/* BN_generate_dsa_nonce generates a random number 0 <= out < range. Unlike
589 * BN_rand_range, it also includes the contents of |priv| and |message| in the
590 * generation so that an RNG failure isn't fatal as long as |priv| remains
591 * secret. This is intended for use in DSA and ECDSA where an RNG weakness
592 * leads directly to private key exposure unless this function is used.
593 * It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700594OPENSSL_EXPORT int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
595 const BIGNUM *priv,
596 const uint8_t *message,
597 size_t message_len, BN_CTX *ctx);
Adam Langleyd4b4f082014-06-20 12:00:00 -0700598
Adam Langley95c29f32014-06-20 12:00:00 -0700599/* BN_GENCB holds a callback function that is used by generation functions that
600 * can take a very long time to complete. Use |BN_GENCB_set| to initialise a
601 * |BN_GENCB| structure.
602 *
603 * The callback receives the address of that |BN_GENCB| structure as its last
604 * argument and the user is free to put an arbitary pointer in |arg|. The other
605 * arguments are set as follows:
606 * event=BN_GENCB_GENERATED, n=i: after generating the i'th possible prime
607 * number.
608 * event=BN_GENCB_PRIME_TEST, n=-1: when finished trial division primality
609 * checks.
610 * event=BN_GENCB_PRIME_TEST, n=i: when the i'th primality test has finished.
611 *
612 * The callback can return zero to abort the generation progress or one to
613 * allow it to continue.
614 *
615 * When other code needs to call a BN generation function it will often take a
616 * BN_GENCB argument and may call the function with other argument values. */
617#define BN_GENCB_GENERATED 0
618#define BN_GENCB_PRIME_TEST 1
619
620struct bn_gencb_st {
621 void *arg; /* callback-specific data */
622 int (*callback)(int event, int n, struct bn_gencb_st *);
623};
624
625/* BN_GENCB_set configures |callback| to call |f| and sets |callout->arg| to
626 * |arg|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700627OPENSSL_EXPORT void BN_GENCB_set(BN_GENCB *callback,
628 int (*f)(int event, int n,
629 struct bn_gencb_st *),
630 void *arg);
Adam Langley95c29f32014-06-20 12:00:00 -0700631
632/* BN_GENCB_call calls |callback|, if not NULL, and returns the return value of
633 * the callback, or 1 if |callback| is NULL. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700634OPENSSL_EXPORT int BN_GENCB_call(BN_GENCB *callback, int event, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700635
636/* BN_generate_prime_ex sets |ret| to a prime number of |bits| length. If safe
637 * is non-zero then the prime will be such that (ret-1)/2 is also a prime.
638 * (This is needed for Diffie-Hellman groups to ensure that the only subgroups
639 * are of size 2 and (p-1)/2.).
640 *
641 * If |add| is not NULL, the prime will fulfill the condition |ret| % |add| ==
642 * |rem| in order to suit a given generator. (If |rem| is NULL then |ret| %
643 * |add| == 1.)
644 *
645 * If |cb| is not NULL, it will be called during processing to give an
646 * indication of progress. See the comments for |BN_GENCB|. It returns one on
647 * success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700648OPENSSL_EXPORT int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
649 const BIGNUM *add, const BIGNUM *rem,
650 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700651
652/* BN_prime_checks is magic value that can be used as the |checks| argument to
653 * the primality testing functions in order to automatically select a number of
654 * Miller-Rabin checks that gives a false positive rate of ~2^{-80}. */
655#define BN_prime_checks 0
656
657/* BN_primality_test sets |*is_probably_prime| to one if |candidate| is
658 * probably a prime number by the Miller-Rabin test or zero if it's certainly
659 * not.
660 *
661 * If |do_trial_division| is non-zero then |candidate| will be tested against a
662 * list of small primes before Miller-Rabin tests. The probability of this
663 * function returning a false positive is 2^{2*checks}. If |checks| is
664 * |BN_prime_checks| then a value that results in approximately 2^{-80} false
665 * positive probability is used. If |cb| is not NULL then it is called during
666 * the checking process. See the comment above |BN_GENCB|.
667 *
668 * The function returns one on success and zero on error.
669 *
670 * (If you are unsure whether you want |do_trial_division|, don't set it.) */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700671OPENSSL_EXPORT int BN_primality_test(int *is_probably_prime,
672 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_fasttest_ex returns one if |candidate| is probably a prime
677 * number by the Miller-Rabin test, zero if it's certainly not and -1 on error.
678 *
679 * If |do_trial_division| is non-zero then |candidate| will be tested against a
680 * list of small primes before Miller-Rabin tests. The probability of this
681 * function returning one when |candidate| is composite is 2^{2*checks}. If
682 * |checks| is |BN_prime_checks| then a value that results in approximately
683 * 2^{-80} false positive probability is used. If |cb| is not NULL then it is
684 * called during the checking process. See the comment above |BN_GENCB|.
685 *
686 * WARNING: deprecated. Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700687OPENSSL_EXPORT int BN_is_prime_fasttest_ex(const BIGNUM *candidate, int checks,
688 BN_CTX *ctx, int do_trial_division,
689 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700690
691/* BN_is_prime_ex acts the same as |BN_is_prime_fasttest_ex| with
692 * |do_trial_division| set to zero.
693 *
694 * WARNING: deprecated: Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700695OPENSSL_EXPORT int BN_is_prime_ex(const BIGNUM *candidate, int checks,
696 BN_CTX *ctx, BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700697
698
699/* Number theory functions */
700
701/* BN_gcd sets |r| = gcd(|a|, |b|). It returns one on success and zero
702 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700703OPENSSL_EXPORT int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
704 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700705
706/* BN_mod_inverse sets |out| equal to |a|^-1, mod |n|. If either of |a| or |n|
707 * have |BN_FLG_CONSTTIME| set then the operation is performed in constant
708 * time. If |out| is NULL, a fresh BIGNUM is allocated. It returns the result
709 * or NULL on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700710OPENSSL_EXPORT BIGNUM *BN_mod_inverse(BIGNUM *out, const BIGNUM *a,
711 const BIGNUM *n, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700712
Adam Langley06fa67c2015-09-08 16:31:33 -0700713/* BN_mod_inverse_ex acts like |BN_mod_inverse| except that, when it returns
714 * zero, it will set |*out_no_inverse| to one if the failure was caused because
715 * |a| has no inverse mod |n|. Otherwise it will set |*out_no_inverse| to
716 * zero. */
717OPENSSL_EXPORT BIGNUM *BN_mod_inverse_ex(BIGNUM *out, int *out_no_inverse,
718 const BIGNUM *a, const BIGNUM *n,
719 BN_CTX *ctx);
720
Adam Langley95c29f32014-06-20 12:00:00 -0700721/* BN_kronecker returns the Kronecker symbol of |a| and |b| (which is -1, 0 or
722 * 1), or -2 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700723OPENSSL_EXPORT int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700724
725
726/* Montgomery arithmetic. */
727
728/* BN_MONT_CTX contains the precomputed values needed to work in a specific
729 * Montgomery domain. */
730
731/* BN_MONT_CTX_new returns a fresh BN_MONT_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700732OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700733
David Benjamin12f77372015-10-26 11:31:51 -0400734/* BN_MONT_CTX_free frees memory associated with |mont|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700735OPENSSL_EXPORT void BN_MONT_CTX_free(BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700736
737/* BN_MONT_CTX_copy sets |to| equal to |from|. It returns |to| on success or
738 * NULL on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700739OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,
David Benjamine82e6f62015-11-03 10:40:23 -0500740 const BN_MONT_CTX *from);
Adam Langley95c29f32014-06-20 12:00:00 -0700741
742/* BN_MONT_CTX_set sets up a Montgomery context given the modulus, |mod|. It
743 * returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700744OPENSSL_EXPORT int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod,
745 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700746
Adam Langley683d7bd2015-04-13 11:04:14 -0700747/* BN_MONT_CTX_set_locked takes |lock| and checks whether |*pmont| is NULL. If
748 * so, it creates a new |BN_MONT_CTX| and sets the modulus for it to |mod|. It
749 * then stores it as |*pmont| and returns it, or NULL on error.
Adam Langley95c29f32014-06-20 12:00:00 -0700750 *
751 * If |*pmont| is already non-NULL then the existing value is returned. */
Adam Langley683d7bd2015-04-13 11:04:14 -0700752BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_MUTEX *lock,
753 const BIGNUM *mod, BN_CTX *bn_ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700754
755/* BN_to_montgomery sets |ret| equal to |a| in the Montgomery domain. It
756 * returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700757OPENSSL_EXPORT int BN_to_montgomery(BIGNUM *ret, const BIGNUM *a,
758 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700759
760/* BN_from_montgomery sets |ret| equal to |a| * R^-1, i.e. translates values
761 * out of the Montgomery domain. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700762OPENSSL_EXPORT int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a,
763 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700764
765/* BN_mod_mul_montgomery set |r| equal to |a| * |b|, in the Montgomery domain.
766 * Both |a| and |b| must already be in the Montgomery domain (by
767 * |BN_to_montgomery|). It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700768OPENSSL_EXPORT int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a,
769 const BIGNUM *b,
770 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700771
772
773/* Exponentiation. */
774
775/* BN_exp sets |r| equal to |a|^{|p|}. It does so with a square-and-multiply
776 * algorithm that leaks side-channel information. It returns one on success or
777 * zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700778OPENSSL_EXPORT int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
779 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700780
Adam Langley5d17dd62014-06-30 14:22:32 -0700781/* BN_mod_exp sets |r| equal to |a|^{|p|} mod |m|. It does so with the best
Adam Langley95c29f32014-06-20 12:00:00 -0700782 * algorithm for the values provided and can run in constant time if
783 * |BN_FLG_CONSTTIME| is set for |p|. It returns one on success or zero
784 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700785OPENSSL_EXPORT int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
786 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700787
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700788OPENSSL_EXPORT int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
789 const BIGNUM *m, BN_CTX *ctx,
David Benjamine82e6f62015-11-03 10:40:23 -0500790 const BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700791
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700792OPENSSL_EXPORT int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a,
793 const BIGNUM *p, const BIGNUM *m,
Adam Langleyefb42fb2015-11-02 17:39:02 -0800794 BN_CTX *ctx,
795 const BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700796
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700797OPENSSL_EXPORT int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
798 const BIGNUM *m, BN_CTX *ctx,
David Benjamine82e6f62015-11-03 10:40:23 -0500799 const BN_MONT_CTX *mont);
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700800OPENSSL_EXPORT int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1,
801 const BIGNUM *p1, const BIGNUM *a2,
802 const BIGNUM *p2, const BIGNUM *m,
David Benjamine82e6f62015-11-03 10:40:23 -0500803 BN_CTX *ctx, const BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700804
805
Matt Braithwaite64887252015-08-11 17:17:28 -0700806/* Deprecated functions */
807
808/* BN_bn2mpi serialises the value of |in| to |out|, using a format that consists
809 * of the number's length in bytes represented as a 4-byte big-endian number,
810 * and the number itself in big-endian format, where the most significant bit
811 * signals a negative number. (The representation of numbers with the MSB set is
812 * prefixed with null byte). |out| must have sufficient space available; to
813 * find the needed amount of space, call the function with |out| set to NULL. */
814OPENSSL_EXPORT size_t BN_bn2mpi(const BIGNUM *in, uint8_t *out);
815
Adam Langley5f889992015-11-04 14:05:00 -0800816/* BN_mpi2bn parses |len| bytes from |in| and returns the resulting value. The
Matt Braithwaite64887252015-08-11 17:17:28 -0700817 * bytes at |in| are expected to be in the format emitted by |BN_bn2mpi|.
818 *
819 * If |out| is NULL then a fresh |BIGNUM| is allocated and returned, otherwise
820 * |out| is reused and returned. On error, NULL is returned and the error queue
821 * is updated. */
822OPENSSL_EXPORT BIGNUM *BN_mpi2bn(const uint8_t *in, size_t len, BIGNUM *out);
823
824
Adam Langley95c29f32014-06-20 12:00:00 -0700825/* Private functions */
826
827struct bignum_st {
828 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks in little-endian
829 order. */
830 int top; /* Index of last used element in |d|, plus one. */
831 int dmax; /* Size of |d|, in words. */
832 int neg; /* one if the number is negative */
833 int flags; /* bitmask of BN_FLG_* values */
834};
835
836struct bn_mont_ctx_st {
837 BIGNUM RR; /* used to convert to montgomery form */
838 BIGNUM N; /* The modulus */
Brian Smith8bde5d22015-11-11 18:36:23 -1000839 BN_ULONG n0[2]; /* least significant words of (R*Ri-1)/N */
Adam Langley95c29f32014-06-20 12:00:00 -0700840 int ri; /* number of bits in R */
841};
842
Adam Langley214cd442014-08-18 11:35:45 -0700843OPENSSL_EXPORT unsigned BN_num_bits_word(BN_ULONG l);
Adam Langley95c29f32014-06-20 12:00:00 -0700844
845#define BN_FLG_MALLOCED 0x01
846#define BN_FLG_STATIC_DATA 0x02
847/* avoid leaking exponent information through timing, BN_mod_exp_mont() will
848 * call BN_mod_exp_mont_consttime, BN_div() will call BN_div_no_branch,
849 * BN_mod_inverse() will call BN_mod_inverse_no_branch. */
850#define BN_FLG_CONSTTIME 0x04
851
852
Adam Langley7cc3f992015-01-07 15:06:31 -0800853/* Android compatibility section.
854 *
855 * These functions are declared, temporarily, for Android because
856 * wpa_supplicant will take a little time to sync with upstream. Outside of
857 * Android they'll have no definition. */
858
859OPENSSL_EXPORT BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
860
861
Adam Langley95c29f32014-06-20 12:00:00 -0700862#if defined(__cplusplus)
863} /* extern C */
864#endif
865
David Benjamin689be0f2015-02-11 15:55:26 -0500866#define BN_R_ARG2_LT_ARG3 100
867#define BN_R_BAD_RECIPROCAL 101
868#define BN_R_BIGNUM_TOO_LONG 102
869#define BN_R_BITS_TOO_SMALL 103
870#define BN_R_CALLED_WITH_EVEN_MODULUS 104
871#define BN_R_DIV_BY_ZERO 105
872#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 106
873#define BN_R_INPUT_NOT_REDUCED 107
874#define BN_R_INVALID_RANGE 108
875#define BN_R_NEGATIVE_NUMBER 109
876#define BN_R_NOT_A_SQUARE 110
877#define BN_R_NOT_INITIALIZED 111
878#define BN_R_NO_INVERSE 112
879#define BN_R_PRIVATE_KEY_TOO_LARGE 113
880#define BN_R_P_IS_NOT_PRIME 114
881#define BN_R_TOO_MANY_ITERATIONS 115
882#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 116
David Benjaminb9c579d2015-06-11 22:52:07 -0400883#define BN_R_BAD_ENCODING 117
884#define BN_R_ENCODE_ERROR 118
Adam Langley95c29f32014-06-20 12:00:00 -0700885
886#endif /* OPENSSL_HEADER_BN_H */