1 | n/a | /* |
---|
2 | n/a | The Keccak sponge function, designed by Guido Bertoni, Joan Daemen, |
---|
3 | n/a | Michaël Peeters and Gilles Van Assche. For more information, feedback or |
---|
4 | n/a | questions, please refer to our website: http://keccak.noekeon.org/ |
---|
5 | n/a | |
---|
6 | n/a | Implementation by the designers, |
---|
7 | n/a | hereby denoted as "the implementer". |
---|
8 | n/a | |
---|
9 | n/a | To the extent possible under law, the implementer has waived all copyright |
---|
10 | n/a | and related or neighboring rights to the source code in this file. |
---|
11 | n/a | http://creativecommons.org/publicdomain/zero/1.0/ |
---|
12 | n/a | */ |
---|
13 | n/a | |
---|
14 | n/a | #include <string.h> |
---|
15 | n/a | #include "KeccakNISTInterface.h" |
---|
16 | n/a | #include "KeccakF-1600-interface.h" |
---|
17 | n/a | |
---|
18 | n/a | static HashReturn Init(hashState *state, int hashbitlen) |
---|
19 | n/a | { |
---|
20 | n/a | switch(hashbitlen) { |
---|
21 | n/a | case 0: /* Default parameters, arbitrary length output */ |
---|
22 | n/a | InitSponge((spongeState*)state, 1024, 576); |
---|
23 | n/a | break; |
---|
24 | n/a | case 224: |
---|
25 | n/a | InitSponge((spongeState*)state, 1152, 448); |
---|
26 | n/a | break; |
---|
27 | n/a | case 256: |
---|
28 | n/a | InitSponge((spongeState*)state, 1088, 512); |
---|
29 | n/a | break; |
---|
30 | n/a | case 384: |
---|
31 | n/a | InitSponge((spongeState*)state, 832, 768); |
---|
32 | n/a | break; |
---|
33 | n/a | case 512: |
---|
34 | n/a | InitSponge((spongeState*)state, 576, 1024); |
---|
35 | n/a | break; |
---|
36 | n/a | default: |
---|
37 | n/a | return BAD_HASHLEN; |
---|
38 | n/a | } |
---|
39 | n/a | state->fixedOutputLength = hashbitlen; |
---|
40 | n/a | return SUCCESS; |
---|
41 | n/a | } |
---|
42 | n/a | |
---|
43 | n/a | static HashReturn Update(hashState *state, const BitSequence *data, DataLength databitlen) |
---|
44 | n/a | { |
---|
45 | n/a | if ((databitlen % 8) == 0) |
---|
46 | n/a | return Absorb((spongeState*)state, data, databitlen); |
---|
47 | n/a | else { |
---|
48 | n/a | HashReturn ret = Absorb((spongeState*)state, data, databitlen - (databitlen % 8)); |
---|
49 | n/a | if (ret == SUCCESS) { |
---|
50 | n/a | unsigned char lastByte; |
---|
51 | n/a | /* Align the last partial byte to the least significant bits */ |
---|
52 | n/a | lastByte = data[databitlen/8] >> (8 - (databitlen % 8)); |
---|
53 | n/a | return Absorb((spongeState*)state, &lastByte, databitlen % 8); |
---|
54 | n/a | } |
---|
55 | n/a | else |
---|
56 | n/a | return ret; |
---|
57 | n/a | } |
---|
58 | n/a | } |
---|
59 | n/a | |
---|
60 | n/a | static HashReturn Final(hashState *state, BitSequence *hashval) |
---|
61 | n/a | { |
---|
62 | n/a | return Squeeze(state, hashval, state->fixedOutputLength); |
---|
63 | n/a | } |
---|
64 | n/a | |
---|
65 | n/a | /* |
---|
66 | n/a | static HashReturn Hash(int hashbitlen, const BitSequence *data, DataLength databitlen, BitSequence *hashval) |
---|
67 | n/a | { |
---|
68 | n/a | hashState state; |
---|
69 | n/a | HashReturn result; |
---|
70 | n/a | |
---|
71 | n/a | if ((hashbitlen != 224) && (hashbitlen != 256) && (hashbitlen != 384) && (hashbitlen != 512)) |
---|
72 | n/a | return BAD_HASHLEN; * Only the four fixed output lengths available through this API * |
---|
73 | n/a | result = Init(&state, hashbitlen); |
---|
74 | n/a | if (result != SUCCESS) |
---|
75 | n/a | return result; |
---|
76 | n/a | result = Update(&state, data, databitlen); |
---|
77 | n/a | if (result != SUCCESS) |
---|
78 | n/a | return result; |
---|
79 | n/a | result = Final(&state, hashval); |
---|
80 | n/a | return result; |
---|
81 | n/a | } |
---|
82 | n/a | */ |
---|
83 | n/a | |
---|