diff options
Diffstat (limited to 'src/libs/3rdparty/botan/src/lib/math/mp/mp_core.h')
| -rw-r--r-- | src/libs/3rdparty/botan/src/lib/math/mp/mp_core.h | 209 |
1 files changed, 0 insertions, 209 deletions
diff --git a/src/libs/3rdparty/botan/src/lib/math/mp/mp_core.h b/src/libs/3rdparty/botan/src/lib/math/mp/mp_core.h deleted file mode 100644 index 9430c3753f..0000000000 --- a/src/libs/3rdparty/botan/src/lib/math/mp/mp_core.h +++ /dev/null @@ -1,209 +0,0 @@ -/* -* MPI Algorithms -* (C) 1999-2010 Jack Lloyd -* 2006 Luca Piccarreta -* 2016 Matthias Gierlings -* -* Botan is released under the Simplified BSD License (see license.txt) -*/ - -#ifndef BOTAN_MP_CORE_OPS_H_ -#define BOTAN_MP_CORE_OPS_H_ - -#include <botan/types.h> - -namespace Botan { - -const word MP_WORD_MASK = ~static_cast<word>(0); -const word MP_WORD_TOP_BIT = static_cast<word>(1) << (8*sizeof(word) - 1); -const word MP_WORD_MAX = MP_WORD_MASK; - -/* -* If cond == 0, does nothing. -* If cond > 0, swaps x[0:size] with y[0:size] -* Runs in constant time -*/ -BOTAN_TEST_API -void bigint_cnd_swap(word cnd, word x[], word y[], size_t size); - -/* -* If cond > 0 adds x[0:size] and y[0:size] and returns carry -* Runs in constant time -*/ -BOTAN_TEST_API -word bigint_cnd_add(word cnd, word x[], const word y[], size_t size); - -/* -* If cond > 0 subtracts x[0:size] and y[0:size] and returns borrow -* Runs in constant time -*/ -BOTAN_TEST_API -word bigint_cnd_sub(word cnd, word x[], const word y[], size_t size); - -/* -* Equivalent to -* bigint_cnd_add( mask, x, y, size); -* bigint_cnd_sub(~mask, x, y, size); -* -* Mask must be either 0 or all 1 bits -*/ -void bigint_cnd_addsub(word mask, word x[], const word y[], size_t size); - -/* -* 2s complement absolute value -* If cond > 0 sets x to ~x + 1 -* Runs in constant time -*/ -BOTAN_TEST_API -void bigint_cnd_abs(word cnd, word x[], size_t size); - -/** -* Two operand addition -* @param x the first operand (and output) -* @param x_size size of x -* @param y the second operand -* @param y_size size of y (must be >= x_size) -*/ -void bigint_add2(word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Three operand addition -*/ -void bigint_add3(word z[], - const word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Two operand addition with carry out -*/ -word bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size); - -/** -* Three operand addition with carry out -*/ -word bigint_add3_nc(word z[], - const word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Two operand subtraction -*/ -word bigint_sub2(word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Two operand subtraction, x = y - x; assumes y >= x -*/ -void bigint_sub2_rev(word x[], const word y[], size_t y_size); - -/** -* Three operand subtraction -*/ -word bigint_sub3(word z[], - const word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Return abs(x-y), ie if x >= y, then compute z = x - y -* Otherwise compute z = y - x -* No borrow is possible since the result is always >= 0 -* -* Returns 1 if x >= y or 0 if x < y -* @param z output array of at least N words -* @param x input array of N words -* @param y input array of N words -* @param N length of x and y -* @param ws array of at least 2*N words -*/ -word bigint_sub_abs(word z[], - const word x[], const word y[], size_t N, - word ws[]); - -/* -* Shift Operations -*/ -void bigint_shl1(word x[], size_t x_size, - size_t word_shift, size_t bit_shift); - -void bigint_shr1(word x[], size_t x_size, - size_t word_shift, size_t bit_shift); - -void bigint_shl2(word y[], const word x[], size_t x_size, - size_t word_shift, size_t bit_shift); - -void bigint_shr2(word y[], const word x[], size_t x_size, - size_t word_shift, size_t bit_shift); - -/* -* Linear Multiply -*/ -void bigint_linmul2(word x[], size_t x_size, word y); -void bigint_linmul3(word z[], const word x[], size_t x_size, word y); - -/** -* Montgomery Reduction -* @param z integer to reduce, of size exactly 2*(p_size+1). - Output is in the first p_size+1 words, higher - words are set to zero. -* @param p modulus -* @param p_size size of p -* @param p_dash Montgomery value -* @param workspace array of at least 2*(p_size+1) words -* @param ws_size size of workspace in words -*/ -void bigint_monty_redc(word z[], - const word p[], size_t p_size, - word p_dash, - word workspace[], - size_t ws_size); - -/** -* Compare x and y returning early -*/ -int32_t bigint_cmp(const word x[], size_t x_size, - const word y[], size_t y_size); - -/** -* Compute ((n1<<bits) + n0) / d -*/ -word bigint_divop(word n1, word n0, word d); - -/** -* Compute ((n1<<bits) + n0) % d -*/ -word bigint_modop(word n1, word n0, word d); - -/* -* Comba Multiplication / Squaring -*/ -void bigint_comba_mul4(word z[8], const word x[4], const word y[4]); -void bigint_comba_mul6(word z[12], const word x[6], const word y[6]); -void bigint_comba_mul8(word z[16], const word x[8], const word y[8]); -void bigint_comba_mul9(word z[18], const word x[9], const word y[9]); -void bigint_comba_mul16(word z[32], const word x[16], const word y[16]); -void bigint_comba_mul24(word z[48], const word x[24], const word y[24]); - -void bigint_comba_sqr4(word out[8], const word in[4]); -void bigint_comba_sqr6(word out[12], const word in[6]); -void bigint_comba_sqr8(word out[16], const word in[8]); -void bigint_comba_sqr9(word out[18], const word in[9]); -void bigint_comba_sqr16(word out[32], const word in[16]); -void bigint_comba_sqr24(word out[48], const word in[24]); - -/* -* High Level Multiplication/Squaring Interfaces -*/ - -void bigint_mul(word z[], size_t z_size, - const word x[], size_t x_size, size_t x_sw, - const word y[], size_t y_size, size_t y_sw, - word workspace[], size_t ws_size); - -void bigint_sqr(word z[], size_t z_size, - const word x[], size_t x_size, size_t x_sw, - word workspace[], size_t ws_size); - -} - -#endif |