2 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (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
12 #include "internal/cryptlib.h"
14 #include <openssl/opensslconf.h>
15 #include "internal/constant_time_locl.h"
17 /* This stuff appears to be completely unused, so is deprecated */
18 #if OPENSSL_API_COMPAT < 0x00908000L
20 * For a 32 bit machine
29 static int bn_limit_bits = 0;
30 static int bn_limit_num = 8; /* (1<<bn_limit_bits) */
31 static int bn_limit_bits_low = 0;
32 static int bn_limit_num_low = 8; /* (1<<bn_limit_bits_low) */
33 static int bn_limit_bits_high = 0;
34 static int bn_limit_num_high = 8; /* (1<<bn_limit_bits_high) */
35 static int bn_limit_bits_mont = 0;
36 static int bn_limit_num_mont = 8; /* (1<<bn_limit_bits_mont) */
38 void BN_set_params(int mult, int high, int low, int mont)
41 if (mult > (int)(sizeof(int) * 8) - 1)
42 mult = sizeof(int) * 8 - 1;
44 bn_limit_num = 1 << mult;
47 if (high > (int)(sizeof(int) * 8) - 1)
48 high = sizeof(int) * 8 - 1;
49 bn_limit_bits_high = high;
50 bn_limit_num_high = 1 << high;
53 if (low > (int)(sizeof(int) * 8) - 1)
54 low = sizeof(int) * 8 - 1;
55 bn_limit_bits_low = low;
56 bn_limit_num_low = 1 << low;
59 if (mont > (int)(sizeof(int) * 8) - 1)
60 mont = sizeof(int) * 8 - 1;
61 bn_limit_bits_mont = mont;
62 bn_limit_num_mont = 1 << mont;
66 int BN_get_params(int which)
69 return (bn_limit_bits);
71 return (bn_limit_bits_high);
73 return (bn_limit_bits_low);
75 return (bn_limit_bits_mont);
81 const BIGNUM *BN_value_one(void)
83 static const BN_ULONG data_one = 1L;
84 static const BIGNUM const_one =
85 { (BN_ULONG *)&data_one, 1, 1, 0, BN_FLG_STATIC_DATA };
90 int BN_num_bits_word(BN_ULONG l)
97 mask = (0 - x) & BN_MASK2;
98 mask = (0 - (mask >> (BN_BITS2 - 1)));
104 mask = (0 - x) & BN_MASK2;
105 mask = (0 - (mask >> (BN_BITS2 - 1)));
110 mask = (0 - x) & BN_MASK2;
111 mask = (0 - (mask >> (BN_BITS2 - 1)));
116 mask = (0 - x) & BN_MASK2;
117 mask = (0 - (mask >> (BN_BITS2 - 1)));
122 mask = (0 - x) & BN_MASK2;
123 mask = (0 - (mask >> (BN_BITS2 - 1)));
128 mask = (0 - x) & BN_MASK2;
129 mask = (0 - (mask >> (BN_BITS2 - 1)));
135 int BN_num_bits(const BIGNUM *a)
142 return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
145 static void bn_free_d(BIGNUM *a)
147 if (BN_get_flags(a, BN_FLG_SECURE))
148 OPENSSL_secure_free(a->d);
154 void BN_clear_free(BIGNUM *a)
162 OPENSSL_cleanse(a->d, a->dmax * sizeof(a->d[0]));
163 if (!BN_get_flags(a, BN_FLG_STATIC_DATA))
166 i = BN_get_flags(a, BN_FLG_MALLOCED);
167 OPENSSL_cleanse(a, sizeof(*a));
172 void BN_free(BIGNUM *a)
177 if (!BN_get_flags(a, BN_FLG_STATIC_DATA))
179 if (a->flags & BN_FLG_MALLOCED)
182 #if OPENSSL_API_COMPAT < 0x00908000L
183 a->flags |= BN_FLG_FREE;
189 void bn_init(BIGNUM *a)
201 if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL) {
202 BNerr(BN_F_BN_NEW, ERR_R_MALLOC_FAILURE);
205 ret->flags = BN_FLG_MALLOCED;
210 BIGNUM *BN_secure_new(void)
212 BIGNUM *ret = BN_new();
214 ret->flags |= BN_FLG_SECURE;
218 /* This is used by bn_expand2() */
219 /* The caller MUST check that words > b->dmax before calling this */
220 static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
222 BN_ULONG *A, *a = NULL;
226 if (words > (INT_MAX / (4 * BN_BITS2))) {
227 BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);
230 if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {
231 BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
234 if (BN_get_flags(b, BN_FLG_SECURE))
235 a = A = OPENSSL_secure_zalloc(words * sizeof(*a));
237 a = A = OPENSSL_zalloc(words * sizeof(*a));
239 BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);
245 /* Check if the previous number needs to be copied */
247 for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {
249 * The fact that the loop is unrolled
250 * 4-wise is a tribute to Intel. It's
251 * the one that doesn't have enough
252 * registers to accommodate more data.
253 * I'd unroll it 8-wise otherwise:-)
255 * <appro@fy.chalmers.se>
257 BN_ULONG a0, a1, a2, a3;
267 switch (b->top & 3) {
278 /* Without the "case 0" some old optimizers got this wrong. */
283 memset(A, 0, sizeof(*A) * words);
284 memcpy(A, b->d, sizeof(b->d[0]) * b->top);
291 * This is an internal function that should not be used in applications. It
292 * ensures that 'b' has enough room for a 'words' word number and initialises
293 * any unused part of b->d with leading zeros. It is mostly used by the
294 * various BIGNUM routines. If there is an error, NULL is returned. If not,
298 BIGNUM *bn_expand2(BIGNUM *b, int words)
300 if (words > b->dmax) {
301 BN_ULONG *a = bn_expand_internal(b, words);
305 OPENSSL_cleanse(b->d, b->dmax * sizeof(b->d[0]));
315 BIGNUM *BN_dup(const BIGNUM *a)
323 t = BN_get_flags(a, BN_FLG_SECURE) ? BN_secure_new() : BN_new();
326 if (!BN_copy(t, a)) {
334 BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
344 if (bn_wexpand(a, b->top) == NULL)
350 for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {
351 BN_ULONG a0, a1, a2, a3;
361 /* ultrix cc workaround, see comments in bn_expand_internal */
362 switch (b->top & 3) {
375 memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
380 a->flags |= b->flags & BN_FLG_FIXED_TOP;
385 #define FLAGS_DATA(flags) ((flags) & (BN_FLG_STATIC_DATA \
389 #define FLAGS_STRUCT(flags) ((flags) & (BN_FLG_MALLOCED))
391 void BN_swap(BIGNUM *a, BIGNUM *b)
393 int flags_old_a, flags_old_b;
395 int tmp_top, tmp_dmax, tmp_neg;
400 flags_old_a = a->flags;
401 flags_old_b = b->flags;
418 a->flags = FLAGS_STRUCT(flags_old_a) | FLAGS_DATA(flags_old_b);
419 b->flags = FLAGS_STRUCT(flags_old_b) | FLAGS_DATA(flags_old_a);
424 void BN_clear(BIGNUM *a)
428 OPENSSL_cleanse(a->d, sizeof(*a->d) * a->dmax);
431 a->flags &= ~BN_FLG_FIXED_TOP;
434 BN_ULONG BN_get_word(const BIGNUM *a)
438 else if (a->top == 1)
444 int BN_set_word(BIGNUM *a, BN_ULONG w)
447 if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
451 a->top = (w ? 1 : 0);
452 a->flags &= ~BN_FLG_FIXED_TOP;
457 BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
469 /* Skip leading zero's. */
470 for ( ; len > 0 && *s == 0; s++, len--)
477 i = ((n - 1) / BN_BYTES) + 1;
478 m = ((n - 1) % (BN_BYTES));
479 if (bn_wexpand(ret, (int)i) == NULL) {
487 l = (l << 8L) | *(s++);
495 * need to call this due to clear byte at top if avoiding having the top
496 * bit set (-ve number)
502 /* ignore negative */
503 static int bn2binpad(const BIGNUM *a, unsigned char *to, int tolen)
506 size_t i, lasti, j, atop, mask;
510 * In case |a| is fixed-top, BN_num_bytes can return bogus length,
511 * but it's assumed that fixed-top inputs ought to be "nominated"
512 * even for padded output, so it works out...
517 } else if (tolen < n) { /* uncommon/unlike case */
520 bn_correct_top(&temp);
521 n = BN_num_bytes(&temp);
526 /* Swipe through whole available data and don't give away padded zero. */
527 atop = a->dmax * BN_BYTES;
529 OPENSSL_cleanse(to, tolen);
534 atop = a->top * BN_BYTES;
535 for (i = 0, j = 0, to += tolen; j < (size_t)tolen; j++) {
536 l = a->d[i / BN_BYTES];
537 mask = 0 - ((j - atop) >> (8 * sizeof(i) - 1));
538 *--to = (unsigned char)(l >> (8 * (i % BN_BYTES)) & mask);
539 i += (i - lasti) >> (8 * sizeof(i) - 1); /* stay on last limb */
545 int BN_bn2binpad(const BIGNUM *a, unsigned char *to, int tolen)
549 return bn2binpad(a, to, tolen);
552 int BN_bn2bin(const BIGNUM *a, unsigned char *to)
554 return bn2binpad(a, to, -1);
557 BIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret)
570 /* Skip trailing zeroes. */
571 for ( ; len > 0 && s[-1] == 0; s--, len--)
578 i = ((n - 1) / BN_BYTES) + 1;
579 m = ((n - 1) % (BN_BYTES));
580 if (bn_wexpand(ret, (int)i) == NULL) {
597 * need to call this due to clear byte at top if avoiding having the top
598 * bit set (-ve number)
604 int BN_bn2lebinpad(const BIGNUM *a, unsigned char *to, int tolen)
612 /* Add trailing zeroes if necessary */
614 memset(to + i, 0, tolen - i);
617 l = a->d[i / BN_BYTES];
619 *to = (unsigned char)(l >> (8 * (i % BN_BYTES))) & 0xff;
624 int BN_ucmp(const BIGNUM *a, const BIGNUM *b)
627 BN_ULONG t1, t2, *ap, *bp;
637 for (i = a->top - 1; i >= 0; i--) {
641 return ((t1 > t2) ? 1 : -1);
646 int BN_cmp(const BIGNUM *a, const BIGNUM *b)
652 if ((a == NULL) || (b == NULL)) {
664 if (a->neg != b->neg) {
682 for (i = a->top - 1; i >= 0; i--) {
693 int BN_set_bit(BIGNUM *a, int n)
703 if (bn_wexpand(a, i + 1) == NULL)
705 for (k = a->top; k < i + 1; k++)
708 a->flags &= ~BN_FLG_FIXED_TOP;
711 a->d[i] |= (((BN_ULONG)1) << j);
716 int BN_clear_bit(BIGNUM *a, int n)
729 a->d[i] &= (~(((BN_ULONG)1) << j));
734 int BN_is_bit_set(const BIGNUM *a, int n)
745 return (int)(((a->d[i]) >> j) & ((BN_ULONG)1));
748 int BN_mask_bits(BIGNUM *a, int n)
764 a->d[w] &= ~(BN_MASK2 << b);
770 void BN_set_negative(BIGNUM *a, int b)
772 if (b && !BN_is_zero(a))
778 int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
786 return ((aa > bb) ? 1 : -1);
787 for (i = n - 2; i >= 0; i--) {
791 return ((aa > bb) ? 1 : -1);
797 * Here follows a specialised variants of bn_cmp_words(). It has the
798 * capability of performing the operation on arrays of different sizes. The
799 * sizes of those arrays is expressed through cl, which is the common length
800 * ( basically, min(len(a),len(b)) ), and dl, which is the delta between the
801 * two lengths, calculated as len(a)-len(b). All lengths are the number of
805 int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
811 for (i = dl; i < 0; i++) {
813 return -1; /* a < b */
817 for (i = dl; i > 0; i--) {
819 return 1; /* a > b */
822 return bn_cmp_words(a, b, cl);
826 * Constant-time conditional swap of a and b.
827 * a and b are swapped if condition is not 0. The code assumes that at most one bit of condition is set.
828 * nwords is the number of words to swap. The code assumes that at least nwords are allocated in both a and b,
829 * and that no more than nwords are used by either a or b.
830 * a and b cannot be the same number
832 void BN_consttime_swap(BN_ULONG condition, BIGNUM *a, BIGNUM *b, int nwords)
837 bn_wcheck_size(a, nwords);
838 bn_wcheck_size(b, nwords);
841 assert((condition & (condition - 1)) == 0);
842 assert(sizeof(BN_ULONG) >= sizeof(int));
844 condition = ((condition - 1) >> (BN_BITS2 - 1)) - 1;
846 t = (a->top ^ b->top) & condition;
850 t = (a->neg ^ b->neg) & condition;
855 * BN_FLG_STATIC_DATA: indicates that data may not be written to. Intention
856 * is actually to treat it as it's read-only data, and some (if not most)
857 * of it does reside in read-only segment. In other words observation of
858 * BN_FLG_STATIC_DATA in BN_consttime_swap should be treated as fatal
859 * condition. It would either cause SEGV or effectively cause data
862 * BN_FLG_MALLOCED: refers to BN structure itself, and hence must be
865 * BN_FLG_SECURE: must be preserved, because it determines how x->d was
866 * allocated and hence how to free it.
868 * BN_FLG_CONSTTIME: sufficient to mask and swap
870 * BN_FLG_FIXED_TOP: indicates that we haven't called bn_correct_top() on
871 * the data, so the d array may be padded with additional 0 values (i.e.
872 * top could be greater than the minimal value that it could be). We should
876 #define BN_CONSTTIME_SWAP_FLAGS (BN_FLG_CONSTTIME | BN_FLG_FIXED_TOP)
878 t = ((a->flags ^ b->flags) & BN_CONSTTIME_SWAP_FLAGS) & condition;
882 #define BN_CONSTTIME_SWAP(ind) \
884 t = (a->d[ind] ^ b->d[ind]) & condition; \
891 for (i = 10; i < nwords; i++)
892 BN_CONSTTIME_SWAP(i);
895 BN_CONSTTIME_SWAP(9); /* Fallthrough */
897 BN_CONSTTIME_SWAP(8); /* Fallthrough */
899 BN_CONSTTIME_SWAP(7); /* Fallthrough */
901 BN_CONSTTIME_SWAP(6); /* Fallthrough */
903 BN_CONSTTIME_SWAP(5); /* Fallthrough */
905 BN_CONSTTIME_SWAP(4); /* Fallthrough */
907 BN_CONSTTIME_SWAP(3); /* Fallthrough */
909 BN_CONSTTIME_SWAP(2); /* Fallthrough */
911 BN_CONSTTIME_SWAP(1); /* Fallthrough */
913 BN_CONSTTIME_SWAP(0);
915 #undef BN_CONSTTIME_SWAP
918 /* Bits of security, see SP800-57 */
920 int BN_security_bits(int L, int N)
940 return bits >= secbits ? secbits : bits;
943 void BN_zero_ex(BIGNUM *a)
947 a->flags &= ~BN_FLG_FIXED_TOP;
950 int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
952 return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));
955 int BN_is_zero(const BIGNUM *a)
960 int BN_is_one(const BIGNUM *a)
962 return BN_abs_is_word(a, 1) && !a->neg;
965 int BN_is_word(const BIGNUM *a, const BN_ULONG w)
967 return BN_abs_is_word(a, w) && (!w || !a->neg);
970 int BN_is_odd(const BIGNUM *a)
972 return (a->top > 0) && (a->d[0] & 1);
975 int BN_is_negative(const BIGNUM *a)
977 return (a->neg != 0);
980 int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
983 return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
986 void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags)
990 dest->dmax = b->dmax;
992 dest->flags = ((dest->flags & BN_FLG_MALLOCED)
993 | (b->flags & ~BN_FLG_MALLOCED)
994 | BN_FLG_STATIC_DATA | flags);
997 BN_GENCB *BN_GENCB_new(void)
1001 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {
1002 BNerr(BN_F_BN_GENCB_NEW, ERR_R_MALLOC_FAILURE);
1009 void BN_GENCB_free(BN_GENCB *cb)
1016 void BN_set_flags(BIGNUM *b, int n)
1021 int BN_get_flags(const BIGNUM *b, int n)
1023 return b->flags & n;
1026 /* Populate a BN_GENCB structure with an "old"-style callback */
1027 void BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),
1030 BN_GENCB *tmp_gencb = gencb;
1032 tmp_gencb->arg = cb_arg;
1033 tmp_gencb->cb.cb_1 = callback;
1036 /* Populate a BN_GENCB structure with a "new"-style callback */
1037 void BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),
1040 BN_GENCB *tmp_gencb = gencb;
1042 tmp_gencb->arg = cb_arg;
1043 tmp_gencb->cb.cb_2 = callback;
1046 void *BN_GENCB_get_arg(BN_GENCB *cb)
1051 BIGNUM *bn_wexpand(BIGNUM *a, int words)
1053 return (words <= a->dmax) ? a : bn_expand2(a, words);
1056 void bn_correct_top(BIGNUM *a)
1059 int tmp_top = a->top;
1062 for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
1071 a->flags &= ~BN_FLG_FIXED_TOP;