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
|
#include "bn.h"
bn_err bn_init(bn_t *bn) {
return mp_init(bn);
}
void bn_copy(bn_t *from, bn_t *to) {
mp_copy(from, to);
}
void bn_clear(bn_t *bn) {
mp_clear(bn);
}
int bn_from_bin(const uint8_t *data, size_t size, bn_t *out) {
return mp_from_ubin(out, data, size);
}
int bn_from_hex(const char *data, bn_t *out) {
return mp_read_radix(out, data, 16);
}
int bn_from_int(uint64_t value, bn_t *out) {
mp_set_u64(out, value);
return MP_OKAY;
}
void bn_to_binpad(const bn_t *one, uint8_t *data, size_t size) {
size_t ubin_size = mp_ubin_size(one);
size_t offset = size - ubin_size;
mp_to_ubin(one, data + offset, ubin_size, NULL);
}
void bn_to_bin(const bn_t *one, uint8_t *data) {
mp_to_ubin(one, data, mp_ubin_size(one), NULL);
}
size_t bn_to_bin_size(const bn_t *one) {
return mp_ubin_size(one);
}
void bn_mod_add(bn_t *one, bn_t *other, bn_t *mod, bn_t *out) {
mp_addmod(one, other, mod, out);
}
void bn_mod_sub(bn_t *one, bn_t *other, bn_t *mod, bn_t *out) {
mp_submod(one, other, mod, out);
}
void bn_mod_mul(bn_t *one, bn_t *other, bn_t *mod, bn_t *out) {
mp_mulmod(one, other, mod, out);
}
void bn_mod_sqr(bn_t *one, bn_t *mod, bn_t *out) {
mp_sqrmod(one, mod, out);
}
void bn_mod_div(bn_t *one, bn_t *other, bn_t *mod, bn_t *out) {
bn_t inv;
mp_init(&inv);
mp_invmod(other, mod, &inv);
mp_mulmod(one, &inv, mod, out);
mp_clear(&inv);
}
void bn_mod_inv(bn_t *one, bn_t *mod, bn_t *out) {
mp_invmod(one, mod, out);
}
int bn_get_bit(bn_t *bn, int which) {
int which_digit = which / (sizeof(mp_digit) * 8);
int which_bit = which % (sizeof(mp_digit) * 8);
if (bn->used <= which_digit) {
return 0;
}
return (bn->dp[which_digit] >> which_bit) & 1;
}
int bn_bit_length(bn_t *bn) {
return mp_count_bits(bn);
}
|
