blob: 66945cb9f3089a8f6fb9ec23ca4e3187dcffce30 [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
David Benjamin40a63112016-08-23 20:53:12 -0700224/* BN_set_u64 sets |bn| to |value|. It returns one on success or zero on
225 * allocation failure. */
226OPENSSL_EXPORT int BN_set_u64(BIGNUM *bn, uint64_t value);
227
Adam Langley95c29f32014-06-20 12:00:00 -0700228/* BN_set_negative sets the sign of |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700229OPENSSL_EXPORT void BN_set_negative(BIGNUM *bn, int sign);
Adam Langley95c29f32014-06-20 12:00:00 -0700230
231/* BN_is_negative returns one if |bn| is negative and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700232OPENSSL_EXPORT int BN_is_negative(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700233
234/* BN_get_flags returns |bn->flags| & |flags|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700235OPENSSL_EXPORT int BN_get_flags(const BIGNUM *bn, int flags);
Adam Langley95c29f32014-06-20 12:00:00 -0700236
237/* BN_set_flags sets |flags| on |bn|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700238OPENSSL_EXPORT void BN_set_flags(BIGNUM *bn, int flags);
Adam Langley95c29f32014-06-20 12:00:00 -0700239
240
241/* Conversion functions. */
242
243/* BN_bin2bn sets |*ret| to the value of |len| bytes from |in|, interpreted as
244 * a big-endian number, and returns |ret|. If |ret| is NULL then a fresh
245 * |BIGNUM| is allocated and returned. It returns NULL on allocation
246 * failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700247OPENSSL_EXPORT BIGNUM *BN_bin2bn(const uint8_t *in, size_t len, BIGNUM *ret);
Adam Langley95c29f32014-06-20 12:00:00 -0700248
249/* BN_bn2bin serialises the absolute value of |in| to |out| as a big-endian
250 * integer, which must have |BN_num_bytes| of space available. It returns the
251 * number of bytes written. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700252OPENSSL_EXPORT size_t BN_bn2bin(const BIGNUM *in, uint8_t *out);
Adam Langley95c29f32014-06-20 12:00:00 -0700253
Adam Langley6887edb2014-06-20 12:00:00 -0700254/* BN_bn2bin_padded serialises the absolute value of |in| to |out| as a
255 * big-endian integer. The integer is padded with leading zeros up to size
256 * |len|. If |len| is smaller than |BN_num_bytes|, the function fails and
257 * returns 0. Otherwise, it returns 1. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700258OPENSSL_EXPORT int BN_bn2bin_padded(uint8_t *out, size_t len, const BIGNUM *in);
Adam Langley6887edb2014-06-20 12:00:00 -0700259
David Benjaminae0eaaa2015-12-17 02:01:25 -0500260/* BN_bn2cbb_padded behaves like |BN_bn2bin_padded| but writes to a |CBB|. */
261OPENSSL_EXPORT int BN_bn2cbb_padded(CBB *out, size_t len, const BIGNUM *in);
262
Adam Langley95c29f32014-06-20 12:00:00 -0700263/* BN_bn2hex returns an allocated string that contains a NUL-terminated, hex
264 * representation of |bn|. If |bn| is negative, the first char in the resulting
265 * string will be '-'. Returns NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700266OPENSSL_EXPORT char *BN_bn2hex(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700267
268/* BN_hex2bn parses the leading hex number from |in|, which may be proceeded by
269 * a '-' to indicate a negative number and may contain trailing, non-hex data.
270 * If |outp| is not NULL, it constructs a BIGNUM equal to the hex number and
271 * stores it in |*outp|. If |*outp| is NULL then it allocates a new BIGNUM and
272 * updates |*outp|. It returns the number of bytes of |in| processed or zero on
273 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700274OPENSSL_EXPORT int BN_hex2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700275
276/* BN_bn2dec returns an allocated string that contains a NUL-terminated,
277 * decimal representation of |bn|. If |bn| is negative, the first char in the
278 * resulting string will be '-'. Returns NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700279OPENSSL_EXPORT char *BN_bn2dec(const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700280
281/* BN_dec2bn parses the leading decimal number from |in|, which may be
282 * proceeded by a '-' to indicate a negative number and may contain trailing,
283 * non-decimal data. If |outp| is not NULL, it constructs a BIGNUM equal to the
284 * decimal number and stores it in |*outp|. If |*outp| is NULL then it
285 * allocates a new BIGNUM and updates |*outp|. It returns the number of bytes
286 * of |in| processed or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700287OPENSSL_EXPORT int BN_dec2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700288
289/* BN_asc2bn acts like |BN_dec2bn| or |BN_hex2bn| depending on whether |in|
290 * begins with "0X" or "0x" (indicating hex) or not (indicating decimal). A
291 * leading '-' is still permitted and comes before the optional 0X/0x. It
292 * returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700293OPENSSL_EXPORT int BN_asc2bn(BIGNUM **outp, const char *in);
Adam Langley95c29f32014-06-20 12:00:00 -0700294
295/* BN_print writes a hex encoding of |a| to |bio|. It returns one on success
296 * and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700297OPENSSL_EXPORT int BN_print(BIO *bio, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700298
299/* BN_print_fp acts like |BIO_print|, but wraps |fp| in a |BIO| first. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700300OPENSSL_EXPORT int BN_print_fp(FILE *fp, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700301
302/* BN_get_word returns the absolute value of |bn| as a single word. If |bn| is
303 * too large to be represented as a single word, the maximum possible value
304 * will be returned. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700305OPENSSL_EXPORT BN_ULONG BN_get_word(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700306
307
David Benjaminb9c579d2015-06-11 22:52:07 -0400308/* ASN.1 functions. */
309
David Benjaminacb24512015-12-22 15:02:01 -0500310/* BN_parse_asn1_unsigned parses a non-negative DER INTEGER from |cbs| writes
311 * the result to |ret|. It returns one on success and zero on failure. */
312OPENSSL_EXPORT int BN_parse_asn1_unsigned(CBS *cbs, BIGNUM *ret);
David Benjaminb9c579d2015-06-11 22:52:07 -0400313
David Benjaminacb24512015-12-22 15:02:01 -0500314/* BN_parse_asn1_unsigned_buggy acts like |BN_parse_asn1_unsigned| but tolerates
315 * some invalid encodings. Do not use this function. */
316OPENSSL_EXPORT int BN_parse_asn1_unsigned_buggy(CBS *cbs, BIGNUM *ret);
David Benjamin231cb822015-09-15 16:47:35 -0400317
David Benjaminacb24512015-12-22 15:02:01 -0500318/* BN_marshal_asn1 marshals |bn| as a non-negative DER INTEGER and appends the
319 * result to |cbb|. It returns one on success and zero on failure. */
320OPENSSL_EXPORT int BN_marshal_asn1(CBB *cbb, const BIGNUM *bn);
David Benjaminb9c579d2015-06-11 22:52:07 -0400321
322
Adam Langleyb8b54782014-08-13 10:31:52 -0700323/* Internal functions.
324 *
325 * These functions are useful for code that is doing low-level manipulations of
326 * BIGNUM values. However, be sure that no other function in this file does
327 * what you want before turning to these. */
328
329/* bn_correct_top decrements |bn->top| until |bn->d[top-1]| is non-zero or
David Benjamin899b9b12016-08-02 13:09:19 -0400330 * until |top| is zero. If |bn| is zero, |bn->neg| is set to zero. */
Adam Langleyb8b54782014-08-13 10:31:52 -0700331OPENSSL_EXPORT void bn_correct_top(BIGNUM *bn);
332
333/* bn_wexpand ensures that |bn| has at least |words| works of space without
David Benjamin4c4ff022016-08-23 10:09:04 -0700334 * altering its value. It returns |bn| on success or NULL on allocation
Adam Langleyb8b54782014-08-13 10:31:52 -0700335 * failure. */
David Benjamin719220e2015-08-11 12:05:02 -0400336OPENSSL_EXPORT BIGNUM *bn_wexpand(BIGNUM *bn, size_t words);
Adam Langleyb8b54782014-08-13 10:31:52 -0700337
338
Adam Langley95c29f32014-06-20 12:00:00 -0700339/* BIGNUM pools.
340 *
341 * Certain BIGNUM operations need to use many temporary variables and
342 * allocating and freeing them can be quite slow. Thus such opertions typically
343 * take a |BN_CTX| parameter, which contains a pool of |BIGNUMs|. The |ctx|
344 * argument to a public function may be NULL, in which case a local |BN_CTX|
345 * will be created just for the lifetime of that call.
346 *
347 * A function must call |BN_CTX_start| first. Then, |BN_CTX_get| may be called
348 * repeatedly to obtain temporary |BIGNUM|s. All |BN_CTX_get| calls must be made
349 * before calling any other functions that use the |ctx| as an argument.
350 *
351 * Finally, |BN_CTX_end| must be called before returning from the function.
352 * When |BN_CTX_end| is called, the |BIGNUM| pointers obtained from
353 * |BN_CTX_get| become invalid. */
354
355/* BN_CTX_new returns a new, empty BN_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700356OPENSSL_EXPORT BN_CTX *BN_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700357
358/* BN_CTX_free frees all BIGNUMs contained in |ctx| and then frees |ctx|
359 * itself. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700360OPENSSL_EXPORT void BN_CTX_free(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700361
362/* BN_CTX_start "pushes" a new entry onto the |ctx| stack and allows future
363 * calls to |BN_CTX_get|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700364OPENSSL_EXPORT void BN_CTX_start(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700365
366/* BN_CTX_get returns a new |BIGNUM|, or NULL on allocation failure. Once
367 * |BN_CTX_get| has returned NULL, all future calls will also return NULL until
368 * |BN_CTX_end| is called. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700369OPENSSL_EXPORT BIGNUM *BN_CTX_get(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700370
371/* BN_CTX_end invalidates all |BIGNUM|s returned from |BN_CTX_get| since the
372 * matching |BN_CTX_start| call. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700373OPENSSL_EXPORT void BN_CTX_end(BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700374
375
376/* Simple arithmetic */
377
378/* BN_add sets |r| = |a| + |b|, where |r| may be the same pointer as either |a|
379 * or |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700380OPENSSL_EXPORT int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700381
382/* BN_uadd sets |r| = |a| + |b|, where |a| and |b| are non-negative and |r| may
383 * be the same pointer as either |a| or |b|. It returns one on success and zero
384 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700385OPENSSL_EXPORT int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700386
387/* BN_add_word adds |w| to |a|. It returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700388OPENSSL_EXPORT int BN_add_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700389
Brian Smithe4bf8b32016-07-01 13:36:06 -1000390/* BN_sub sets |r| = |a| - |b|, where |r| may be the same pointer as either |a|
391 * or |b|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700392OPENSSL_EXPORT int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700393
David Benjamin25c93ff2014-08-27 12:09:26 -0400394/* BN_usub sets |r| = |a| - |b|, where |a| and |b| are non-negative integers,
Brian Smith3d4030b2016-07-01 14:12:40 -1000395 * |b| < |a| and |r| may be the same pointer as either |a| or |b|. It returns
Adam Langley95c29f32014-06-20 12:00:00 -0700396 * one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700397OPENSSL_EXPORT int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700398
399/* BN_sub_word subtracts |w| from |a|. It returns one on success and zero on
400 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700401OPENSSL_EXPORT int BN_sub_word(BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700402
403/* BN_mul sets |r| = |a| * |b|, where |r| may be the same pointer as |a| or
404 * |b|. Returns one on success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700405OPENSSL_EXPORT int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
406 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700407
408/* BN_mul_word sets |bn| = |bn| * |w|. It returns one on success or zero on
409 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700410OPENSSL_EXPORT int BN_mul_word(BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700411
412/* BN_sqr sets |r| = |a|^2 (i.e. squares), where |r| may be the same pointer as
413 * |a|. Returns one on success and zero otherwise. This is more efficient than
414 * BN_mul(r, a, a, ctx). */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700415OPENSSL_EXPORT int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700416
417/* BN_div divides |numerator| by |divisor| and places the result in |quotient|
418 * and the remainder in |rem|. Either of |quotient| or |rem| may be NULL, in
419 * which case the respective value is not returned. The result is rounded
420 * towards zero; thus if |numerator| is negative, the remainder will be zero or
421 * negative. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700422OPENSSL_EXPORT int BN_div(BIGNUM *quotient, BIGNUM *rem,
423 const BIGNUM *numerator, const BIGNUM *divisor,
424 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700425
426/* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the
427 * remainder or (BN_ULONG)-1 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700428OPENSSL_EXPORT BN_ULONG BN_div_word(BIGNUM *numerator, BN_ULONG divisor);
Adam Langley95c29f32014-06-20 12:00:00 -0700429
Adam Langley409766d2014-06-20 12:00:00 -0700430/* BN_sqrt sets |*out_sqrt| (which may be the same |BIGNUM| as |in|) to the
431 * square root of |in|, using |ctx|. It returns one on success or zero on
432 * error. Negative numbers and non-square numbers will result in an error with
433 * appropriate errors on the error queue. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700434OPENSSL_EXPORT int BN_sqrt(BIGNUM *out_sqrt, const BIGNUM *in, BN_CTX *ctx);
Adam Langley409766d2014-06-20 12:00:00 -0700435
Adam Langley95c29f32014-06-20 12:00:00 -0700436
437/* Comparison functions */
438
439/* BN_cmp returns a value less than, equal to or greater than zero if |a| is
440 * less than, equal to or greater than |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700441OPENSSL_EXPORT int BN_cmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700442
Brian Smith4edca0b2016-07-25 10:36:58 -1000443/* BN_cmp_word is like |BN_cmp| except it takes its second argument as a
444 * |BN_ULONG| instead of a |BIGNUM|. */
David Benjaminccd511e2016-07-29 12:11:34 -0400445OPENSSL_EXPORT int BN_cmp_word(const BIGNUM *a, BN_ULONG b);
Brian Smith4edca0b2016-07-25 10:36:58 -1000446
Adam Langley95c29f32014-06-20 12:00:00 -0700447/* BN_ucmp returns a value less than, equal to or greater than zero if the
448 * absolute value of |a| is less than, equal to or greater than the absolute
449 * value of |b|, respectively. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700450OPENSSL_EXPORT int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
Adam Langley95c29f32014-06-20 12:00:00 -0700451
Brian Smith86080c32016-03-25 12:23:16 -1000452/* BN_equal_consttime returns one if |a| is equal to |b|, and zero otherwise.
453 * It takes an amount of time dependent on the sizes of |a| and |b|, but
454 * independent of the contents (including the signs) of |a| and |b|. */
455OPENSSL_EXPORT int BN_equal_consttime(const BIGNUM *a, const BIGNUM *b);
456
Adam Langley95c29f32014-06-20 12:00:00 -0700457/* BN_abs_is_word returns one if the absolute value of |bn| equals |w| and zero
458 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700459OPENSSL_EXPORT int BN_abs_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700460
461/* BN_is_zero returns one if |bn| is zero and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700462OPENSSL_EXPORT int BN_is_zero(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700463
464/* BN_is_one returns one if |bn| equals one and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700465OPENSSL_EXPORT int BN_is_one(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700466
467/* BN_is_word returns one if |bn| is exactly |w| and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700468OPENSSL_EXPORT int BN_is_word(const BIGNUM *bn, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700469
470/* BN_is_odd returns one if |bn| is odd and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700471OPENSSL_EXPORT int BN_is_odd(const BIGNUM *bn);
Adam Langley95c29f32014-06-20 12:00:00 -0700472
473
474/* Bitwise operations. */
475
476/* BN_lshift sets |r| equal to |a| << n. The |a| and |r| arguments may be the
477 * same |BIGNUM|. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700478OPENSSL_EXPORT int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700479
480/* BN_lshift1 sets |r| equal to |a| << 1, where |r| and |a| may be the same
481 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700482OPENSSL_EXPORT int BN_lshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700483
484/* BN_rshift sets |r| equal to |a| >> n, where |r| and |a| may be the same
485 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700486OPENSSL_EXPORT int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700487
488/* BN_rshift1 sets |r| equal to |a| >> 1, where |r| and |a| may be the same
489 * pointer. It returns one on success and zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700490OPENSSL_EXPORT int BN_rshift1(BIGNUM *r, const BIGNUM *a);
Adam Langley95c29f32014-06-20 12:00:00 -0700491
492/* BN_set_bit sets the |n|th, least-significant bit in |a|. For example, if |a|
493 * is 2 then setting bit zero will make it 3. It returns one on success or zero
494 * on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700495OPENSSL_EXPORT int BN_set_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700496
497/* BN_clear_bit clears the |n|th, least-significant bit in |a|. For example, if
498 * |a| is 3, clearing bit zero will make it two. It returns one on success or
499 * zero on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700500OPENSSL_EXPORT int BN_clear_bit(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700501
502/* BN_is_bit_set returns the value of the |n|th, least-significant bit in |a|,
503 * or zero if the bit doesn't exist. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700504OPENSSL_EXPORT int BN_is_bit_set(const BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700505
506/* BN_mask_bits truncates |a| so that it is only |n| bits long. It returns one
507 * on success or zero if |n| is greater than the length of |a| already. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700508OPENSSL_EXPORT int BN_mask_bits(BIGNUM *a, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700509
510
511/* Modulo arithmetic. */
512
David Benjamin44bedc32016-06-23 16:05:02 -0400513/* BN_mod_word returns |a| mod |w| or (BN_ULONG)-1 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700514OPENSSL_EXPORT BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
Adam Langley95c29f32014-06-20 12:00:00 -0700515
516/* BN_mod is a helper macro that calls |BN_div| and discards the quotient. */
517#define BN_mod(rem, numerator, divisor, ctx) \
518 BN_div(NULL, (rem), (numerator), (divisor), (ctx))
519
520/* BN_nnmod is a non-negative modulo function. It acts like |BN_mod|, but 0 <=
David Benjamina5974bf2015-03-25 23:49:37 -0400521 * |rem| < |divisor| is always true. It returns one on success and zero on
522 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700523OPENSSL_EXPORT int BN_nnmod(BIGNUM *rem, const BIGNUM *numerator,
524 const BIGNUM *divisor, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700525
526/* BN_mod_add sets |r| = |a| + |b| mod |m|. It returns one on success and zero
527 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700528OPENSSL_EXPORT int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
529 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700530
531/* BN_mod_add_quick acts like |BN_mod_add| but requires that |a| and |b| be
532 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700533OPENSSL_EXPORT int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
534 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700535
536/* BN_mod_sub sets |r| = |a| - |b| mod |m|. It returns one on success and zero
537 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700538OPENSSL_EXPORT int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
539 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700540
541/* BN_mod_sub_quick acts like |BN_mod_sub| but requires that |a| and |b| be
542 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700543OPENSSL_EXPORT int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
544 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700545
546/* BN_mod_mul sets |r| = |a|*|b| mod |m|. It returns one on success and zero
547 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700548OPENSSL_EXPORT int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
549 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700550
Adam Langley5f889992015-11-04 14:05:00 -0800551/* BN_mod_sqr sets |r| = |a|^2 mod |m|. It returns one on success and zero
Adam Langley95c29f32014-06-20 12:00:00 -0700552 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700553OPENSSL_EXPORT int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
554 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700555
556/* BN_mod_lshift sets |r| = (|a| << n) mod |m|, where |r| and |a| may be the
557 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700558OPENSSL_EXPORT int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n,
559 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700560
561/* BN_mod_lshift_quick acts like |BN_mod_lshift| but requires that |a| be
562 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700563OPENSSL_EXPORT int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n,
564 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700565
566/* BN_mod_lshift1 sets |r| = (|a| << 1) mod |m|, where |r| and |a| may be the
567 * same pointer. It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700568OPENSSL_EXPORT int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m,
569 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700570
571/* BN_mod_lshift1_quick acts like |BN_mod_lshift1| but requires that |a| be
572 * non-negative and less than |m|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700573OPENSSL_EXPORT int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a,
574 const BIGNUM *m);
Adam Langley95c29f32014-06-20 12:00:00 -0700575
David Benjamince9a2162016-07-03 12:03:54 -0400576/* BN_mod_sqrt returns a |BIGNUM|, r, such that r^2 == a (mod p). |p| must be a
577 * prime. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700578OPENSSL_EXPORT BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p,
579 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700580
581
582/* Random and prime number generation. */
583
David Benjamind224d522016-08-16 10:03:45 -0400584/* The following are values for the |top| parameter of |BN_rand|. */
585#define BN_RAND_TOP_ANY -1
586#define BN_RAND_TOP_ONE 0
587#define BN_RAND_TOP_TWO 1
588
589/* The following are values for the |bottom| parameter of |BN_rand|. */
590#define BN_RAND_BOTTOM_ANY 0
591#define BN_RAND_BOTTOM_ODD 1
592
593/* BN_rand sets |rnd| to a random number of length |bits|. It returns one on
594 * success and zero otherwise.
Adam Langley95c29f32014-06-20 12:00:00 -0700595 *
David Benjamind224d522016-08-16 10:03:45 -0400596 * |top| must be one of the |BN_RAND_TOP_*| values. If |BN_RAND_TOP_ONE|, the
597 * most-significant bit, if any, will be set. If |BN_RAND_TOP_TWO|, the two
598 * most significant bits, if any, will be set. If |BN_RAND_TOP_ANY|, no extra
599 * action will be taken and |BN_num_bits(rnd)| may not equal |bits| if the most
600 * significant bits randomly ended up as zeros.
Adam Langley95c29f32014-06-20 12:00:00 -0700601 *
David Benjamind224d522016-08-16 10:03:45 -0400602 * |bottom| must be one of the |BN_RAND_BOTTOM_*| values. If
603 * |BN_RAND_BOTTOM_ODD|, the least-significant bit, if any, will be set. If
604 * |BN_RAND_BOTTOM_ANY|, no extra action will be taken. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700605OPENSSL_EXPORT int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700606
607/* BN_pseudo_rand is an alias for |BN_rand|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700608OPENSSL_EXPORT int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
Adam Langley95c29f32014-06-20 12:00:00 -0700609
Brian Smith4edca0b2016-07-25 10:36:58 -1000610/* BN_rand_range is equivalent to |BN_rand_range_ex| with |min_inclusive| set
611 * to zero and |max_exclusive| set to |range|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700612OPENSSL_EXPORT int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700613
Brian Smith4edca0b2016-07-25 10:36:58 -1000614/* BN_rand_range_ex sets |rnd| to a random value in
615 * [min_inclusive..max_exclusive). It returns one on success and zero
616 * otherwise. */
617OPENSSL_EXPORT int BN_rand_range_ex(BIGNUM *r, BN_ULONG min_inclusive,
618 const BIGNUM *max_exclusive);
619
Adam Langley95c29f32014-06-20 12:00:00 -0700620/* BN_pseudo_rand_range is an alias for BN_rand_range. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700621OPENSSL_EXPORT int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
Adam Langley95c29f32014-06-20 12:00:00 -0700622
Adam Langleyd4b4f082014-06-20 12:00:00 -0700623/* BN_generate_dsa_nonce generates a random number 0 <= out < range. Unlike
624 * BN_rand_range, it also includes the contents of |priv| and |message| in the
625 * generation so that an RNG failure isn't fatal as long as |priv| remains
626 * secret. This is intended for use in DSA and ECDSA where an RNG weakness
627 * leads directly to private key exposure unless this function is used.
628 * It returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700629OPENSSL_EXPORT int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
630 const BIGNUM *priv,
631 const uint8_t *message,
632 size_t message_len, BN_CTX *ctx);
Adam Langleyd4b4f082014-06-20 12:00:00 -0700633
Adam Langley95c29f32014-06-20 12:00:00 -0700634/* BN_GENCB holds a callback function that is used by generation functions that
635 * can take a very long time to complete. Use |BN_GENCB_set| to initialise a
636 * |BN_GENCB| structure.
637 *
638 * The callback receives the address of that |BN_GENCB| structure as its last
639 * argument and the user is free to put an arbitary pointer in |arg|. The other
640 * arguments are set as follows:
641 * event=BN_GENCB_GENERATED, n=i: after generating the i'th possible prime
642 * number.
643 * event=BN_GENCB_PRIME_TEST, n=-1: when finished trial division primality
644 * checks.
645 * event=BN_GENCB_PRIME_TEST, n=i: when the i'th primality test has finished.
646 *
647 * The callback can return zero to abort the generation progress or one to
648 * allow it to continue.
649 *
650 * When other code needs to call a BN generation function it will often take a
651 * BN_GENCB argument and may call the function with other argument values. */
652#define BN_GENCB_GENERATED 0
653#define BN_GENCB_PRIME_TEST 1
654
655struct bn_gencb_st {
656 void *arg; /* callback-specific data */
657 int (*callback)(int event, int n, struct bn_gencb_st *);
658};
659
660/* BN_GENCB_set configures |callback| to call |f| and sets |callout->arg| to
661 * |arg|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700662OPENSSL_EXPORT void BN_GENCB_set(BN_GENCB *callback,
663 int (*f)(int event, int n,
664 struct bn_gencb_st *),
665 void *arg);
Adam Langley95c29f32014-06-20 12:00:00 -0700666
667/* BN_GENCB_call calls |callback|, if not NULL, and returns the return value of
668 * the callback, or 1 if |callback| is NULL. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700669OPENSSL_EXPORT int BN_GENCB_call(BN_GENCB *callback, int event, int n);
Adam Langley95c29f32014-06-20 12:00:00 -0700670
671/* BN_generate_prime_ex sets |ret| to a prime number of |bits| length. If safe
672 * is non-zero then the prime will be such that (ret-1)/2 is also a prime.
673 * (This is needed for Diffie-Hellman groups to ensure that the only subgroups
674 * are of size 2 and (p-1)/2.).
675 *
676 * If |add| is not NULL, the prime will fulfill the condition |ret| % |add| ==
677 * |rem| in order to suit a given generator. (If |rem| is NULL then |ret| %
678 * |add| == 1.)
679 *
680 * If |cb| is not NULL, it will be called during processing to give an
681 * indication of progress. See the comments for |BN_GENCB|. It returns one on
682 * success and zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700683OPENSSL_EXPORT int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
684 const BIGNUM *add, const BIGNUM *rem,
685 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700686
687/* BN_prime_checks is magic value that can be used as the |checks| argument to
688 * the primality testing functions in order to automatically select a number of
689 * Miller-Rabin checks that gives a false positive rate of ~2^{-80}. */
690#define BN_prime_checks 0
691
692/* BN_primality_test sets |*is_probably_prime| to one if |candidate| is
693 * probably a prime number by the Miller-Rabin test or zero if it's certainly
694 * not.
695 *
696 * If |do_trial_division| is non-zero then |candidate| will be tested against a
697 * list of small primes before Miller-Rabin tests. The probability of this
698 * function returning a false positive is 2^{2*checks}. If |checks| is
699 * |BN_prime_checks| then a value that results in approximately 2^{-80} false
700 * positive probability is used. If |cb| is not NULL then it is called during
701 * the checking process. See the comment above |BN_GENCB|.
702 *
703 * The function returns one on success and zero on error.
704 *
705 * (If you are unsure whether you want |do_trial_division|, don't set it.) */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700706OPENSSL_EXPORT int BN_primality_test(int *is_probably_prime,
707 const BIGNUM *candidate, int checks,
708 BN_CTX *ctx, int do_trial_division,
709 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700710
711/* BN_is_prime_fasttest_ex returns one if |candidate| is probably a prime
712 * number by the Miller-Rabin test, zero if it's certainly not and -1 on error.
713 *
714 * If |do_trial_division| is non-zero then |candidate| will be tested against a
715 * list of small primes before Miller-Rabin tests. The probability of this
716 * function returning one when |candidate| is composite is 2^{2*checks}. If
717 * |checks| is |BN_prime_checks| then a value that results in approximately
718 * 2^{-80} false positive probability is used. If |cb| is not NULL then it is
719 * called during the checking process. See the comment above |BN_GENCB|.
720 *
721 * WARNING: deprecated. Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700722OPENSSL_EXPORT int BN_is_prime_fasttest_ex(const BIGNUM *candidate, int checks,
723 BN_CTX *ctx, int do_trial_division,
724 BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700725
726/* BN_is_prime_ex acts the same as |BN_is_prime_fasttest_ex| with
727 * |do_trial_division| set to zero.
728 *
729 * WARNING: deprecated: Use |BN_primality_test|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700730OPENSSL_EXPORT int BN_is_prime_ex(const BIGNUM *candidate, int checks,
731 BN_CTX *ctx, BN_GENCB *cb);
Adam Langley95c29f32014-06-20 12:00:00 -0700732
733
734/* Number theory functions */
735
736/* BN_gcd sets |r| = gcd(|a|, |b|). It returns one on success and zero
737 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700738OPENSSL_EXPORT int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
739 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700740
Brian Smithec3cb3a2016-07-25 15:35:20 -1000741/* BN_mod_inverse sets |out| equal to |a|^-1, mod |n|. If |out| is NULL, a
742 * fresh BIGNUM is allocated. It returns the result or NULL on error.
743 *
744 * If either of |a| or |n| have |BN_FLG_CONSTTIME| set then the operation is
745 * performed using an algorithm that avoids some branches but which isn't
746 * constant-time. This function shouldn't be used for secret values, even
747 * with |BN_FLG_CONSTTIME|; use |BN_mod_inverse_blinded| instead. Or, if
748 * |n| is guaranteed to be prime, use
749 * |BN_mod_exp_mont_consttime(out, a, m_minus_2, m, ctx, m_mont)|, taking
750 * advantage of Fermat's Little Theorem. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700751OPENSSL_EXPORT BIGNUM *BN_mod_inverse(BIGNUM *out, const BIGNUM *a,
752 const BIGNUM *n, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700753
Brian Smithec3cb3a2016-07-25 15:35:20 -1000754/* BN_mod_inverse_blinded sets |out| equal to |a|^-1, mod |n|, where |n| is the
755 * Montgomery modulus for |mont|. |a| must be non-negative and must be less
756 * than |n|. |n| must be greater than 1. |a| is blinded (masked by a random
757 * value) to protect it against side-channel attacks. |BN_mod_inverse_blinded|
758 * may or may not ignore the |BN_FLG_CONSTTIME| flag on any/all of its inputs.
759 * It returns one on success or zero on failure. On failure, if the failure was
760 * caused by |a| having no inverse mod |n| then |*out_no_inverse| will be set
761 * to one; otherwise it will be set to zero. */
762int BN_mod_inverse_blinded(BIGNUM *out, int *out_no_inverse, const BIGNUM *a,
763 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley06fa67c2015-09-08 16:31:33 -0700764
Brian Smitha4327572016-08-02 16:58:57 -1000765/* BN_mod_inverse_odd sets |out| equal to |a|^-1, mod |n|. |a| must be
766 * non-negative and must be less than |n|. |n| must be odd. This function
767 * shouldn't be used for secret values; use |BN_mod_inverse_blinded| instead.
768 * Or, if |n| is guaranteed to be prime, use
769 * |BN_mod_exp_mont_consttime(out, a, m_minus_2, m, ctx, m_mont)|, taking
770 * advantage of Fermat's Little Theorem. It returns one on success or zero on
771 * failure. On failure, if the failure was caused by |a| having no inverse mod
772 * |n| then |*out_no_inverse| will be set to one; otherwise it will be set to
773 * zero. */
774int BN_mod_inverse_odd(BIGNUM *out, int *out_no_inverse, const BIGNUM *a,
775 const BIGNUM *n, BN_CTX *ctx);
776
Adam Langley95c29f32014-06-20 12:00:00 -0700777/* BN_kronecker returns the Kronecker symbol of |a| and |b| (which is -1, 0 or
778 * 1), or -2 on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700779OPENSSL_EXPORT int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700780
781
782/* Montgomery arithmetic. */
783
784/* BN_MONT_CTX contains the precomputed values needed to work in a specific
785 * Montgomery domain. */
786
787/* BN_MONT_CTX_new returns a fresh BN_MONT_CTX or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700788OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_new(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700789
David Benjamin12f77372015-10-26 11:31:51 -0400790/* BN_MONT_CTX_free frees memory associated with |mont|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700791OPENSSL_EXPORT void BN_MONT_CTX_free(BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700792
793/* BN_MONT_CTX_copy sets |to| equal to |from|. It returns |to| on success or
794 * NULL on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700795OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,
David Benjamine82e6f62015-11-03 10:40:23 -0500796 const BN_MONT_CTX *from);
Adam Langley95c29f32014-06-20 12:00:00 -0700797
798/* BN_MONT_CTX_set sets up a Montgomery context given the modulus, |mod|. It
799 * returns one on success and zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700800OPENSSL_EXPORT int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod,
801 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700802
Adam Langley683d7bd2015-04-13 11:04:14 -0700803/* BN_MONT_CTX_set_locked takes |lock| and checks whether |*pmont| is NULL. If
804 * so, it creates a new |BN_MONT_CTX| and sets the modulus for it to |mod|. It
Brian Smithd0357302016-03-25 10:11:04 -1000805 * then stores it as |*pmont|. It returns one on success and zero on error.
Adam Langley95c29f32014-06-20 12:00:00 -0700806 *
Brian Smithd0357302016-03-25 10:11:04 -1000807 * If |*pmont| is already non-NULL then it does nothing and returns one. */
808int BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_MUTEX *lock,
809 const BIGNUM *mod, BN_CTX *bn_ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700810
Brian Smith78f84f42016-07-30 21:17:10 -1000811/* BN_to_montgomery sets |ret| equal to |a| in the Montgomery domain. |a| is
812 * assumed to be in the range [0, n), where |n| is the Montgomery modulus. It
813 * returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700814OPENSSL_EXPORT int BN_to_montgomery(BIGNUM *ret, const BIGNUM *a,
815 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700816
Brian Smith78f84f42016-07-30 21:17:10 -1000817/* BN_from_montgomery sets |ret| equal to |a| * R^-1, i.e. translates values out
818 * of the Montgomery domain. |a| is assumed to be in the range [0, n), where |n|
819 * is the Montgomery modulus. It returns one on success or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700820OPENSSL_EXPORT int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a,
821 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700822
823/* BN_mod_mul_montgomery set |r| equal to |a| * |b|, in the Montgomery domain.
824 * Both |a| and |b| must already be in the Montgomery domain (by
Brian Smith78f84f42016-07-30 21:17:10 -1000825 * |BN_to_montgomery|). In particular, |a| and |b| are assumed to be in the
826 * range [0, n), where |n| is the Montgomery modulus. It returns one on success
827 * or zero on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700828OPENSSL_EXPORT int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a,
829 const BIGNUM *b,
830 const BN_MONT_CTX *mont, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700831
832
833/* Exponentiation. */
834
835/* BN_exp sets |r| equal to |a|^{|p|}. It does so with a square-and-multiply
836 * algorithm that leaks side-channel information. It returns one on success or
837 * zero otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700838OPENSSL_EXPORT int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
839 BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700840
Adam Langley5d17dd62014-06-30 14:22:32 -0700841/* BN_mod_exp sets |r| equal to |a|^{|p|} mod |m|. It does so with the best
Adam Langley95c29f32014-06-20 12:00:00 -0700842 * algorithm for the values provided and can run in constant time if
843 * |BN_FLG_CONSTTIME| is set for |p|. It returns one on success or zero
844 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700845OPENSSL_EXPORT int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
846 const BIGNUM *m, BN_CTX *ctx);
Adam Langley95c29f32014-06-20 12:00:00 -0700847
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700848OPENSSL_EXPORT int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
849 const BIGNUM *m, BN_CTX *ctx,
David Benjamine82e6f62015-11-03 10:40:23 -0500850 const BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700851
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700852OPENSSL_EXPORT int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a,
853 const BIGNUM *p, const BIGNUM *m,
Adam Langleyefb42fb2015-11-02 17:39:02 -0800854 BN_CTX *ctx,
855 const BN_MONT_CTX *mont);
Adam Langley95c29f32014-06-20 12:00:00 -0700856
Adam Langley95c29f32014-06-20 12:00:00 -0700857
Matt Braithwaite64887252015-08-11 17:17:28 -0700858/* Deprecated functions */
859
860/* BN_bn2mpi serialises the value of |in| to |out|, using a format that consists
861 * of the number's length in bytes represented as a 4-byte big-endian number,
862 * and the number itself in big-endian format, where the most significant bit
863 * signals a negative number. (The representation of numbers with the MSB set is
864 * prefixed with null byte). |out| must have sufficient space available; to
865 * find the needed amount of space, call the function with |out| set to NULL. */
866OPENSSL_EXPORT size_t BN_bn2mpi(const BIGNUM *in, uint8_t *out);
867
Adam Langley5f889992015-11-04 14:05:00 -0800868/* BN_mpi2bn parses |len| bytes from |in| and returns the resulting value. The
Matt Braithwaite64887252015-08-11 17:17:28 -0700869 * bytes at |in| are expected to be in the format emitted by |BN_bn2mpi|.
870 *
871 * If |out| is NULL then a fresh |BIGNUM| is allocated and returned, otherwise
872 * |out| is reused and returned. On error, NULL is returned and the error queue
873 * is updated. */
874OPENSSL_EXPORT BIGNUM *BN_mpi2bn(const uint8_t *in, size_t len, BIGNUM *out);
875
Brian Smithe31d1032016-04-21 17:08:13 -1000876/* BN_mod_exp_mont_word is like |BN_mod_exp_mont| except that the base |a| is
877 * given as a |BN_ULONG| instead of a |BIGNUM *|. It returns one on success
878 * or zero otherwise. */
879OPENSSL_EXPORT int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
880 const BIGNUM *m, BN_CTX *ctx,
881 const BN_MONT_CTX *mont);
882
Brian Smith448fa422016-04-21 17:08:29 -1000883/* BN_mod_exp2_mont calculates (a1^p1) * (a2^p2) mod m. It returns 1 on success
884 * or zero otherwise. */
885OPENSSL_EXPORT int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1,
886 const BIGNUM *p1, const BIGNUM *a2,
887 const BIGNUM *p2, const BIGNUM *m,
888 BN_CTX *ctx, const BN_MONT_CTX *mont);
889
Matt Braithwaite64887252015-08-11 17:17:28 -0700890
Adam Langley95c29f32014-06-20 12:00:00 -0700891/* Private functions */
892
893struct bignum_st {
894 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks in little-endian
895 order. */
896 int top; /* Index of last used element in |d|, plus one. */
897 int dmax; /* Size of |d|, in words. */
898 int neg; /* one if the number is negative */
899 int flags; /* bitmask of BN_FLG_* values */
900};
901
902struct bn_mont_ctx_st {
903 BIGNUM RR; /* used to convert to montgomery form */
904 BIGNUM N; /* The modulus */
Brian Smith8bde5d22015-11-11 18:36:23 -1000905 BN_ULONG n0[2]; /* least significant words of (R*Ri-1)/N */
Adam Langley95c29f32014-06-20 12:00:00 -0700906};
907
Adam Langley214cd442014-08-18 11:35:45 -0700908OPENSSL_EXPORT unsigned BN_num_bits_word(BN_ULONG l);
Adam Langley95c29f32014-06-20 12:00:00 -0700909
910#define BN_FLG_MALLOCED 0x01
911#define BN_FLG_STATIC_DATA 0x02
912/* avoid leaking exponent information through timing, BN_mod_exp_mont() will
913 * call BN_mod_exp_mont_consttime, BN_div() will call BN_div_no_branch,
914 * BN_mod_inverse() will call BN_mod_inverse_no_branch. */
915#define BN_FLG_CONSTTIME 0x04
916
917
918#if defined(__cplusplus)
919} /* extern C */
Matt Braithwaited17d74d2016-08-17 20:10:28 -0700920
921extern "C++" {
922
923namespace bssl {
924
Matt Braithwaited17d74d2016-08-17 20:10:28 -0700925BORINGSSL_MAKE_DELETER(BIGNUM, BN_free)
926BORINGSSL_MAKE_DELETER(BN_CTX, BN_CTX_free)
927BORINGSSL_MAKE_DELETER(BN_MONT_CTX, BN_MONT_CTX_free)
928
Matt Braithwaited17d74d2016-08-17 20:10:28 -0700929} // namespace bssl
930
931} /* extern C++ */
932
Adam Langley95c29f32014-06-20 12:00:00 -0700933#endif
934
David Benjamin689be0f2015-02-11 15:55:26 -0500935#define BN_R_ARG2_LT_ARG3 100
936#define BN_R_BAD_RECIPROCAL 101
937#define BN_R_BIGNUM_TOO_LONG 102
938#define BN_R_BITS_TOO_SMALL 103
939#define BN_R_CALLED_WITH_EVEN_MODULUS 104
940#define BN_R_DIV_BY_ZERO 105
941#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 106
942#define BN_R_INPUT_NOT_REDUCED 107
943#define BN_R_INVALID_RANGE 108
944#define BN_R_NEGATIVE_NUMBER 109
945#define BN_R_NOT_A_SQUARE 110
946#define BN_R_NOT_INITIALIZED 111
947#define BN_R_NO_INVERSE 112
948#define BN_R_PRIVATE_KEY_TOO_LARGE 113
949#define BN_R_P_IS_NOT_PRIME 114
950#define BN_R_TOO_MANY_ITERATIONS 115
951#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 116
David Benjaminb9c579d2015-06-11 22:52:07 -0400952#define BN_R_BAD_ENCODING 117
953#define BN_R_ENCODE_ERROR 118
Adam Langley95c29f32014-06-20 12:00:00 -0700954
955#endif /* OPENSSL_HEADER_BN_H */