Mercurial > projects > hoofbaby

comparison deps/Platinum/ThirdParty/Neptune/ThirdParty/axTLS/crypto/bigint_impl.h @ 0:3425707ddbf6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial import (hopefully this mercurial stuff works...)
author fraserofthenight
date Mon, 06 Jul 2009 08:06:28 -0700
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:3425707ddbf6
1 /*
2 * Copyright (c) 2007, Cameron Rich
3 *
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * * Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 * * Neither the name of the axTLS project nor the names of its contributors
15 * may be used to endorse or promote products derived from this software
16 * without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
22 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
25 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
26 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
27 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
31 #ifndef BIGINT_IMPL_HEADER
32 #define BIGINT_IMPL_HEADER
33
34 /* Maintain a number of precomputed variables when doing reduction */
35 #define BIGINT_M_OFFSET 0 /**< Normal modulo offset. */
36 #ifdef CONFIG_BIGINT_CRT
37 #define BIGINT_P_OFFSET 1 /**< p modulo offset. */
38 #define BIGINT_Q_OFFSET 2 /**< q module offset. */
39 #define BIGINT_NUM_MODS 3 /**< The number of modulus constants used. */
40 #else
41 #define BIGINT_NUM_MODS 1
42 #endif
43
44 /* Architecture specific functions for big ints */
45 #ifdef WIN32
46 #define COMP_RADIX 4294967296i64
47 #define COMP_MAX 0xFFFFFFFFFFFFFFFFui64
48 #else
49 #define COMP_RADIX 4294967296ULL /**< Max component + 1 */
50 #define COMP_MAX 0xFFFFFFFFFFFFFFFFULL/**< (Max dbl comp -1) */
51 #endif
52 #define COMP_BIT_SIZE 32 /**< Number of bits in a component. */
53 #define COMP_BYTE_SIZE 4 /**< Number of bytes in a component. */
54 #define COMP_NUM_NIBBLES 8 /**< Used For diagnostics only. */
55
56 typedef uint32_t comp; /**< A single precision component. */
57 typedef uint64_t long_comp; /**< A double precision component. */
58 typedef int64_t slong_comp; /**< A signed double precision component. */
59
60 /**
61 * @struct _bigint
62 * @brief A big integer basic object
63 */
64 struct _bigint
65 {
66 struct _bigint* next; /**< The next bigint in the cache. */
67 short size; /**< The number of components in this bigint. */
68 short max_comps; /**< The heapsize allocated for this bigint */
69 int refs; /**< An internal reference count. */
70 comp* comps; /**< A ptr to the actual component data */
71 };
72
73 typedef struct _bigint bigint; /**< An alias for _bigint */
74
75 /**
76 * Maintains the state of the cache, and a number of variables used in
77 * reduction.
78 */
79 typedef struct /**< A big integer "session" context. */
80 {
81 bigint *active_list; /**< Bigints currently used. */
82 bigint *free_list; /**< Bigints not used. */
83 bigint *bi_radix; /**< The radix used. */
84 bigint *bi_mod[BIGINT_NUM_MODS]; /**< modulus */
85
86 #if defined(CONFIG_BIGINT_MONTGOMERY)
87 bigint *bi_RR_mod_m[BIGINT_NUM_MODS]; /**< R^2 mod m */
88 bigint *bi_R_mod_m[BIGINT_NUM_MODS]; /**< R mod m */
89 comp N0_dash[BIGINT_NUM_MODS];
90 #elif defined(CONFIG_BIGINT_BARRETT)
91 bigint *bi_mu[BIGINT_NUM_MODS]; /**< Storage for mu */
92 #endif
93 bigint *bi_normalised_mod[BIGINT_NUM_MODS]; /**< Normalised mod storage. */
94 bigint **g; /**< Used by sliding-window. */
95 int window; /**< The size of the sliding window */
96 int active_count; /**< Number of active bigints. */
97 int free_count; /**< Number of free bigints. */
98
99 #ifdef CONFIG_BIGINT_MONTGOMERY
100 uint8_t use_classical; /**< Use classical reduction. */
101 #endif
102 uint8_t mod_offset; /**< The mod offset we are using */
103 } BI_CTX;
104
105 #ifndef WIN32
106 #define max(a,b) ((a)>(b)?(a):(b)) /**< Find the maximum of 2 numbers. */
107 #define min(a,b) ((a)<(b)?(a):(b)) /**< Find the minimum of 2 numbers. */
108 #endif
109
110 #define PERMANENT 0x7FFF55AA /**< A magic number for permanents. */
111
112 #endif