Debian Codegraph @

crypto_kem/8192128pcf/vec/decrypt.c

raw
1 /*
2 This file is for Niederreiter decryption
3 */
4 // 20240805 djb: more cryptoint usage
5 // 20240503 djb: remove #ifdef KAT ... #endif
6 // 20221230 djb: add linker lines
7
8 // linker define decrypt
9 // linker use benes bm fft fft_tr
10 // linker use vec_mul vec_sq vec_inv
11
12 #include "decrypt.h"
13
14 #include "params.h"
15 #include "fft_tr.h"
16 #include "benes.h"
17 #include "util.h"
18 #include "fft.h"
19 #include "vec.h"
20 #include "bm.h"
21
22 #include "crypto_int16.h"
23 #include "crypto_int64.h"
24
25 static void scaling(vec out[][GFBITS], vec inv[][GFBITS], const unsigned char *sk, vec *recv)
26 {
27 int i, j;
28
29 vec irr_int[2][ GFBITS ];
30 vec eval[128][ GFBITS ];
31 vec tmp[ GFBITS ];
32
33 //
34
35 irr_load(irr_int, sk);
36
37 fft(eval, irr_int);
38
39 for (i = 0; i < 128; i++)
40 vec_sq(eval[i], eval[i]);
41
42 vec_copy(inv[0], eval[0]);
43
44 for (i = 1; i < 128; i++)
45 vec_mul(inv[i], inv[i-1], eval[i]);
46
47 vec_inv(tmp, inv[127]);
48
49 for (i = 126; i >= 0; i--)
50 {
51 vec_mul(inv[i+1], tmp, inv[i]);
52 vec_mul(tmp, tmp, eval[i+1]);
53 }
54
55 vec_copy(inv[0], tmp);
56
57 //
58
59 for (i = 0; i < 128; i++)
60 for (j = 0; j < GFBITS; j++)
61 out[i][j] = inv[i][j] & recv[i];
62 }
63
64 static void scaling_inv(vec out[][GFBITS], vec inv[][GFBITS], vec *recv)
65 {
66 int i, j;
67
68 for (i = 0; i < 128; i++)
69 for (j = 0; j < GFBITS; j++)
70 out[i][j] = inv[i][j] & recv[i];
71 }
72
73 static void preprocess(vec *recv, const unsigned char *s)
74 {
75 int i;
76
77 recv[0] = 0;
78
79 for (i = 1; i < 128; i++)
80 recv[i] = recv[0];
81
82 for (i = 0; i < SYND_BYTES/8; i++)
83 recv[i] = load8(s + i*8);
84 }
85
86 static int weight(vec *v)
87 {
88 int i, w = 0;
89
90 for (i = 0; i < SYS_N; i++)
91 w += crypto_int64_bitmod_01(v[i/64], i);
92
93 return w;
94 }
95
96 static uint16_t synd_cmp(vec s0[][ GFBITS ] , vec s1[][ GFBITS ])
97 {
98 int i, j;
99 vec diff = 0;
100
101 for (i = 0; i < 4; i++)
102 for (j = 0; j < GFBITS; j++)
103 diff |= (s0[i][j] ^ s1[i][j]);
104
105 return vec_testz(diff);
106 }
107
108 /* Niederreiter decryption with the Berlekamp decoder */
109 /* intput: sk, secret key */
110 /* s, ciphertext (syndrome) */
111 /* output: e, error vector */
112 /* return: 0 for success; 1 for failure */
113 int decrypt(unsigned char *e, const unsigned char *sk, const unsigned char *s)
114 {
115 int i;
116
117 uint16_t check_synd;
118 uint16_t check_weight;
119
120 vec inv[ 128 ][ GFBITS ];
121 vec scaled[ 128 ][ GFBITS ];
122 vec eval[ 128 ][ GFBITS ];
123
124 vec error[ 128 ];
125
126 vec s_priv[ 4 ][ GFBITS ];
127 vec s_priv_cmp[ 4 ][ GFBITS ];
128 vec locator[2][ GFBITS ];
129
130 vec recv[ 128 ];
131 vec allone;
132
133 // Berlekamp decoder
134
135 preprocess(recv, s);
136
137 benes(recv, sk + IRR_BYTES, 1);
138 scaling(scaled, inv, sk, recv);
139 fft_tr(s_priv, scaled);
140 bm(locator, s_priv);
141
142 fft(eval, locator);
143
144 // reencryption and weight check
145
146 allone = vec_setbits(1);
147
148 for (i = 0; i < 128; i++)
149 {
150 error[i] = vec_or_reduce(eval[i]);
151 error[i] ^= allone;
152 }
153
154 check_weight = weight(error) ^ SYS_T;
155 check_weight = crypto_int16_zero_01(check_weight);
156
157 scaling_inv(scaled, inv, error);
158 fft_tr(s_priv_cmp, scaled);
159
160 check_synd = synd_cmp(s_priv, s_priv_cmp);
161
162 //
163
164 benes(error, sk + IRR_BYTES, 0);
165
166 for (i = 0; i < 128; i++)
167 store8(e + i*8, error[i]);
168
169 return 1 - (check_synd & check_weight);
170 }
171