1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243/****************************************************************************
* include/crypto/bn.h
*
* SPDX-License-Identifier: Unlicense
*
* This is free and unencumbered software released into the public domain.
* Anyone is free to copy, modify, publish, use, compile, sell, or
* distribute this software, either in source code form or as a compiled
* binary, for any purpose, commercial or non-commercial, and by any
* means.
* In jurisdictions that recognize copyright laws, the author or authors
* of this software dedicate any and all copyright interest in the
* software to the public domain. We make this dedication for the benefit
* of the public at large and to the detriment of our heirs and
* successors. We intend this dedication to be an overt act of
* relinquishment in perpetuity of all present and future rights to this
* software under copyright law.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
* For more information, please refer to <https://unlicense.org>
****************************************************************************/
#ifndef __INCLUDE_CRYPTO_BIGNUM_H
#define __INCLUDE_CRYPTO_BIGNUM_H
/* Big number library - arithmetic on multiple-precision unsigned integers.
*
* This library is an implementation of arithmetic on arbitrarily large
* integers.
*
* The difference between this and other implementations, is that the data
* structure
* has optimal memory utilization (i.e. a 1024 bit integer takes up 128 bytes
* RAM),
* and all memory is allocated statically: no dynamic allocation for better
* or worse.
*
* Primary goals are correctness, clarity of code and clean, portable
* implementation.
* Secondary goal is a memory footprint small enough to make it suitable for
* use in
* embedded applications.
*
*
* The current state is correct functionality and adequate performance.
* There may well be room for performance-optimizations and improvements.
*/
/****************************************************************************
* Included Files
****************************************************************************/
#include <stdint.h>
/****************************************************************************
* Pre-processor Definitions
****************************************************************************/
/* This macro defines the word size in bytes of the array that constitutes
* the big-number data structure.
*/
#define WORD_SIZE 1
/* Size of big-numbers in bytes */
#define BN_ARRAY_SIZE (512 / WORD_SIZE)
/* Data type of array in structure */
#define DTYPE uint8_t
/* Data-type larger than DTYPE, for holding intermediate results of
* calculations
*/
#define DTYPE_TMP uint32_t
/* bitmask for getting MSB */
#define DTYPE_MSB ((DTYPE_TMP)(0x80))
/* sprintf format string */
#define SPRINTF_FORMAT_STR "%.02x"
#define SSCANF_FORMAT_STR "%2hhx"
/* Max value of integer type */
#define MAX_VAL ((DTYPE_TMP)0xFF)
/****************************************************************************
* Public Types
****************************************************************************/
/* Data-holding structure: array of DTYPEs */
struct bn
{
/* Sign: -1 if the bignum is negative, 1 otherwise. */
int s;
DTYPE array[BN_ARRAY_SIZE];
};
/* Tokens returned by bignum_cmp() for value comparison */
enum
{
SMALLER = -1,
EQUAL = 0,
LARGER = 1
};
/****************************************************************************
* Public Functions Prototype
****************************************************************************/
/* Initialization functions: */
void bignum_init(FAR struct bn *n);
void bignum_from_int(FAR struct bn *n, DTYPE_TMP i);
int bignum_to_int(FAR struct bn *n);
void bignum_from_string(FAR struct bn *n, FAR char *str, int nbytes);
void bignum_to_string(FAR struct bn *n, FAR char *str, int maxsize);
/* Basic arithmetic operations: */
/* c = a + b */
void bignum_add(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = |a| + |b| */
void bignum_add_abs(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a - b */
void bignum_sub(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = |a| - |b| */
void bignum_sub_abs(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a * b */
void bignum_mul(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a / b */
void bignum_div(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a % b */
void bignum_mod(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a / b, d = a % b */
void bignum_divmod(FAR struct bn *a, FAR struct bn *b,
FAR struct bn *c, FAR struct bn *d);
/* Bitwise operations: */
/* c = a & b */
void bignum_and(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a | b */
void bignum_or(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* c = a ^ b */
void bignum_xor(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* b = a << nbits */
void bignum_lshift(FAR struct bn *a, FAR struct bn *b, int nbits);
/* b = a >> nbits */
void bignum_rshift(FAR struct bn *a, FAR struct bn *b, int nbits);
/* Special operators and comparison */
/* Compare: returns LARGER, EQUAL or SMALLER */
int bignum_cmp(FAR struct bn *a, FAR struct bn *b);
/* Compare |A| and |B| */
int bignum_cmp_abs(FAR struct bn *a, FAR struct bn *b);
/* For comparison with zero */
int bignum_is_zero(FAR struct bn *n);
/* Increment: add one to n */
void bignum_inc(FAR struct bn *n);
/* Decrement: subtract one from n */
void bignum_dec(FAR struct bn *n);
/* Calculate a^b -- e.g. 2^10 => 1024 */
void bignum_pow(FAR struct bn *a, FAR struct bn *b, FAR struct bn *c);
/* Integer square root -- e.g. isqrt(5) => 2 */
void bignum_isqrt(FAR struct bn *a, FAR struct bn *b);
/* Copy src into dst -- dst := src */
void bignum_assign(FAR struct bn *dst, FAR struct bn *src);
/* CRK_EXP_MOD algorithm */
void pow_mod_faster(FAR struct bn *a, FAR struct bn *b,
FAR struct bn *n, FAR struct bn *res);
/* Return the number of less significant zero-bits */
int bignum_lsb(FAR struct bn *a);
/* g = gcd(a, b) */
void bignum_gcd(FAR struct bn *a, FAR struct bn *b, FAR struct bn *g);
/* Modular inverse: c = a^-1 mod n */
int bignum_inv_mod(FAR struct bn *a, FAR struct bn *n, FAR struct bn *c);
#endif /* __INCLUDE_CRYPTO_BIGNUM_H */