blob: e764568826fccb0f8dbab7b3e3c56e3325efe941 (
plain) (
blame)
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
|
#include <stdint.h>
#include "kyber512r3_params.h"
#include "kyber512r3_reduce.h"
#if S2N_ANY_NONPORTABLE_OPTIMIZATIONS_ENABLED
#error "Compiling portable code with non-portable assembly optimizations is not allowed"
#endif
/*************************************************
* Name: montgomery_reduce
*
* Description: Montgomery reduction; given a 32-bit integer a, computes
* 16-bit integer congruent to a * R^-1 mod q,
* where R=2^16
*
* Arguments: - int32_t a: input integer to be reduced;
* has to be in {-q2^15,...,q2^15-1}
*
* Returns: integer in {-q+1,...,q-1} congruent to a * R^-1 modulo q.
**************************************************/
int16_t montgomery_reduce(int32_t a) {
int32_t t;
int16_t u;
u = a * S2N_KYBER_512_R3_QINV;
t = (int32_t)u * S2N_KYBER_512_R3_Q;
t = a - t;
t >>= 16;
return t;
}
/*************************************************
* Name: barrett_reduce
*
* Description: Barrett reduction; given a 16-bit integer a, computes
* 16-bit integer congruent to a mod q in {0,...,q}
*
* Arguments: - int16_t a: input integer to be reduced
*
* Returns: integer in {0,...,q} congruent to a modulo q.
**************************************************/
int16_t barrett_reduce(int16_t a) {
int16_t t;
const int16_t v = ((1U << 26) + S2N_KYBER_512_R3_Q / 2) / S2N_KYBER_512_R3_Q;
t = (int32_t)v * a >> 26;
t *= S2N_KYBER_512_R3_Q;
return a - t;
}
/*************************************************
* Name: csubq
*
* Description: Conditionallly subtract q
*
* Arguments: - int16_t x: input integer
*
* Returns: a - q if a >= q, else a
**************************************************/
int16_t csubq(int16_t a) {
a -= S2N_KYBER_512_R3_Q;
a += (a >> 15) & S2N_KYBER_512_R3_Q;
return a;
}
|
