bn.h 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  1. /*
  2. * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
  3. * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved
  4. *
  5. * Licensed under the OpenSSL license (the "License"). You may not use
  6. * this file except in compliance with the License. You can obtain a copy
  7. * in the file LICENSE in the source distribution or at
  8. * https://www.openssl.org/source/license.html
  9. */
  10. #ifndef HEADER_BN_H
  11. # define HEADER_BN_H
  12. # include <openssl/e_os2.h>
  13. # ifndef OPENSSL_NO_STDIO
  14. # include <stdio.h>
  15. # endif
  16. # include <openssl/opensslconf.h>
  17. # include <openssl/ossl_typ.h>
  18. # include <openssl/crypto.h>
  19. # include <openssl/bnerr.h>
  20. #ifdef __cplusplus
  21. extern "C" {
  22. #endif
  23. /*
  24. * 64-bit processor with LP64 ABI
  25. */
  26. # ifdef SIXTY_FOUR_BIT_LONG
  27. # define BN_ULONG unsigned long
  28. # define BN_BYTES 8
  29. # endif
  30. /*
  31. * 64-bit processor other than LP64 ABI
  32. */
  33. # ifdef SIXTY_FOUR_BIT
  34. # define BN_ULONG unsigned long long
  35. # define BN_BYTES 8
  36. # endif
  37. # ifdef THIRTY_TWO_BIT
  38. # define BN_ULONG unsigned int
  39. # define BN_BYTES 4
  40. # endif
  41. # define BN_BITS2 (BN_BYTES * 8)
  42. # define BN_BITS (BN_BITS2 * 2)
  43. # define BN_TBIT ((BN_ULONG)1 << (BN_BITS2 - 1))
  44. # define BN_FLG_MALLOCED 0x01
  45. # define BN_FLG_STATIC_DATA 0x02
  46. /*
  47. * avoid leaking exponent information through timing,
  48. * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
  49. * BN_div() will call BN_div_no_branch,
  50. * BN_mod_inverse() will call BN_mod_inverse_no_branch.
  51. */
  52. # define BN_FLG_CONSTTIME 0x04
  53. # define BN_FLG_SECURE 0x08
  54. # if OPENSSL_API_COMPAT < 0x00908000L
  55. /* deprecated name for the flag */
  56. # define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
  57. # define BN_FLG_FREE 0x8000 /* used for debugging */
  58. # endif
  59. void BN_set_flags(BIGNUM *b, int n);
  60. int BN_get_flags(const BIGNUM *b, int n);
  61. /* Values for |top| in BN_rand() */
  62. #define BN_RAND_TOP_ANY -1
  63. #define BN_RAND_TOP_ONE 0
  64. #define BN_RAND_TOP_TWO 1
  65. /* Values for |bottom| in BN_rand() */
  66. #define BN_RAND_BOTTOM_ANY 0
  67. #define BN_RAND_BOTTOM_ODD 1
  68. /*
  69. * get a clone of a BIGNUM with changed flags, for *temporary* use only (the
  70. * two BIGNUMs cannot be used in parallel!). Also only for *read only* use. The
  71. * value |dest| should be a newly allocated BIGNUM obtained via BN_new() that
  72. * has not been otherwise initialised or used.
  73. */
  74. void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags);
  75. /* Wrapper function to make using BN_GENCB easier */
  76. int BN_GENCB_call(BN_GENCB *cb, int a, int b);
  77. BN_GENCB *BN_GENCB_new(void);
  78. void BN_GENCB_free(BN_GENCB *cb);
  79. /* Populate a BN_GENCB structure with an "old"-style callback */
  80. void BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),
  81. void *cb_arg);
  82. /* Populate a BN_GENCB structure with a "new"-style callback */
  83. void BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),
  84. void *cb_arg);
  85. void *BN_GENCB_get_arg(BN_GENCB *cb);
  86. # define BN_prime_checks 0 /* default: select number of iterations based
  87. * on the size of the number */
  88. /*
  89. * number of Miller-Rabin iterations for an error rate of less than 2^-80 for
  90. * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of
  91. * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
  92. * original paper: Damgaard, Landrock, Pomerance: Average case error
  93. * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)
  94. * 177-194)
  95. */
  96. # define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
  97. (b) >= 850 ? 3 : \
  98. (b) >= 650 ? 4 : \
  99. (b) >= 550 ? 5 : \
  100. (b) >= 450 ? 6 : \
  101. (b) >= 400 ? 7 : \
  102. (b) >= 350 ? 8 : \
  103. (b) >= 300 ? 9 : \
  104. (b) >= 250 ? 12 : \
  105. (b) >= 200 ? 15 : \
  106. (b) >= 150 ? 18 : \
  107. /* b >= 100 */ 27)
  108. # define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
  109. int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w);
  110. int BN_is_zero(const BIGNUM *a);
  111. int BN_is_one(const BIGNUM *a);
  112. int BN_is_word(const BIGNUM *a, const BN_ULONG w);
  113. int BN_is_odd(const BIGNUM *a);
  114. # define BN_one(a) (BN_set_word((a),1))
  115. void BN_zero_ex(BIGNUM *a);
  116. # if OPENSSL_API_COMPAT >= 0x00908000L
  117. # define BN_zero(a) BN_zero_ex(a)
  118. # else
  119. # define BN_zero(a) (BN_set_word((a),0))
  120. # endif
  121. const BIGNUM *BN_value_one(void);
  122. char *BN_options(void);
  123. BN_CTX *BN_CTX_new(void);
  124. BN_CTX *BN_CTX_secure_new(void);
  125. void BN_CTX_free(BN_CTX *c);
  126. void BN_CTX_start(BN_CTX *ctx);
  127. BIGNUM *BN_CTX_get(BN_CTX *ctx);
  128. void BN_CTX_end(BN_CTX *ctx);
  129. int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
  130. int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom);
  131. int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
  132. int BN_priv_rand_range(BIGNUM *rnd, const BIGNUM *range);
  133. int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
  134. int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
  135. int BN_num_bits(const BIGNUM *a);
  136. int BN_num_bits_word(BN_ULONG l);
  137. int BN_security_bits(int L, int N);
  138. BIGNUM *BN_new(void);
  139. BIGNUM *BN_secure_new(void);
  140. void BN_clear_free(BIGNUM *a);
  141. BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
  142. void BN_swap(BIGNUM *a, BIGNUM *b);
  143. BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
  144. int BN_bn2bin(const BIGNUM *a, unsigned char *to);
  145. int BN_bn2binpad(const BIGNUM *a, unsigned char *to, int tolen);
  146. BIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret);
  147. int BN_bn2lebinpad(const BIGNUM *a, unsigned char *to, int tolen);
  148. BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
  149. int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
  150. int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
  151. int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
  152. int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
  153. int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
  154. int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
  155. int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
  156. /** BN_set_negative sets sign of a BIGNUM
  157. * \param b pointer to the BIGNUM object
  158. * \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
  159. */
  160. void BN_set_negative(BIGNUM *b, int n);
  161. /** BN_is_negative returns 1 if the BIGNUM is negative
  162. * \param b pointer to the BIGNUM object
  163. * \return 1 if a < 0 and 0 otherwise
  164. */
  165. int BN_is_negative(const BIGNUM *b);
  166. int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
  167. BN_CTX *ctx);
  168. # define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
  169. int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
  170. int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  171. BN_CTX *ctx);
  172. int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  173. const BIGNUM *m);
  174. int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  175. BN_CTX *ctx);
  176. int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  177. const BIGNUM *m);
  178. int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  179. BN_CTX *ctx);
  180. int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
  181. int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
  182. int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
  183. int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
  184. BN_CTX *ctx);
  185. int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
  186. BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
  187. BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
  188. int BN_mul_word(BIGNUM *a, BN_ULONG w);
  189. int BN_add_word(BIGNUM *a, BN_ULONG w);
  190. int BN_sub_word(BIGNUM *a, BN_ULONG w);
  191. int BN_set_word(BIGNUM *a, BN_ULONG w);
  192. BN_ULONG BN_get_word(const BIGNUM *a);
  193. int BN_cmp(const BIGNUM *a, const BIGNUM *b);
  194. void BN_free(BIGNUM *a);
  195. int BN_is_bit_set(const BIGNUM *a, int n);
  196. int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
  197. int BN_lshift1(BIGNUM *r, const BIGNUM *a);
  198. int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  199. int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  200. const BIGNUM *m, BN_CTX *ctx);
  201. int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  202. const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
  203. int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  204. const BIGNUM *m, BN_CTX *ctx,
  205. BN_MONT_CTX *in_mont);
  206. int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
  207. const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
  208. int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
  209. const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
  210. BN_CTX *ctx, BN_MONT_CTX *m_ctx);
  211. int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  212. const BIGNUM *m, BN_CTX *ctx);
  213. int BN_mask_bits(BIGNUM *a, int n);
  214. # ifndef OPENSSL_NO_STDIO
  215. int BN_print_fp(FILE *fp, const BIGNUM *a);
  216. # endif
  217. int BN_print(BIO *bio, const BIGNUM *a);
  218. int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
  219. int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
  220. int BN_rshift1(BIGNUM *r, const BIGNUM *a);
  221. void BN_clear(BIGNUM *a);
  222. BIGNUM *BN_dup(const BIGNUM *a);
  223. int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
  224. int BN_set_bit(BIGNUM *a, int n);
  225. int BN_clear_bit(BIGNUM *a, int n);
  226. char *BN_bn2hex(const BIGNUM *a);
  227. char *BN_bn2dec(const BIGNUM *a);
  228. int BN_hex2bn(BIGNUM **a, const char *str);
  229. int BN_dec2bn(BIGNUM **a, const char *str);
  230. int BN_asc2bn(BIGNUM **a, const char *str);
  231. int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
  232. int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
  233. * -2 for
  234. * error */
  235. BIGNUM *BN_mod_inverse(BIGNUM *ret,
  236. const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
  237. BIGNUM *BN_mod_sqrt(BIGNUM *ret,
  238. const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
  239. void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
  240. /* Deprecated versions */
  241. DEPRECATEDIN_0_9_8(BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
  242. const BIGNUM *add,
  243. const BIGNUM *rem,
  244. void (*callback) (int, int,
  245. void *),
  246. void *cb_arg))
  247. DEPRECATEDIN_0_9_8(int
  248. BN_is_prime(const BIGNUM *p, int nchecks,
  249. void (*callback) (int, int, void *),
  250. BN_CTX *ctx, void *cb_arg))
  251. DEPRECATEDIN_0_9_8(int
  252. BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
  253. void (*callback) (int, int, void *),
  254. BN_CTX *ctx, void *cb_arg,
  255. int do_trial_division))
  256. /* Newer versions */
  257. int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
  258. const BIGNUM *rem, BN_GENCB *cb);
  259. int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
  260. int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
  261. int do_trial_division, BN_GENCB *cb);
  262. int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
  263. int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
  264. const BIGNUM *Xp, const BIGNUM *Xp1,
  265. const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
  266. BN_GENCB *cb);
  267. int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
  268. BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
  269. BN_CTX *ctx, BN_GENCB *cb);
  270. BN_MONT_CTX *BN_MONT_CTX_new(void);
  271. int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  272. BN_MONT_CTX *mont, BN_CTX *ctx);
  273. int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  274. BN_CTX *ctx);
  275. int BN_from_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  276. BN_CTX *ctx);
  277. void BN_MONT_CTX_free(BN_MONT_CTX *mont);
  278. int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
  279. BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
  280. BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,
  281. const BIGNUM *mod, BN_CTX *ctx);
  282. /* BN_BLINDING flags */
  283. # define BN_BLINDING_NO_UPDATE 0x00000001
  284. # define BN_BLINDING_NO_RECREATE 0x00000002
  285. BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
  286. void BN_BLINDING_free(BN_BLINDING *b);
  287. int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
  288. int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
  289. int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
  290. int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
  291. int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
  292. BN_CTX *);
  293. int BN_BLINDING_is_current_thread(BN_BLINDING *b);
  294. void BN_BLINDING_set_current_thread(BN_BLINDING *b);
  295. int BN_BLINDING_lock(BN_BLINDING *b);
  296. int BN_BLINDING_unlock(BN_BLINDING *b);
  297. unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
  298. void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
  299. BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
  300. const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
  301. int (*bn_mod_exp) (BIGNUM *r,
  302. const BIGNUM *a,
  303. const BIGNUM *p,
  304. const BIGNUM *m,
  305. BN_CTX *ctx,
  306. BN_MONT_CTX *m_ctx),
  307. BN_MONT_CTX *m_ctx);
  308. DEPRECATEDIN_0_9_8(void BN_set_params(int mul, int high, int low, int mont))
  309. DEPRECATEDIN_0_9_8(int BN_get_params(int which)) /* 0, mul, 1 high, 2 low, 3
  310. * mont */
  311. BN_RECP_CTX *BN_RECP_CTX_new(void);
  312. void BN_RECP_CTX_free(BN_RECP_CTX *recp);
  313. int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
  314. int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  315. BN_RECP_CTX *recp, BN_CTX *ctx);
  316. int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  317. const BIGNUM *m, BN_CTX *ctx);
  318. int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
  319. BN_RECP_CTX *recp, BN_CTX *ctx);
  320. # ifndef OPENSSL_NO_EC2M
  321. /*
  322. * Functions for arithmetic over binary polynomials represented by BIGNUMs.
  323. * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
  324. * ignored. Note that input arguments are not const so that their bit arrays
  325. * can be expanded to the appropriate size if needed.
  326. */
  327. /*
  328. * r = a + b
  329. */
  330. int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
  331. # define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
  332. /*
  333. * r=a mod p
  334. */
  335. int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
  336. /* r = (a * b) mod p */
  337. int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  338. const BIGNUM *p, BN_CTX *ctx);
  339. /* r = (a * a) mod p */
  340. int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  341. /* r = (1 / b) mod p */
  342. int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
  343. /* r = (a / b) mod p */
  344. int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  345. const BIGNUM *p, BN_CTX *ctx);
  346. /* r = (a ^ b) mod p */
  347. int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  348. const BIGNUM *p, BN_CTX *ctx);
  349. /* r = sqrt(a) mod p */
  350. int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  351. BN_CTX *ctx);
  352. /* r^2 + r = a mod p */
  353. int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  354. BN_CTX *ctx);
  355. # define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
  356. /*-
  357. * Some functions allow for representation of the irreducible polynomials
  358. * as an unsigned int[], say p. The irreducible f(t) is then of the form:
  359. * t^p[0] + t^p[1] + ... + t^p[k]
  360. * where m = p[0] > p[1] > ... > p[k] = 0.
  361. */
  362. /* r = a mod p */
  363. int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);
  364. /* r = (a * b) mod p */
  365. int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  366. const int p[], BN_CTX *ctx);
  367. /* r = (a * a) mod p */
  368. int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  369. BN_CTX *ctx);
  370. /* r = (1 / b) mod p */
  371. int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],
  372. BN_CTX *ctx);
  373. /* r = (a / b) mod p */
  374. int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  375. const int p[], BN_CTX *ctx);
  376. /* r = (a ^ b) mod p */
  377. int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  378. const int p[], BN_CTX *ctx);
  379. /* r = sqrt(a) mod p */
  380. int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
  381. const int p[], BN_CTX *ctx);
  382. /* r^2 + r = a mod p */
  383. int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
  384. const int p[], BN_CTX *ctx);
  385. int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);
  386. int BN_GF2m_arr2poly(const int p[], BIGNUM *a);
  387. # endif
  388. /*
  389. * faster mod functions for the 'NIST primes' 0 <= a < p^2
  390. */
  391. int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  392. int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  393. int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  394. int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  395. int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
  396. const BIGNUM *BN_get0_nist_prime_192(void);
  397. const BIGNUM *BN_get0_nist_prime_224(void);
  398. const BIGNUM *BN_get0_nist_prime_256(void);
  399. const BIGNUM *BN_get0_nist_prime_384(void);
  400. const BIGNUM *BN_get0_nist_prime_521(void);
  401. int (*BN_nist_mod_func(const BIGNUM *p)) (BIGNUM *r, const BIGNUM *a,
  402. const BIGNUM *field, BN_CTX *ctx);
  403. int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
  404. const BIGNUM *priv, const unsigned char *message,
  405. size_t message_len, BN_CTX *ctx);
  406. /* Primes from RFC 2409 */
  407. BIGNUM *BN_get_rfc2409_prime_768(BIGNUM *bn);
  408. BIGNUM *BN_get_rfc2409_prime_1024(BIGNUM *bn);
  409. /* Primes from RFC 3526 */
  410. BIGNUM *BN_get_rfc3526_prime_1536(BIGNUM *bn);
  411. BIGNUM *BN_get_rfc3526_prime_2048(BIGNUM *bn);
  412. BIGNUM *BN_get_rfc3526_prime_3072(BIGNUM *bn);
  413. BIGNUM *BN_get_rfc3526_prime_4096(BIGNUM *bn);
  414. BIGNUM *BN_get_rfc3526_prime_6144(BIGNUM *bn);
  415. BIGNUM *BN_get_rfc3526_prime_8192(BIGNUM *bn);
  416. # if OPENSSL_API_COMPAT < 0x10100000L
  417. # define get_rfc2409_prime_768 BN_get_rfc2409_prime_768
  418. # define get_rfc2409_prime_1024 BN_get_rfc2409_prime_1024
  419. # define get_rfc3526_prime_1536 BN_get_rfc3526_prime_1536
  420. # define get_rfc3526_prime_2048 BN_get_rfc3526_prime_2048
  421. # define get_rfc3526_prime_3072 BN_get_rfc3526_prime_3072
  422. # define get_rfc3526_prime_4096 BN_get_rfc3526_prime_4096
  423. # define get_rfc3526_prime_6144 BN_get_rfc3526_prime_6144
  424. # define get_rfc3526_prime_8192 BN_get_rfc3526_prime_8192
  425. # endif
  426. int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
  427. # ifdef __cplusplus
  428. }
  429. # endif
  430. #endif