113 lines
4.7 KiB
C
113 lines
4.7 KiB
C
|
/*
|
||
|
|
* Copyright (c) 2007, Cameron Rich
|
||
|
|
*
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions are met:
|
||
|
|
*
|
||
|
|
* * Redistributions of source code must retain the above copyright notice,
|
||
|
|
* this list of conditions and the following disclaimer.
|
||
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
||
|
|
* this list of conditions and the following disclaimer in the documentation
|
||
|
|
* and/or other materials provided with the distribution.
|
||
|
|
* * Neither the name of the axTLS project nor the names of its contributors
|
||
|
|
* may be used to endorse or promote products derived from this software
|
||
|
|
* without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
||
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
||
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
||
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
||
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef BIGINT_IMPL_HEADER
|
||
|
|
#define BIGINT_IMPL_HEADER
|
||
|
|
|
||
|
|
/* Maintain a number of precomputed variables when doing reduction */
|
||
|
|
#define BIGINT_M_OFFSET 0 /**< Normal modulo offset. */
|
||
|
|
#ifdef CONFIG_BIGINT_CRT
|
||
|
|
#define BIGINT_P_OFFSET 1 /**< p modulo offset. */
|
||
|
|
#define BIGINT_Q_OFFSET 2 /**< q module offset. */
|
||
|
|
#define BIGINT_NUM_MODS 3 /**< The number of modulus constants used. */
|
||
|
|
#else
|
||
|
|
#define BIGINT_NUM_MODS 1
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/* Architecture specific functions for big ints */
|
||
|
|
#ifdef WIN32
|
||
|
|
#define COMP_RADIX 4294967296i64
|
||
|
|
#define COMP_MAX 0xFFFFFFFFFFFFFFFFui64
|
||
|
|
#else
|
||
|
|
#define COMP_RADIX 4294967296ULL /**< Max component + 1 */
|
||
|
|
#define COMP_MAX 0xFFFFFFFFFFFFFFFFULL/**< (Max dbl comp -1) */
|
||
|
|
#endif
|
||
|
|
#define COMP_BIT_SIZE 32 /**< Number of bits in a component. */
|
||
|
|
#define COMP_BYTE_SIZE 4 /**< Number of bytes in a component. */
|
||
|
|
#define COMP_NUM_NIBBLES 8 /**< Used For diagnostics only. */
|
||
|
|
|
||
|
|
typedef uint32_t comp; /**< A single precision component. */
|
||
|
|
typedef uint64_t long_comp; /**< A double precision component. */
|
||
|
|
typedef int64_t slong_comp; /**< A signed double precision component. */
|
||
|
|
|
||
|
|
/**
|
||
|
|
* @struct _bigint
|
||
|
|
* @brief A big integer basic object
|
||
|
|
*/
|
||
|
|
struct _bigint
|
||
|
|
{
|
||
|
|
struct _bigint* next; /**< The next bigint in the cache. */
|
||
|
|
short size; /**< The number of components in this bigint. */
|
||
|
|
short max_comps; /**< The heapsize allocated for this bigint */
|
||
|
|
int refs; /**< An internal reference count. */
|
||
|
|
comp* comps; /**< A ptr to the actual component data */
|
||
|
|
};
|
||
|
|
|
||
|
|
typedef struct _bigint bigint; /**< An alias for _bigint */
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Maintains the state of the cache, and a number of variables used in
|
||
|
|
* reduction.
|
||
|
|
*/
|
||
|
|
typedef struct /**< A big integer "session" context. */
|
||
|
|
{
|
||
|
|
bigint *active_list; /**< Bigints currently used. */
|
||
|
|
bigint *free_list; /**< Bigints not used. */
|
||
|
|
bigint *bi_radix; /**< The radix used. */
|
||
|
|
bigint *bi_mod[BIGINT_NUM_MODS]; /**< modulus */
|
||
|
|
|
||
|
|
#if defined(CONFIG_BIGINT_MONTGOMERY)
|
||
|
|
bigint *bi_RR_mod_m[BIGINT_NUM_MODS]; /**< R^2 mod m */
|
||
|
|
bigint *bi_R_mod_m[BIGINT_NUM_MODS]; /**< R mod m */
|
||
|
|
comp N0_dash[BIGINT_NUM_MODS];
|
||
|
|
#elif defined(CONFIG_BIGINT_BARRETT)
|
||
|
|
bigint *bi_mu[BIGINT_NUM_MODS]; /**< Storage for mu */
|
||
|
|
#endif
|
||
|
|
bigint *bi_normalised_mod[BIGINT_NUM_MODS]; /**< Normalised mod storage. */
|
||
|
|
bigint **g; /**< Used by sliding-window. */
|
||
|
|
int window; /**< The size of the sliding window */
|
||
|
|
int active_count; /**< Number of active bigints. */
|
||
|
|
int free_count; /**< Number of free bigints. */
|
||
|
|
|
||
|
|
#ifdef CONFIG_BIGINT_MONTGOMERY
|
||
|
|
uint8_t use_classical; /**< Use classical reduction. */
|
||
|
|
#endif
|
||
|
|
uint8_t mod_offset; /**< The mod offset we are using */
|
||
|
|
} BI_CTX;
|
||
|
|
|
||
|
|
#ifndef WIN32
|
||
|
|
#define max(a,b) ((a)>(b)?(a):(b)) /**< Find the maximum of 2 numbers. */
|
||
|
|
#define min(a,b) ((a)<(b)?(a):(b)) /**< Find the minimum of 2 numbers. */
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define PERMANENT 0x7FFF55AA /**< A magic number for permanents. */
|
||
|
|
|
||
|
|
#endif
|