Nie możesz wybrać więcej, niż 25 tematów Tematy muszą się zaczynać od litery lub cyfry, mogą zawierać myślniki ('-') i mogą mieć do 35 znaków.

internal.h 11 KiB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258
  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. #ifndef OPENSSL_HEADER_BN_INTERNAL_H
  123. #define OPENSSL_HEADER_BN_INTERNAL_H
  124. #include <openssl/base.h>
  125. #if defined(OPENSSL_X86_64) && defined(_MSC_VER)
  126. OPENSSL_MSVC_PRAGMA(warning(push, 3))
  127. #include <intrin.h>
  128. OPENSSL_MSVC_PRAGMA(warning(pop))
  129. #pragma intrinsic(__umulh, _umul128)
  130. #endif
  131. #include "../internal.h"
  132. #if defined(__cplusplus)
  133. extern "C" {
  134. #endif
  135. /* bn_expand acts the same as |bn_wexpand|, but takes a number of bits rather
  136. * than a number of words. */
  137. BIGNUM *bn_expand(BIGNUM *bn, size_t bits);
  138. #if defined(OPENSSL_64_BIT)
  139. #if !defined(_MSC_VER)
  140. /* MSVC doesn't support two-word integers on 64-bit. */
  141. #define BN_ULLONG uint128_t
  142. #endif
  143. #define BN_BITS2 64
  144. #define BN_BYTES 8
  145. #define BN_BITS4 32
  146. #define BN_MASK2 (0xffffffffffffffffUL)
  147. #define BN_MASK2l (0xffffffffUL)
  148. #define BN_MASK2h (0xffffffff00000000UL)
  149. #define BN_MASK2h1 (0xffffffff80000000UL)
  150. #define BN_MONT_CTX_N0_LIMBS 1
  151. #define BN_TBIT (0x8000000000000000UL)
  152. #define BN_DEC_CONV (10000000000000000000UL)
  153. #define BN_DEC_NUM 19
  154. #define TOBN(hi, lo) ((BN_ULONG)(hi) << 32 | (lo))
  155. #elif defined(OPENSSL_32_BIT)
  156. #define BN_ULLONG uint64_t
  157. #define BN_BITS2 32
  158. #define BN_BYTES 4
  159. #define BN_BITS4 16
  160. #define BN_MASK2 (0xffffffffUL)
  161. #define BN_MASK2l (0xffffUL)
  162. #define BN_MASK2h1 (0xffff8000UL)
  163. #define BN_MASK2h (0xffff0000UL)
  164. /* On some 32-bit platforms, Montgomery multiplication is done using 64-bit
  165. * arithmetic with SIMD instructions. On such platforms, |BN_MONT_CTX::n0|
  166. * needs to be two words long. Only certain 32-bit platforms actually make use
  167. * of n0[1] and shorter R value would suffice for the others. However,
  168. * currently only the assembly files know which is which. */
  169. #define BN_MONT_CTX_N0_LIMBS 2
  170. #define BN_TBIT (0x80000000UL)
  171. #define BN_DEC_CONV (1000000000UL)
  172. #define BN_DEC_NUM 9
  173. #define TOBN(hi, lo) (lo), (hi)
  174. #else
  175. #error "Must define either OPENSSL_32_BIT or OPENSSL_64_BIT"
  176. #endif
  177. #define STATIC_BIGNUM(x) \
  178. { \
  179. (BN_ULONG *)(x), sizeof(x) / sizeof(BN_ULONG), \
  180. sizeof(x) / sizeof(BN_ULONG), 0, BN_FLG_STATIC_DATA \
  181. }
  182. #if defined(BN_ULLONG)
  183. #define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
  184. #define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
  185. #endif
  186. /* bn_set_words sets |bn| to the value encoded in the |num| words in |words|,
  187. * least significant word first. */
  188. int bn_set_words(BIGNUM *bn, const BN_ULONG *words, size_t num);
  189. BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
  190. BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
  191. void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
  192. BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
  193. BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
  194. void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
  195. void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
  196. void bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a);
  197. void bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a);
  198. /* bn_cmp_words returns a value less than, equal to or greater than zero if
  199. * the, length |n|, array |a| is less than, equal to or greater than |b|. */
  200. int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n);
  201. /* bn_cmp_words returns a value less than, equal to or greater than zero if the
  202. * array |a| is less than, equal to or greater than |b|. The arrays can be of
  203. * different lengths: |cl| gives the minimum of the two lengths and |dl| gives
  204. * the length of |a| minus the length of |b|. */
  205. int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl);
  206. int bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
  207. const BN_ULONG *np, const BN_ULONG *n0, int num);
  208. uint64_t bn_mont_n0(const BIGNUM *n);
  209. int bn_mod_exp_base_2_vartime(BIGNUM *r, unsigned p, const BIGNUM *n);
  210. #if defined(OPENSSL_X86_64) && defined(_MSC_VER)
  211. #define BN_UMULT_LOHI(low, high, a, b) ((low) = _umul128((a), (b), &(high)))
  212. #endif
  213. #if !defined(BN_ULLONG) && !defined(BN_UMULT_LOHI)
  214. #error "Either BN_ULLONG or BN_UMULT_LOHI must be defined on every platform."
  215. #endif
  216. /* bn_mod_inverse_prime sets |out| to the modular inverse of |a| modulo |p|,
  217. * computed with Fermat's Little Theorem. It returns one on success and zero on
  218. * error. If |mont_p| is NULL, one will be computed temporarily. */
  219. int bn_mod_inverse_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
  220. BN_CTX *ctx, const BN_MONT_CTX *mont_p);
  221. /* bn_mod_inverse_secret_prime behaves like |bn_mod_inverse_prime| but uses
  222. * |BN_mod_exp_mont_consttime| instead of |BN_mod_exp_mont| in hopes of
  223. * protecting the exponent. */
  224. int bn_mod_inverse_secret_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
  225. BN_CTX *ctx, const BN_MONT_CTX *mont_p);
  226. #if defined(__cplusplus)
  227. } /* extern C */
  228. #endif
  229. #endif /* OPENSSL_HEADER_BN_INTERNAL_H */