| 1 | /*
|
|---|
| 2 | * Copyright 2014-2021 The OpenSSL Project Authors. All Rights Reserved.
|
|---|
| 3 | *
|
|---|
| 4 | * Licensed under the Apache License 2.0 (the "License"). You may not use
|
|---|
| 5 | * this file except in compliance with the License. You can obtain a copy
|
|---|
| 6 | * in the file LICENSE in the source distribution or at
|
|---|
| 7 | * https://www.openssl.org/source/license.html
|
|---|
| 8 | */
|
|---|
| 9 |
|
|---|
| 10 | #ifndef OSSL_CRYPTO_BN_H
|
|---|
| 11 | # define OSSL_CRYPTO_BN_H
|
|---|
| 12 | # ifndef RT_WITHOUT_PRAGMA_ONCE /* VBOX */
|
|---|
| 13 | # pragma once
|
|---|
| 14 | # endif /* VBOX */
|
|---|
| 15 |
|
|---|
| 16 | # include <openssl/bn.h>
|
|---|
| 17 | # include <limits.h>
|
|---|
| 18 |
|
|---|
| 19 | BIGNUM *bn_wexpand(BIGNUM *a, int words);
|
|---|
| 20 | BIGNUM *bn_expand2(BIGNUM *a, int words);
|
|---|
| 21 |
|
|---|
| 22 | void bn_correct_top(BIGNUM *a);
|
|---|
| 23 |
|
|---|
| 24 | /*
|
|---|
| 25 | * Determine the modified width-(w+1) Non-Adjacent Form (wNAF) of 'scalar'.
|
|---|
| 26 | * This is an array r[] of values that are either zero or odd with an
|
|---|
| 27 | * absolute value less than 2^w satisfying scalar = \sum_j r[j]*2^j where at
|
|---|
| 28 | * most one of any w+1 consecutive digits is non-zero with the exception that
|
|---|
| 29 | * the most significant digit may be only w-1 zeros away from that next
|
|---|
| 30 | * non-zero digit.
|
|---|
| 31 | */
|
|---|
| 32 | signed char *bn_compute_wNAF(const BIGNUM *scalar, int w, size_t *ret_len);
|
|---|
| 33 |
|
|---|
| 34 | int bn_get_top(const BIGNUM *a);
|
|---|
| 35 |
|
|---|
| 36 | int bn_get_dmax(const BIGNUM *a);
|
|---|
| 37 |
|
|---|
| 38 | /* Set all words to zero */
|
|---|
| 39 | void bn_set_all_zero(BIGNUM *a);
|
|---|
| 40 |
|
|---|
| 41 | /*
|
|---|
| 42 | * Copy the internal BIGNUM words into out which holds size elements (and size
|
|---|
| 43 | * must be bigger than top)
|
|---|
| 44 | */
|
|---|
| 45 | int bn_copy_words(BN_ULONG *out, const BIGNUM *in, int size);
|
|---|
| 46 |
|
|---|
| 47 | BN_ULONG *bn_get_words(const BIGNUM *a);
|
|---|
| 48 |
|
|---|
| 49 | /*
|
|---|
| 50 | * Set the internal data words in a to point to words which contains size
|
|---|
| 51 | * elements. The BN_FLG_STATIC_DATA flag is set
|
|---|
| 52 | */
|
|---|
| 53 | void bn_set_static_words(BIGNUM *a, const BN_ULONG *words, int size);
|
|---|
| 54 |
|
|---|
| 55 | /*
|
|---|
| 56 | * Copy words into the BIGNUM |a|, reallocating space as necessary.
|
|---|
| 57 | * The negative flag of |a| is not modified.
|
|---|
| 58 | * Returns 1 on success and 0 on failure.
|
|---|
| 59 | */
|
|---|
| 60 | /*
|
|---|
| 61 | * |num_words| is int because bn_expand2 takes an int. This is an internal
|
|---|
| 62 | * function so we simply trust callers not to pass negative values.
|
|---|
| 63 | */
|
|---|
| 64 | int bn_set_words(BIGNUM *a, const BN_ULONG *words, int num_words);
|
|---|
| 65 |
|
|---|
| 66 | /*
|
|---|
| 67 | * Some BIGNUM functions assume most significant limb to be non-zero, which
|
|---|
| 68 | * is customarily arranged by bn_correct_top. Output from below functions
|
|---|
| 69 | * is not processed with bn_correct_top, and for this reason it may not be
|
|---|
| 70 | * returned out of public API. It may only be passed internally into other
|
|---|
| 71 | * functions known to support non-minimal or zero-padded BIGNUMs. Even
|
|---|
| 72 | * though the goal is to facilitate constant-time-ness, not each subroutine
|
|---|
| 73 | * is constant-time by itself. They all have pre-conditions, consult source
|
|---|
| 74 | * code...
|
|---|
| 75 | */
|
|---|
| 76 | int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
|
|---|
| 77 | BN_MONT_CTX *mont, BN_CTX *ctx);
|
|---|
| 78 | int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
|
|---|
| 79 | BN_CTX *ctx);
|
|---|
| 80 | int bn_from_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
|
|---|
| 81 | BN_CTX *ctx);
|
|---|
| 82 | int bn_mod_add_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
|
|---|
| 83 | const BIGNUM *m);
|
|---|
| 84 | int bn_mod_sub_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
|
|---|
| 85 | const BIGNUM *m);
|
|---|
| 86 | int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
|
|---|
| 87 | int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
|
|---|
| 88 | int bn_lshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n);
|
|---|
| 89 | int bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n);
|
|---|
| 90 | int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
|
|---|
| 91 | const BIGNUM *d, BN_CTX *ctx);
|
|---|
| 92 |
|
|---|
| 93 | #define BN_PRIMETEST_COMPOSITE 0
|
|---|
| 94 | #define BN_PRIMETEST_COMPOSITE_WITH_FACTOR 1
|
|---|
| 95 | #define BN_PRIMETEST_COMPOSITE_NOT_POWER_OF_PRIME 2
|
|---|
| 96 | #define BN_PRIMETEST_PROBABLY_PRIME 3
|
|---|
| 97 |
|
|---|
| 98 | int ossl_bn_miller_rabin_is_prime(const BIGNUM *w, int iterations, BN_CTX *ctx,
|
|---|
| 99 | BN_GENCB *cb, int enhanced, int *status);
|
|---|
| 100 |
|
|---|
| 101 | const BIGNUM *ossl_bn_get0_small_factors(void);
|
|---|
| 102 |
|
|---|
| 103 | int ossl_bn_rsa_fips186_4_gen_prob_primes(BIGNUM *p, BIGNUM *Xpout,
|
|---|
| 104 | BIGNUM *p1, BIGNUM *p2,
|
|---|
| 105 | const BIGNUM *Xp, const BIGNUM *Xp1,
|
|---|
| 106 | const BIGNUM *Xp2, int nlen,
|
|---|
| 107 | const BIGNUM *e, BN_CTX *ctx,
|
|---|
| 108 | BN_GENCB *cb);
|
|---|
| 109 |
|
|---|
| 110 | int ossl_bn_rsa_fips186_4_derive_prime(BIGNUM *Y, BIGNUM *X, const BIGNUM *Xin,
|
|---|
| 111 | const BIGNUM *r1, const BIGNUM *r2,
|
|---|
| 112 | int nlen, const BIGNUM *e, BN_CTX *ctx,
|
|---|
| 113 | BN_GENCB *cb);
|
|---|
| 114 |
|
|---|
| 115 | OSSL_LIB_CTX *ossl_bn_get_libctx(BN_CTX *ctx);
|
|---|
| 116 |
|
|---|
| 117 | extern const BIGNUM ossl_bn_inv_sqrt_2;
|
|---|
| 118 |
|
|---|
| 119 | #endif
|
|---|
