Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 1 | /* 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> |
| 127 | |
| 128 | #include <stdio.h> /* for FILE* */ |
| 129 | |
| 130 | #if defined(__cplusplus) |
| 131 | extern "C" { |
| 132 | #endif |
| 133 | |
| 134 | |
| 135 | /* BN provides support for working with arbitary sized integers. For example, |
| 136 | * although the largest integer supported by the compiler might be 64 bits, BN |
| 137 | * will allow you to work with numbers until you run out of memory. */ |
| 138 | |
| 139 | |
| 140 | /* BN_ULONG is the native word size when working with big integers. */ |
| 141 | #if defined(OPENSSL_64_BIT) |
| 142 | #define BN_ULONG uint64_t |
| 143 | #define BN_BITS2 64 |
| 144 | #elif defined(OPENSSL_32_BIT) |
| 145 | #define BN_ULONG uint32_t |
| 146 | #define BN_BITS2 32 |
| 147 | #else |
| 148 | #error "Must define either OPENSSL_32_BIT or OPENSSL_64_BIT" |
| 149 | #endif |
| 150 | |
| 151 | |
| 152 | /* Allocation and freeing. */ |
| 153 | |
| 154 | /* BN_new creates a new, allocated BIGNUM and initialises it. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 155 | OPENSSL_EXPORT BIGNUM *BN_new(void); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 156 | |
| 157 | /* BN_init initialises a stack allocated |BIGNUM|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 158 | OPENSSL_EXPORT void BN_init(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 159 | |
| 160 | /* BN_free frees the data referenced by |bn| and, if |bn| was originally |
| 161 | * allocated on the heap, frees |bn| also. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 162 | OPENSSL_EXPORT void BN_free(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 163 | |
| 164 | /* BN_clear_free erases and frees the data referenced by |bn| and, if |bn| was |
| 165 | * originally allocated on the heap, frees |bn| also. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 166 | OPENSSL_EXPORT void BN_clear_free(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 167 | |
| 168 | /* BN_dup allocates a new BIGNUM and sets it equal to |src|. It returns the |
| 169 | * allocated BIGNUM on success or NULL otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 170 | OPENSSL_EXPORT BIGNUM *BN_dup(const BIGNUM *src); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 171 | |
| 172 | /* BN_copy sets |dest| equal to |src| and returns |dest|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 173 | OPENSSL_EXPORT BIGNUM *BN_copy(BIGNUM *dest, const BIGNUM *src); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 174 | |
| 175 | /* BN_clear sets |bn| to zero and erases the old data. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 176 | OPENSSL_EXPORT void BN_clear(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 177 | |
| 178 | /* BN_value_one returns a static BIGNUM with value 1. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 179 | OPENSSL_EXPORT const BIGNUM *BN_value_one(void); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 180 | |
| 181 | /* BN_with_flags initialises a stack allocated |BIGNUM| with pointers to the |
| 182 | * contents of |in| but with |flags| ORed into the flags field. |
| 183 | * |
| 184 | * Note: the two BIGNUMs share state and so |out| should /not/ be passed to |
| 185 | * |BN_free|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 186 | OPENSSL_EXPORT void BN_with_flags(BIGNUM *out, const BIGNUM *in, int flags); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 187 | |
| 188 | |
| 189 | /* Basic functions. */ |
| 190 | |
| 191 | /* BN_num_bits returns the minimum number of bits needed to represent the |
| 192 | * absolute value of |bn|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 193 | OPENSSL_EXPORT unsigned BN_num_bits(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 194 | |
| 195 | /* BN_num_bytes returns the minimum number of bytes needed to represent the |
| 196 | * absolute value of |bn|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 197 | OPENSSL_EXPORT unsigned BN_num_bytes(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 198 | |
| 199 | /* BN_zero sets |bn| to zero. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 200 | OPENSSL_EXPORT void BN_zero(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 201 | |
| 202 | /* BN_one sets |bn| to one. It returns one on success or zero on allocation |
| 203 | * failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 204 | OPENSSL_EXPORT int BN_one(BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 205 | |
| 206 | /* BN_set_word sets |bn| to |value|. It returns one on success or zero on |
| 207 | * allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 208 | OPENSSL_EXPORT int BN_set_word(BIGNUM *bn, BN_ULONG value); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 209 | |
| 210 | /* BN_set_negative sets the sign of |bn|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 211 | OPENSSL_EXPORT void BN_set_negative(BIGNUM *bn, int sign); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 212 | |
| 213 | /* BN_is_negative returns one if |bn| is negative and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 214 | OPENSSL_EXPORT int BN_is_negative(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 215 | |
| 216 | /* BN_get_flags returns |bn->flags| & |flags|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 217 | OPENSSL_EXPORT int BN_get_flags(const BIGNUM *bn, int flags); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 218 | |
| 219 | /* BN_set_flags sets |flags| on |bn|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 220 | OPENSSL_EXPORT void BN_set_flags(BIGNUM *bn, int flags); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 221 | |
| 222 | |
| 223 | /* Conversion functions. */ |
| 224 | |
| 225 | /* BN_bin2bn sets |*ret| to the value of |len| bytes from |in|, interpreted as |
| 226 | * a big-endian number, and returns |ret|. If |ret| is NULL then a fresh |
| 227 | * |BIGNUM| is allocated and returned. It returns NULL on allocation |
| 228 | * failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 229 | OPENSSL_EXPORT BIGNUM *BN_bin2bn(const uint8_t *in, size_t len, BIGNUM *ret); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 230 | |
| 231 | /* BN_bn2bin serialises the absolute value of |in| to |out| as a big-endian |
| 232 | * integer, which must have |BN_num_bytes| of space available. It returns the |
| 233 | * number of bytes written. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 234 | OPENSSL_EXPORT size_t BN_bn2bin(const BIGNUM *in, uint8_t *out); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 235 | |
Adam Langley | 6887edb | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 236 | /* BN_bn2bin_padded serialises the absolute value of |in| to |out| as a |
| 237 | * big-endian integer. The integer is padded with leading zeros up to size |
| 238 | * |len|. If |len| is smaller than |BN_num_bytes|, the function fails and |
| 239 | * returns 0. Otherwise, it returns 1. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 240 | OPENSSL_EXPORT int BN_bn2bin_padded(uint8_t *out, size_t len, const BIGNUM *in); |
Adam Langley | 6887edb | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 241 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 242 | /* BN_bn2hex returns an allocated string that contains a NUL-terminated, hex |
| 243 | * representation of |bn|. If |bn| is negative, the first char in the resulting |
| 244 | * string will be '-'. Returns NULL on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 245 | OPENSSL_EXPORT char *BN_bn2hex(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 246 | |
| 247 | /* BN_hex2bn parses the leading hex number from |in|, which may be proceeded by |
| 248 | * a '-' to indicate a negative number and may contain trailing, non-hex data. |
| 249 | * If |outp| is not NULL, it constructs a BIGNUM equal to the hex number and |
| 250 | * stores it in |*outp|. If |*outp| is NULL then it allocates a new BIGNUM and |
| 251 | * updates |*outp|. It returns the number of bytes of |in| processed or zero on |
| 252 | * error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 253 | OPENSSL_EXPORT int BN_hex2bn(BIGNUM **outp, const char *in); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 254 | |
| 255 | /* BN_bn2dec returns an allocated string that contains a NUL-terminated, |
| 256 | * decimal representation of |bn|. If |bn| is negative, the first char in the |
| 257 | * resulting string will be '-'. Returns NULL on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 258 | OPENSSL_EXPORT char *BN_bn2dec(const BIGNUM *a); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 259 | |
| 260 | /* BN_dec2bn parses the leading decimal number from |in|, which may be |
| 261 | * proceeded by a '-' to indicate a negative number and may contain trailing, |
| 262 | * non-decimal data. If |outp| is not NULL, it constructs a BIGNUM equal to the |
| 263 | * decimal number and stores it in |*outp|. If |*outp| is NULL then it |
| 264 | * allocates a new BIGNUM and updates |*outp|. It returns the number of bytes |
| 265 | * of |in| processed or zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 266 | OPENSSL_EXPORT int BN_dec2bn(BIGNUM **outp, const char *in); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 267 | |
| 268 | /* BN_asc2bn acts like |BN_dec2bn| or |BN_hex2bn| depending on whether |in| |
| 269 | * begins with "0X" or "0x" (indicating hex) or not (indicating decimal). A |
| 270 | * leading '-' is still permitted and comes before the optional 0X/0x. It |
| 271 | * returns one on success or zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 272 | OPENSSL_EXPORT int BN_asc2bn(BIGNUM **outp, const char *in); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 273 | |
| 274 | /* BN_print writes a hex encoding of |a| to |bio|. It returns one on success |
| 275 | * and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 276 | OPENSSL_EXPORT int BN_print(BIO *bio, const BIGNUM *a); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 277 | |
| 278 | /* BN_print_fp acts like |BIO_print|, but wraps |fp| in a |BIO| first. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 279 | OPENSSL_EXPORT int BN_print_fp(FILE *fp, const BIGNUM *a); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 280 | |
| 281 | /* BN_get_word returns the absolute value of |bn| as a single word. If |bn| is |
| 282 | * too large to be represented as a single word, the maximum possible value |
| 283 | * will be returned. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 284 | OPENSSL_EXPORT BN_ULONG BN_get_word(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 285 | |
| 286 | |
| 287 | /* BIGNUM pools. |
| 288 | * |
| 289 | * Certain BIGNUM operations need to use many temporary variables and |
| 290 | * allocating and freeing them can be quite slow. Thus such opertions typically |
| 291 | * take a |BN_CTX| parameter, which contains a pool of |BIGNUMs|. The |ctx| |
| 292 | * argument to a public function may be NULL, in which case a local |BN_CTX| |
| 293 | * will be created just for the lifetime of that call. |
| 294 | * |
| 295 | * A function must call |BN_CTX_start| first. Then, |BN_CTX_get| may be called |
| 296 | * repeatedly to obtain temporary |BIGNUM|s. All |BN_CTX_get| calls must be made |
| 297 | * before calling any other functions that use the |ctx| as an argument. |
| 298 | * |
| 299 | * Finally, |BN_CTX_end| must be called before returning from the function. |
| 300 | * When |BN_CTX_end| is called, the |BIGNUM| pointers obtained from |
| 301 | * |BN_CTX_get| become invalid. */ |
| 302 | |
| 303 | /* BN_CTX_new returns a new, empty BN_CTX or NULL on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 304 | OPENSSL_EXPORT BN_CTX *BN_CTX_new(void); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 305 | |
| 306 | /* BN_CTX_free frees all BIGNUMs contained in |ctx| and then frees |ctx| |
| 307 | * itself. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 308 | OPENSSL_EXPORT void BN_CTX_free(BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 309 | |
| 310 | /* BN_CTX_start "pushes" a new entry onto the |ctx| stack and allows future |
| 311 | * calls to |BN_CTX_get|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 312 | OPENSSL_EXPORT void BN_CTX_start(BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 313 | |
| 314 | /* BN_CTX_get returns a new |BIGNUM|, or NULL on allocation failure. Once |
| 315 | * |BN_CTX_get| has returned NULL, all future calls will also return NULL until |
| 316 | * |BN_CTX_end| is called. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 317 | OPENSSL_EXPORT BIGNUM *BN_CTX_get(BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 318 | |
| 319 | /* BN_CTX_end invalidates all |BIGNUM|s returned from |BN_CTX_get| since the |
| 320 | * matching |BN_CTX_start| call. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 321 | OPENSSL_EXPORT void BN_CTX_end(BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 322 | |
| 323 | |
| 324 | /* Simple arithmetic */ |
| 325 | |
| 326 | /* BN_add sets |r| = |a| + |b|, where |r| may be the same pointer as either |a| |
| 327 | * or |b|. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 328 | OPENSSL_EXPORT int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 329 | |
| 330 | /* BN_uadd sets |r| = |a| + |b|, where |a| and |b| are non-negative and |r| may |
| 331 | * be the same pointer as either |a| or |b|. It returns one on success and zero |
| 332 | * on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 333 | OPENSSL_EXPORT int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 334 | |
| 335 | /* BN_add_word adds |w| to |a|. It returns one on success and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 336 | OPENSSL_EXPORT int BN_add_word(BIGNUM *a, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 337 | |
| 338 | /* BN_sub sets |r| = |a| + |b|, where |r| must be a distinct pointer from |a| |
| 339 | * and |b|. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 340 | OPENSSL_EXPORT int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 341 | |
| 342 | /* BN_usub sets |r| = |a| + |b|, where |a| and |b| are non-negative integers, |
| 343 | * |b| < |a| and |r| must be a distinct pointer from |a| and |b|. It returns |
| 344 | * one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 345 | OPENSSL_EXPORT int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 346 | |
| 347 | /* BN_sub_word subtracts |w| from |a|. It returns one on success and zero on |
| 348 | * allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 349 | OPENSSL_EXPORT int BN_sub_word(BIGNUM *a, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 350 | |
| 351 | /* BN_mul sets |r| = |a| * |b|, where |r| may be the same pointer as |a| or |
| 352 | * |b|. Returns one on success and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 353 | OPENSSL_EXPORT int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 354 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 355 | |
| 356 | /* BN_mul_word sets |bn| = |bn| * |w|. It returns one on success or zero on |
| 357 | * allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 358 | OPENSSL_EXPORT int BN_mul_word(BIGNUM *bn, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 359 | |
| 360 | /* BN_sqr sets |r| = |a|^2 (i.e. squares), where |r| may be the same pointer as |
| 361 | * |a|. Returns one on success and zero otherwise. This is more efficient than |
| 362 | * BN_mul(r, a, a, ctx). */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 363 | OPENSSL_EXPORT int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 364 | |
| 365 | /* BN_div divides |numerator| by |divisor| and places the result in |quotient| |
| 366 | * and the remainder in |rem|. Either of |quotient| or |rem| may be NULL, in |
| 367 | * which case the respective value is not returned. The result is rounded |
| 368 | * towards zero; thus if |numerator| is negative, the remainder will be zero or |
| 369 | * negative. It returns one on success or zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 370 | OPENSSL_EXPORT int BN_div(BIGNUM *quotient, BIGNUM *rem, |
| 371 | const BIGNUM *numerator, const BIGNUM *divisor, |
| 372 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 373 | |
| 374 | /* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the |
| 375 | * remainder or (BN_ULONG)-1 on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 376 | OPENSSL_EXPORT BN_ULONG BN_div_word(BIGNUM *numerator, BN_ULONG divisor); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 377 | |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 378 | /* BN_sqrt sets |*out_sqrt| (which may be the same |BIGNUM| as |in|) to the |
| 379 | * square root of |in|, using |ctx|. It returns one on success or zero on |
| 380 | * error. Negative numbers and non-square numbers will result in an error with |
| 381 | * appropriate errors on the error queue. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 382 | OPENSSL_EXPORT int BN_sqrt(BIGNUM *out_sqrt, const BIGNUM *in, BN_CTX *ctx); |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 383 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 384 | |
| 385 | /* Comparison functions */ |
| 386 | |
| 387 | /* BN_cmp returns a value less than, equal to or greater than zero if |a| is |
| 388 | * less than, equal to or greater than |b|, respectively. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 389 | OPENSSL_EXPORT int BN_cmp(const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 390 | |
| 391 | /* BN_ucmp returns a value less than, equal to or greater than zero if the |
| 392 | * absolute value of |a| is less than, equal to or greater than the absolute |
| 393 | * value of |b|, respectively. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 394 | OPENSSL_EXPORT int BN_ucmp(const BIGNUM *a, const BIGNUM *b); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 395 | |
| 396 | /* BN_abs_is_word returns one if the absolute value of |bn| equals |w| and zero |
| 397 | * otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 398 | OPENSSL_EXPORT int BN_abs_is_word(const BIGNUM *bn, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 399 | |
| 400 | /* BN_is_zero returns one if |bn| is zero and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 401 | OPENSSL_EXPORT int BN_is_zero(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 402 | |
| 403 | /* BN_is_one returns one if |bn| equals one and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 404 | OPENSSL_EXPORT int BN_is_one(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 405 | |
| 406 | /* BN_is_word returns one if |bn| is exactly |w| and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 407 | OPENSSL_EXPORT int BN_is_word(const BIGNUM *bn, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 408 | |
| 409 | /* BN_is_odd returns one if |bn| is odd and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 410 | OPENSSL_EXPORT int BN_is_odd(const BIGNUM *bn); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 411 | |
| 412 | |
| 413 | /* Bitwise operations. */ |
| 414 | |
| 415 | /* BN_lshift sets |r| equal to |a| << n. The |a| and |r| arguments may be the |
| 416 | * same |BIGNUM|. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 417 | OPENSSL_EXPORT int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 418 | |
| 419 | /* BN_lshift1 sets |r| equal to |a| << 1, where |r| and |a| may be the same |
| 420 | * pointer. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 421 | OPENSSL_EXPORT int BN_lshift1(BIGNUM *r, const BIGNUM *a); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 422 | |
| 423 | /* BN_rshift sets |r| equal to |a| >> n, where |r| and |a| may be the same |
| 424 | * pointer. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 425 | OPENSSL_EXPORT int BN_rshift(BIGNUM *r, const BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 426 | |
| 427 | /* BN_rshift1 sets |r| equal to |a| >> 1, where |r| and |a| may be the same |
| 428 | * pointer. It returns one on success and zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 429 | OPENSSL_EXPORT int BN_rshift1(BIGNUM *r, const BIGNUM *a); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 430 | |
| 431 | /* BN_set_bit sets the |n|th, least-significant bit in |a|. For example, if |a| |
| 432 | * is 2 then setting bit zero will make it 3. It returns one on success or zero |
| 433 | * on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 434 | OPENSSL_EXPORT int BN_set_bit(BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 435 | |
| 436 | /* BN_clear_bit clears the |n|th, least-significant bit in |a|. For example, if |
| 437 | * |a| is 3, clearing bit zero will make it two. It returns one on success or |
| 438 | * zero on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 439 | OPENSSL_EXPORT int BN_clear_bit(BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 440 | |
| 441 | /* BN_is_bit_set returns the value of the |n|th, least-significant bit in |a|, |
| 442 | * or zero if the bit doesn't exist. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 443 | OPENSSL_EXPORT int BN_is_bit_set(const BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 444 | |
| 445 | /* BN_mask_bits truncates |a| so that it is only |n| bits long. It returns one |
| 446 | * on success or zero if |n| is greater than the length of |a| already. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 447 | OPENSSL_EXPORT int BN_mask_bits(BIGNUM *a, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 448 | |
| 449 | |
| 450 | /* Modulo arithmetic. */ |
| 451 | |
| 452 | /* BN_mod_word returns |a| mod |w|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 453 | OPENSSL_EXPORT BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 454 | |
| 455 | /* BN_mod is a helper macro that calls |BN_div| and discards the quotient. */ |
| 456 | #define BN_mod(rem, numerator, divisor, ctx) \ |
| 457 | BN_div(NULL, (rem), (numerator), (divisor), (ctx)) |
| 458 | |
| 459 | /* BN_nnmod is a non-negative modulo function. It acts like |BN_mod|, but 0 <= |
| 460 | * |rem| < |divisor| is always true. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 461 | OPENSSL_EXPORT int BN_nnmod(BIGNUM *rem, const BIGNUM *numerator, |
| 462 | const BIGNUM *divisor, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 463 | |
| 464 | /* BN_mod_add sets |r| = |a| + |b| mod |m|. It returns one on success and zero |
| 465 | * on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 466 | OPENSSL_EXPORT int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 467 | const BIGNUM *m, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 468 | |
| 469 | /* BN_mod_add_quick acts like |BN_mod_add| but requires that |a| and |b| be |
| 470 | * non-negative and less than |m|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 471 | OPENSSL_EXPORT int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 472 | const BIGNUM *m); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 473 | |
| 474 | /* BN_mod_sub sets |r| = |a| - |b| mod |m|. It returns one on success and zero |
| 475 | * on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 476 | OPENSSL_EXPORT int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 477 | const BIGNUM *m, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 478 | |
| 479 | /* BN_mod_sub_quick acts like |BN_mod_sub| but requires that |a| and |b| be |
| 480 | * non-negative and less than |m|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 481 | OPENSSL_EXPORT int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 482 | const BIGNUM *m); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 483 | |
| 484 | /* BN_mod_mul sets |r| = |a|*|b| mod |m|. It returns one on success and zero |
| 485 | * on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 486 | OPENSSL_EXPORT int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 487 | const BIGNUM *m, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 488 | |
| 489 | /* BN_mod_mul sets |r| = |a|^2 mod |m|. It returns one on success and zero |
| 490 | * on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 491 | OPENSSL_EXPORT int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, |
| 492 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 493 | |
| 494 | /* BN_mod_lshift sets |r| = (|a| << n) mod |m|, where |r| and |a| may be the |
| 495 | * same pointer. It returns one on success and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 496 | OPENSSL_EXPORT int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, |
| 497 | const BIGNUM *m, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 498 | |
| 499 | /* BN_mod_lshift_quick acts like |BN_mod_lshift| but requires that |a| be |
| 500 | * non-negative and less than |m|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 501 | OPENSSL_EXPORT int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, |
| 502 | const BIGNUM *m); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 503 | |
| 504 | /* BN_mod_lshift1 sets |r| = (|a| << 1) mod |m|, where |r| and |a| may be the |
| 505 | * same pointer. It returns one on success and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 506 | OPENSSL_EXPORT int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, |
| 507 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 508 | |
| 509 | /* BN_mod_lshift1_quick acts like |BN_mod_lshift1| but requires that |a| be |
| 510 | * non-negative and less than |m|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 511 | OPENSSL_EXPORT int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, |
| 512 | const BIGNUM *m); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 513 | |
| 514 | /* BN_mod_sqrt returns a |BIGNUM|, r, such that r^2 == a (mod p). */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 515 | OPENSSL_EXPORT BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, |
| 516 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 517 | |
| 518 | |
| 519 | /* Random and prime number generation. */ |
| 520 | |
| 521 | /* BN_rand sets |rnd| to a random number of length |bits|. If |top| is zero, |
| 522 | * the most-significant bit will be set. If |top| is one, the two most |
| 523 | * significant bits will be set. |
| 524 | * |
| 525 | * If |top| is -1 then no extra action will be taken and |BN_num_bits(rnd)| may |
| 526 | * not equal |bits| if the most significant bits randomly ended up as zeros. |
| 527 | * |
| 528 | * If |bottom| is non-zero, the least-significant bit will be set. The function |
| 529 | * returns one on success or zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 530 | OPENSSL_EXPORT int BN_rand(BIGNUM *rnd, int bits, int top, int bottom); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 531 | |
| 532 | /* BN_pseudo_rand is an alias for |BN_rand|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 533 | OPENSSL_EXPORT int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 534 | |
| 535 | /* BN_rand_range sets |rnd| to a random value [0..range). It returns one on |
| 536 | * success and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 537 | OPENSSL_EXPORT int BN_rand_range(BIGNUM *rnd, const BIGNUM *range); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 538 | |
| 539 | /* BN_pseudo_rand_range is an alias for BN_rand_range. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 540 | OPENSSL_EXPORT int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 541 | |
Adam Langley | d4b4f08 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 542 | /* BN_generate_dsa_nonce generates a random number 0 <= out < range. Unlike |
| 543 | * BN_rand_range, it also includes the contents of |priv| and |message| in the |
| 544 | * generation so that an RNG failure isn't fatal as long as |priv| remains |
| 545 | * secret. This is intended for use in DSA and ECDSA where an RNG weakness |
| 546 | * leads directly to private key exposure unless this function is used. |
| 547 | * It returns one on success and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 548 | OPENSSL_EXPORT int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range, |
| 549 | const BIGNUM *priv, |
| 550 | const uint8_t *message, |
| 551 | size_t message_len, BN_CTX *ctx); |
Adam Langley | d4b4f08 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 552 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 553 | /* BN_GENCB holds a callback function that is used by generation functions that |
| 554 | * can take a very long time to complete. Use |BN_GENCB_set| to initialise a |
| 555 | * |BN_GENCB| structure. |
| 556 | * |
| 557 | * The callback receives the address of that |BN_GENCB| structure as its last |
| 558 | * argument and the user is free to put an arbitary pointer in |arg|. The other |
| 559 | * arguments are set as follows: |
| 560 | * event=BN_GENCB_GENERATED, n=i: after generating the i'th possible prime |
| 561 | * number. |
| 562 | * event=BN_GENCB_PRIME_TEST, n=-1: when finished trial division primality |
| 563 | * checks. |
| 564 | * event=BN_GENCB_PRIME_TEST, n=i: when the i'th primality test has finished. |
| 565 | * |
| 566 | * The callback can return zero to abort the generation progress or one to |
| 567 | * allow it to continue. |
| 568 | * |
| 569 | * When other code needs to call a BN generation function it will often take a |
| 570 | * BN_GENCB argument and may call the function with other argument values. */ |
| 571 | #define BN_GENCB_GENERATED 0 |
| 572 | #define BN_GENCB_PRIME_TEST 1 |
| 573 | |
| 574 | struct bn_gencb_st { |
| 575 | void *arg; /* callback-specific data */ |
| 576 | int (*callback)(int event, int n, struct bn_gencb_st *); |
| 577 | }; |
| 578 | |
| 579 | /* BN_GENCB_set configures |callback| to call |f| and sets |callout->arg| to |
| 580 | * |arg|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 581 | OPENSSL_EXPORT void BN_GENCB_set(BN_GENCB *callback, |
| 582 | int (*f)(int event, int n, |
| 583 | struct bn_gencb_st *), |
| 584 | void *arg); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 585 | |
| 586 | /* BN_GENCB_call calls |callback|, if not NULL, and returns the return value of |
| 587 | * the callback, or 1 if |callback| is NULL. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 588 | OPENSSL_EXPORT int BN_GENCB_call(BN_GENCB *callback, int event, int n); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 589 | |
| 590 | /* BN_generate_prime_ex sets |ret| to a prime number of |bits| length. If safe |
| 591 | * is non-zero then the prime will be such that (ret-1)/2 is also a prime. |
| 592 | * (This is needed for Diffie-Hellman groups to ensure that the only subgroups |
| 593 | * are of size 2 and (p-1)/2.). |
| 594 | * |
| 595 | * If |add| is not NULL, the prime will fulfill the condition |ret| % |add| == |
| 596 | * |rem| in order to suit a given generator. (If |rem| is NULL then |ret| % |
| 597 | * |add| == 1.) |
| 598 | * |
| 599 | * If |cb| is not NULL, it will be called during processing to give an |
| 600 | * indication of progress. See the comments for |BN_GENCB|. It returns one on |
| 601 | * success and zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 602 | OPENSSL_EXPORT int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, |
| 603 | const BIGNUM *add, const BIGNUM *rem, |
| 604 | BN_GENCB *cb); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 605 | |
| 606 | /* BN_prime_checks is magic value that can be used as the |checks| argument to |
| 607 | * the primality testing functions in order to automatically select a number of |
| 608 | * Miller-Rabin checks that gives a false positive rate of ~2^{-80}. */ |
| 609 | #define BN_prime_checks 0 |
| 610 | |
| 611 | /* BN_primality_test sets |*is_probably_prime| to one if |candidate| is |
| 612 | * probably a prime number by the Miller-Rabin test or zero if it's certainly |
| 613 | * not. |
| 614 | * |
| 615 | * If |do_trial_division| is non-zero then |candidate| will be tested against a |
| 616 | * list of small primes before Miller-Rabin tests. The probability of this |
| 617 | * function returning a false positive is 2^{2*checks}. If |checks| is |
| 618 | * |BN_prime_checks| then a value that results in approximately 2^{-80} false |
| 619 | * positive probability is used. If |cb| is not NULL then it is called during |
| 620 | * the checking process. See the comment above |BN_GENCB|. |
| 621 | * |
| 622 | * The function returns one on success and zero on error. |
| 623 | * |
| 624 | * (If you are unsure whether you want |do_trial_division|, don't set it.) */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 625 | OPENSSL_EXPORT int BN_primality_test(int *is_probably_prime, |
| 626 | const BIGNUM *candidate, int checks, |
| 627 | BN_CTX *ctx, int do_trial_division, |
| 628 | BN_GENCB *cb); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 629 | |
| 630 | /* BN_is_prime_fasttest_ex returns one if |candidate| is probably a prime |
| 631 | * number by the Miller-Rabin test, zero if it's certainly not and -1 on error. |
| 632 | * |
| 633 | * If |do_trial_division| is non-zero then |candidate| will be tested against a |
| 634 | * list of small primes before Miller-Rabin tests. The probability of this |
| 635 | * function returning one when |candidate| is composite is 2^{2*checks}. If |
| 636 | * |checks| is |BN_prime_checks| then a value that results in approximately |
| 637 | * 2^{-80} false positive probability is used. If |cb| is not NULL then it is |
| 638 | * called during the checking process. See the comment above |BN_GENCB|. |
| 639 | * |
| 640 | * WARNING: deprecated. Use |BN_primality_test|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 641 | OPENSSL_EXPORT int BN_is_prime_fasttest_ex(const BIGNUM *candidate, int checks, |
| 642 | BN_CTX *ctx, int do_trial_division, |
| 643 | BN_GENCB *cb); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 644 | |
| 645 | /* BN_is_prime_ex acts the same as |BN_is_prime_fasttest_ex| with |
| 646 | * |do_trial_division| set to zero. |
| 647 | * |
| 648 | * WARNING: deprecated: Use |BN_primality_test|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 649 | OPENSSL_EXPORT int BN_is_prime_ex(const BIGNUM *candidate, int checks, |
| 650 | BN_CTX *ctx, BN_GENCB *cb); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 651 | |
| 652 | |
| 653 | /* Number theory functions */ |
| 654 | |
| 655 | /* BN_gcd sets |r| = gcd(|a|, |b|). It returns one on success and zero |
| 656 | * otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 657 | OPENSSL_EXPORT int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, |
| 658 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 659 | |
| 660 | /* BN_mod_inverse sets |out| equal to |a|^-1, mod |n|. If either of |a| or |n| |
| 661 | * have |BN_FLG_CONSTTIME| set then the operation is performed in constant |
| 662 | * time. If |out| is NULL, a fresh BIGNUM is allocated. It returns the result |
| 663 | * or NULL on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 664 | OPENSSL_EXPORT BIGNUM *BN_mod_inverse(BIGNUM *out, const BIGNUM *a, |
| 665 | const BIGNUM *n, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 666 | |
| 667 | /* BN_kronecker returns the Kronecker symbol of |a| and |b| (which is -1, 0 or |
| 668 | * 1), or -2 on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 669 | OPENSSL_EXPORT int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 670 | |
| 671 | |
| 672 | /* Montgomery arithmetic. */ |
| 673 | |
| 674 | /* BN_MONT_CTX contains the precomputed values needed to work in a specific |
| 675 | * Montgomery domain. */ |
| 676 | |
| 677 | /* BN_MONT_CTX_new returns a fresh BN_MONT_CTX or NULL on allocation failure. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 678 | OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_new(void); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 679 | |
| 680 | /* BN_MONT_CTX_init initialises a stack allocated |BN_MONT_CTX|. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 681 | OPENSSL_EXPORT void BN_MONT_CTX_init(BN_MONT_CTX *mont); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 682 | |
| 683 | /* BN_MONT_CTX_free frees the contexts of |mont| and, if it was originally |
| 684 | * allocated with |BN_MONT_CTX_new|, |mont| itself. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 685 | OPENSSL_EXPORT void BN_MONT_CTX_free(BN_MONT_CTX *mont); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 686 | |
| 687 | /* BN_MONT_CTX_copy sets |to| equal to |from|. It returns |to| on success or |
| 688 | * NULL on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 689 | OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, |
| 690 | BN_MONT_CTX *from); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 691 | |
| 692 | /* BN_MONT_CTX_set sets up a Montgomery context given the modulus, |mod|. It |
| 693 | * returns one on success and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 694 | OPENSSL_EXPORT int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, |
| 695 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 696 | |
| 697 | /* BN_MONT_CTX_set_locked takes the lock indicated by |lock| and checks whether |
| 698 | * |*pmont| is NULL. If so, it creates a new |BN_MONT_CTX| and sets the modulus |
| 699 | * for it to |mod|. It then stores it as |*pmont| and returns it, or NULL on |
| 700 | * error. |
| 701 | * |
| 702 | * If |*pmont| is already non-NULL then the existing value is returned. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 703 | OPENSSL_EXPORT BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, |
| 704 | int lock, const BIGNUM *mod, |
| 705 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 706 | |
| 707 | /* BN_to_montgomery sets |ret| equal to |a| in the Montgomery domain. It |
| 708 | * returns one on success and zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 709 | OPENSSL_EXPORT int BN_to_montgomery(BIGNUM *ret, const BIGNUM *a, |
| 710 | const BN_MONT_CTX *mont, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 711 | |
| 712 | /* BN_from_montgomery sets |ret| equal to |a| * R^-1, i.e. translates values |
| 713 | * out of the Montgomery domain. It returns one on success or zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 714 | OPENSSL_EXPORT int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, |
| 715 | const BN_MONT_CTX *mont, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 716 | |
| 717 | /* BN_mod_mul_montgomery set |r| equal to |a| * |b|, in the Montgomery domain. |
| 718 | * Both |a| and |b| must already be in the Montgomery domain (by |
| 719 | * |BN_to_montgomery|). It returns one on success or zero on error. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 720 | OPENSSL_EXPORT int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, |
| 721 | const BIGNUM *b, |
| 722 | const BN_MONT_CTX *mont, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 723 | |
| 724 | |
| 725 | /* Exponentiation. */ |
| 726 | |
| 727 | /* BN_exp sets |r| equal to |a|^{|p|}. It does so with a square-and-multiply |
| 728 | * algorithm that leaks side-channel information. It returns one on success or |
| 729 | * zero otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 730 | OPENSSL_EXPORT int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
| 731 | BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 732 | |
Adam Langley | 5d17dd6 | 2014-06-30 14:22:32 -0700 | [diff] [blame] | 733 | /* BN_mod_exp sets |r| equal to |a|^{|p|} mod |m|. It does so with the best |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 734 | * algorithm for the values provided and can run in constant time if |
| 735 | * |BN_FLG_CONSTTIME| is set for |p|. It returns one on success or zero |
| 736 | * otherwise. */ |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 737 | OPENSSL_EXPORT int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
| 738 | const BIGNUM *m, BN_CTX *ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 739 | |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 740 | OPENSSL_EXPORT int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
| 741 | const BIGNUM *m, BN_CTX *ctx, |
| 742 | BN_MONT_CTX *m_ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 743 | |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 744 | OPENSSL_EXPORT int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, |
| 745 | const BIGNUM *p, const BIGNUM *m, |
| 746 | BN_CTX *ctx, BN_MONT_CTX *in_mont); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 747 | |
Adam Langley | eb7d2ed | 2014-07-30 16:02:14 -0700 | [diff] [blame^] | 748 | OPENSSL_EXPORT int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, |
| 749 | const BIGNUM *m, BN_CTX *ctx, |
| 750 | BN_MONT_CTX *m_ctx); |
| 751 | OPENSSL_EXPORT int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, |
| 752 | const BIGNUM *p1, const BIGNUM *a2, |
| 753 | const BIGNUM *p2, const BIGNUM *m, |
| 754 | BN_CTX *ctx, BN_MONT_CTX *m_ctx); |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 755 | |
| 756 | |
| 757 | /* Private functions */ |
| 758 | |
| 759 | struct bignum_st { |
| 760 | BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks in little-endian |
| 761 | order. */ |
| 762 | int top; /* Index of last used element in |d|, plus one. */ |
| 763 | int dmax; /* Size of |d|, in words. */ |
| 764 | int neg; /* one if the number is negative */ |
| 765 | int flags; /* bitmask of BN_FLG_* values */ |
| 766 | }; |
| 767 | |
| 768 | struct bn_mont_ctx_st { |
| 769 | BIGNUM RR; /* used to convert to montgomery form */ |
| 770 | BIGNUM N; /* The modulus */ |
| 771 | BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 |
| 772 | * (Ni is only stored for bignum algorithm) */ |
| 773 | BN_ULONG n0[2]; /* least significant word(s) of Ni; |
| 774 | (type changed with 0.9.9, was "BN_ULONG n0;" before) */ |
| 775 | int flags; |
| 776 | int ri; /* number of bits in R */ |
| 777 | }; |
| 778 | |
| 779 | unsigned BN_num_bits_word(BN_ULONG l); |
| 780 | |
| 781 | #define BN_FLG_MALLOCED 0x01 |
| 782 | #define BN_FLG_STATIC_DATA 0x02 |
| 783 | /* avoid leaking exponent information through timing, BN_mod_exp_mont() will |
| 784 | * call BN_mod_exp_mont_consttime, BN_div() will call BN_div_no_branch, |
| 785 | * BN_mod_inverse() will call BN_mod_inverse_no_branch. */ |
| 786 | #define BN_FLG_CONSTTIME 0x04 |
| 787 | |
| 788 | |
| 789 | #if defined(__cplusplus) |
| 790 | } /* extern C */ |
| 791 | #endif |
| 792 | |
| 793 | #define BN_F_BN_bn2hex 100 |
| 794 | #define BN_F_BN_new 101 |
| 795 | #define BN_F_BN_exp 102 |
| 796 | #define BN_F_mod_exp_recp 103 |
| 797 | #define BN_F_BN_mod_sqrt 104 |
| 798 | #define BN_F_BN_rand 105 |
| 799 | #define BN_F_BN_rand_range 106 |
| 800 | #define BN_F_bn_wexpand 107 |
| 801 | #define BN_F_BN_mod_exp_mont 108 |
| 802 | #define BN_F_BN_mod_exp2_mont 109 |
| 803 | #define BN_F_BN_CTX_get 110 |
| 804 | #define BN_F_BN_mod_inverse 111 |
| 805 | #define BN_F_BN_bn2dec 112 |
| 806 | #define BN_F_BN_div 113 |
| 807 | #define BN_F_BN_div_recp 114 |
| 808 | #define BN_F_BN_mod_exp_mont_consttime 115 |
| 809 | #define BN_F_BN_mod_exp_mont_word 116 |
| 810 | #define BN_F_BN_CTX_start 117 |
| 811 | #define BN_F_BN_usub 118 |
| 812 | #define BN_F_BN_mod_lshift_quick 119 |
| 813 | #define BN_F_BN_CTX_new 120 |
| 814 | #define BN_F_BN_mod_inverse_no_branch 121 |
Adam Langley | d4b4f08 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 815 | #define BN_F_BN_generate_dsa_nonce 122 |
Adam Langley | 27ae9ed | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 816 | #define BN_F_BN_generate_prime_ex 123 |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 817 | #define BN_F_BN_sqrt 124 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 818 | #define BN_R_NOT_A_SQUARE 100 |
| 819 | #define BN_R_TOO_MANY_ITERATIONS 101 |
| 820 | #define BN_R_INPUT_NOT_REDUCED 102 |
| 821 | #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 103 |
| 822 | #define BN_R_NO_INVERSE 104 |
| 823 | #define BN_R_NOT_INITIALIZED 105 |
| 824 | #define BN_R_DIV_BY_ZERO 106 |
| 825 | #define BN_R_CALLED_WITH_EVEN_MODULUS 107 |
| 826 | #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 108 |
| 827 | #define BN_R_BAD_RECIPROCAL 109 |
| 828 | #define BN_R_P_IS_NOT_PRIME 110 |
| 829 | #define BN_R_INVALID_RANGE 111 |
| 830 | #define BN_R_ARG2_LT_ARG3 112 |
| 831 | #define BN_R_BIGNUM_TOO_LONG 113 |
Adam Langley | d4b4f08 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 832 | #define BN_R_PRIVATE_KEY_TOO_LARGE 114 |
Adam Langley | 27ae9ed | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 833 | #define BN_R_BITS_TOO_SMALL 115 |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 834 | #define BN_R_NEGATIVE_NUMBER 116 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 835 | |
| 836 | #endif /* OPENSSL_HEADER_BN_H */ |