aboutsummaryrefslogtreecommitdiffstats
path: root/src/test/test.c
blob: 90411ebb076c20d78016851114327454a775a5d3 (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
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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
/**
 * libkeccak – Keccak-family hashing library
 * 
 * Copyright © 2014  Mattias Andrée (maandree@member.fsf.org)
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
#include <libkeccak.h>

#include <stdio.h>
#include <string.h>


/**
 * Test functions in <libkeccak/hex.h>
 * 
 * @return  Zero on success, -1 on error
 */
static int test_hex(void)
{
  const unsigned char bindata[] = {0x04, 0x2F, 0x12, 0x83, 0xFF, 0x80, 0xA3, 0x00};
  const char hexdata_upper[] = "042F1283FF80A300";
  const char hexdata_lower[] = "042f1283ff80a300";
  char hextest[2 * 8 + 1];
  
  printf("Testing libkeccak_behex_lower: ");
  libkeccak_behex_lower(hextest, (const char*)bindata, 8);
  if (!strcmp(hextest, hexdata_lower))
    printf("OK\n");
  else
    return printf("Fail\n"), -1;
  
  printf("Testing libkeccak_behex_upper: ");
  libkeccak_behex_upper(hextest, (const char*)bindata, 8);
  if (!strcmp(hextest, hexdata_upper))
    printf("OK\n");
  else
    return printf("Fail\n"), -1;
  
  printf("Testing libkeccak_unhex on uppercase: ");
  libkeccak_unhex(hextest, hexdata_upper);
  if (!memcmp(bindata, hextest, 8 * sizeof(char)))
    printf("OK\n");
  else
    return printf("Fail\n"), -1;
  
  printf("Testing libkeccak_unhex on lowercase: ");
  libkeccak_unhex(hextest, hexdata_lower);
  if (!memcmp(bindata, hextest, 8 * sizeof(char)))
    printf("OK\n");
  else
    return printf("Fail\n"), -1;
  
  printf("\n");
  return 0;
}


/**
 * Test functions in <libkeccak/state.h>
 * 
 * @param   spec  The specifications for the state
 * @return        Zero on success, -1 on error
 */
static int test_state(libkeccak_spec_t* restrict spec)
{
  libkeccak_state_t* restrict state;
  libkeccak_state_t* restrict state2;
  size_t marshal_size, marshalled_size, i, n;
  char* restrict marshalled_data;
  
  if (state = libkeccak_state_create(spec), state == NULL)
    return perror("libkeccak_state_initialise"), -1;
  
  n = state->mlen / 2;
  for (i = 0; i < n; i++)
    state->M[state->mptr++] = (char)(i & 255);
  
  if (state2 = libkeccak_state_duplicate(state), state2 == NULL)
    return perror("libkeccak_state_duplicate"), -1;
  
  if (state->M[state->mptr - 1] != state2->M[state2->mptr - 1])
    return printf("Inconsistency found between original state and duplicate state.\n"), -1;
  
  marshal_size = libkeccak_state_marshal_size(state2);
  if (marshalled_data = malloc(marshal_size), marshalled_data == NULL)
    return perror("malloc"), -1;
  
  marshalled_size = libkeccak_state_marshal(state2, marshalled_data);
  if (marshalled_size != marshal_size)
    return printf("libkeccak_state_marshal returned an unexpected value.\n"), -1;
  
  libkeccak_state_free(state);
  
  if (state = malloc(sizeof(libkeccak_state_t)), state == NULL)
    return perror("malloc"), -1;
  marshalled_size = libkeccak_state_unmarshal(state, marshalled_data);
  if (marshalled_size == 0)
    return perror("libkeccak_state_unmarshal"), -1;
  if (marshalled_size != marshal_size)
    return printf("libkeccak_state_unmarshal returned an unexpected value.\n"), -1;
  
  if (libkeccak_state_unmarshal_skip(marshalled_data) != marshal_size)
    return printf("libkeccak_state_unmarshal_skip returned an unexpected value.\n"), -1;
  
  if (state->M[state->mptr - 1] != state2->M[state2->mptr - 1])
    return printf("Inconsistency found between original state and unmarshalled state.\n"), -1;

  free(marshalled_data);
  libkeccak_state_free(state);
  libkeccak_state_free(state2);
  return 0;
}


/**
 * Run a test case for `libkeccak_digest`
 * 
 * @param   spec             The specification for the hashing
 * @param   suffix           The message suffix (padding prefix)
 * @param   message          The message to digest
 * @param   bits             Bits at the end of `message` that does not make up a whole byte
 * @param   expected_answer  The expected answer, must be lowercase
 * @return                   Zero on success, -1 on error
 */
static int test_digest_case(const libkeccak_spec_t* restrict spec, const char* restrict suffix,
			    const char* restrict message, long bits, const char* restrict expected_answer)
{
  libkeccak_state_t state;
  char* restrict hashsum;
  char* restrict hexsum;
  char* restrict msg;
  int ok;
  
  if (libkeccak_state_initialise(&state, spec))
    return perror("libkeccak_state_initialise"), -1;
  if (hashsum = malloc((spec->output + 7) / 8), hashsum == NULL)
    return perror("malloc"), -1;
  if (hexsum = malloc((spec->output + 7) / 8 * 2 + 1), hexsum == NULL)
    return perror("malloc"), -1;
  if (msg = strdup(message), msg == NULL)
    return perror("strdup"), -1;
  
  libkeccak_digest(&state, msg, strlen(msg) - !!bits, bits, suffix, hashsum);
  libkeccak_state_fast_destroy(&state);
  free(msg);
  
  libkeccak_behex_lower(hexsum, hashsum, (spec->output + 7) / 8);
  ok = !strcmp(hexsum, expected_answer);
  printf("%s%s\n", ok ? "OK" : "Fail: ", ok ? "" : hexsum);
  if (!ok)
    printf("  r, c, n = %li, %li, %li\n", spec->bitrate, spec->capacity, spec->output);
  
  free(hashsum);
  free(hexsum);
  
  return ok - 1;
}


/**
 * Run test cases for `libkeccak_digest`
 * 
 * @return  Zero on success, -1 on error
 */
static int test_digest(void)
{
#define sha3(output, message)							\
  (printf("Testing SHA3-"#output"(%s): ", #message),				\
   libkeccak_spec_sha3(&spec, output),						\
   test_digest_case(&spec, LIBKECCAK_SHA3_SUFFIX, message, 0, answer))
#define keccak(output, message)							\
  (printf("Testing Keccak-"#output"(%s): ", #message),				\
   libkeccak_spec_sha3(&spec, output) /* sic! */,				\
   test_digest_case(&spec, "", message, 0, answer))
#define keccak_bits(output, message, bits)					\
  (printf("Testing Keccak-"#output"(%s-%i): ", #message, bits),			\
   libkeccak_spec_sha3(&spec, output) /* sic! */,				\
   test_digest_case(&spec, "", message, bits, answer))
#define rawshake(output, message)						\
  (printf("Testing RawSHAKE-"#output"(%s): ", #message),			\
   libkeccak_spec_sha3(&spec, output),						\
   test_digest_case(&spec, LIBKECCAK_RAWSHAKE_SUFFIX, message, 0, answer))
#define rawshake_bits(output, message, bits)					\
  (printf("Testing RawSHAKE-"#output"(%s-%i): ", #message, bits),		\
   libkeccak_spec_sha3(&spec, output),						\
   test_digest_case(&spec, LIBKECCAK_RAWSHAKE_SUFFIX, message, bits, answer))
#define shake(output, message)							\
  (printf("Testing SHAKE-"#output"(%s): ", #message),				\
   libkeccak_spec_sha3(&spec, output),						\
   test_digest_case(&spec, LIBKECCAK_SHAKE_SUFFIX, message, 0, answer))
  
  
  libkeccak_spec_t spec;
  const char* answer;
  
  
  answer = "6b4e03423667dbb73b6e15454f0eb1abd4597f9a1b078e3f5b5a6bc7";
  if (sha3(224, ""))  return -1;
  
  answer = "a7ffc6f8bf1ed76651c14756a061d662f580ff4de43b49fa82d80a4b80f8434a";
  if (sha3(256, ""))  return -1;
  
  answer = "0c63a75b845e4f7d01107d852e4c2485c51a50aaaa94fc61995e71bbee983a2ac3713831264adb47fb6bd1e058d5f004";
  if (sha3(384, ""))  return -1;
  
  answer = "a69f73cca23a9ac5c8b567dc185a756e97c982164fe25859e0d1dcc1475c80a6"
           "15b2123af1f5f94c11e3e9402c3ac558f500199d95b6d3e301758586281dcd26";
  if (sha3(512, ""))  return -1;
  
  
  answer = "f71837502ba8e10837bdd8d365adb85591895602fc552b48b7390abd";
  if (keccak(224, ""))  return -1;
  
  answer = "c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470";
  if (keccak(256, ""))  return -1;
  
  answer = "2c23146a63a29acf99e73b88f8c24eaa7dc60aa771780ccc006afbfa8fe2479b2dd2b21362337441ac12b515911957ff";
  if (keccak(384, ""))  return -1;
  
  answer = "0eab42de4c3ceb9235fc91acffe746b29c29a8c366b7c60e4e67c466f36a4304"
           "c00fa9caf9d87976ba469bcbe06713b435f091ef2769fb160cdab33d3670680e";
  if (keccak(512, ""))  return -1;

  
  answer = "22c8017ac8bcf65f59d1b7e92c9d4c6739d25e34ce5cb608b24ff096";
  if (sha3(224, "withdrew hypothesis snakebird qmc2"))  return -1;
  
  answer = "43808dde2662143dc4eed5dac5e98c74b06711829f02a3b121bd74f3";
  if (sha3(224, "intensifierat sturdiness perl-image-exiftool vingla"))  return -1;
  
  answer = "d32b4ac86065774dee5eb5cdd2f67b4e86501086d7373884e8b20a36";
  if (sha3(224, "timjan avogadro uppdriven lib32-llvm-amdgpu-snapshot"))  return -1;
  
  answer = "efbd76d45bfa952485148f8ad46143897f17c27ffdc8eb7287f9353b";
  if (sha3(224, "grilo-plugins auditorium tull dissimilarity's"))  return -1;
  
  answer = "6705aa36ecf58f333e0e6364ac1d0b7931d402e13282127cfd6f876c";
  if (sha3(224, "royalty tt yellowstone deficiencies"))  return -1;
  
  answer = "803a0ff09dda0df306e483a9f91b20a3dbbf9c2ebb8d0a3b28f3b9e0";
  if (sha3(224, "kdegames-kdiamond tunisisk occurrence's outtalad"))  return -1;
  
  answer = "a64779aca943a6aef1d2e7c9a0f4e997f4dabd1f77112a22121d3ed5";
  if (sha3(224, "chevalier slat's spindel representations"))  return -1;
  
  answer = "f0a3e0587af7723f0aa4719059d3f5107115a5b3667cd5209cc4d867";
  if (sha3(224, "archery lexicographical equine veered"))  return -1;
  
  answer = "312e7e3c6403ab1a086155fb9a52b22a3d0d257876afd2b93fb7272e";
  if (sha3(224, "splay washbasin opposing there"))  return -1;
  
  answer = "270ba05b764221ff5b5d94adfb4fdb1f36f07fe7c438904a5f3df071";
  if (sha3(224, "faktum desist thundered klen"))  return -1;
  
  
  answer = "a7ffc6f8bf1ed76651c14756a061d662f580ff4de43b49fa82d80a4b80f8434a";
  if (keccak_bits(256, "\x02", 2))  return -1;
  
  answer = "3a1108d4a90a31b85a10bdce77f4bfbdcc5b1d70dd405686f8bbde834aa1a410";
  if (keccak_bits(256, "\x03", 2))  return -1;
  
  answer = "46b9dd2b0ba88d13233b3feb743eeb243fcd52ea62b81b82b50c27646ed5762f";
  if (keccak_bits(256, "\x0F", 4))  return -1;
  
  
  answer = "3a1108d4a90a31b85a10bdce77f4bfbdcc5b1d70dd405686f8bbde834aa1a410";
  if (rawshake(256, ""))  return -1;
  
  answer = "46b9dd2b0ba88d13233b3feb743eeb243fcd52ea62b81b82b50c27646ed5762f";
  if (rawshake_bits(256, "\x03", 2))  return -1;
  
  answer = "46b9dd2b0ba88d13233b3feb743eeb243fcd52ea62b81b82b50c27646ed5762f";
  if (shake(256, ""))  return -1;
  
  
  printf("\n");
  return 0;
  
#undef shake
#undef rawshake_bits
#undef rawshake
#undef keccak_bits
#undef keccak
#undef sha3
}


int main(void)
{
  libkeccak_generalised_spec_t gspec;
  libkeccak_spec_t spec;
  
  libkeccak_generalised_spec_initialise(&gspec);
  if (libkeccak_degeneralise_spec(&gspec, &spec))
    return printf("libkeccak_degeneralise_spec failed with all members at automatic.\n"), 1;
  
  printf("Resolution of default specification:\n");
  printf("  bitrate:    %li\n", gspec.bitrate);
  printf("  capacity:   %li\n", gspec.capacity);
  printf("  output:     %li\n", gspec.output);
  printf("  state size: %li\n", gspec.state_size);
  printf("  word size:  %li\n", gspec.word_size);
  if (gspec.word_size * 25 != gspec.state_size)            return printf("Invalid information\n"), 1;
  if (gspec.bitrate + gspec.capacity != gspec.state_size)  return printf("Invalid information\n"), 1;
  if (gspec.state_size != 1600)                            return printf("Incorrect information\n"), 1;
  if (gspec.bitrate != gspec.output * 2)                   return printf("Incorrect information\n"), 1;
  if (gspec.output != 512)                                 return printf("Incorrect information\n"), 1;
  printf("\n");
  
  if (test_hex())         return 1;
  if (test_state(&spec))  return 1;
  if (test_digest())      return 1;
  
  return 0;
}