xref: /freebsd/crypto/libecc/src/hash/shake.c (revision f0865ec9906d5a18fa2a3b61381f22ce16e606ad)
1*f0865ec9SKyle Evans /*
2*f0865ec9SKyle Evans  *  Copyright (C) 2021 - This file is part of libecc project
3*f0865ec9SKyle Evans  *
4*f0865ec9SKyle Evans  *  Authors:
5*f0865ec9SKyle Evans  *      Ryad BENADJILA <ryadbenadjila@gmail.com>
6*f0865ec9SKyle Evans  *      Arnaud EBALARD <arnaud.ebalard@ssi.gouv.fr>
7*f0865ec9SKyle Evans  *
8*f0865ec9SKyle Evans  *  This software is licensed under a dual BSD and GPL v2 license.
9*f0865ec9SKyle Evans  *  See LICENSE file at the root folder of the project.
10*f0865ec9SKyle Evans  */
11*f0865ec9SKyle Evans #include <libecc/utils/utils.h>
12*f0865ec9SKyle Evans #include <libecc/hash/shake.h>
13*f0865ec9SKyle Evans 
14*f0865ec9SKyle Evans /* Init function depending on the digest size */
_shake_init(shake_context * ctx,u8 digest_size,u8 block_size)15*f0865ec9SKyle Evans int _shake_init(shake_context *ctx, u8 digest_size, u8 block_size)
16*f0865ec9SKyle Evans {
17*f0865ec9SKyle Evans 	int ret;
18*f0865ec9SKyle Evans 
19*f0865ec9SKyle Evans 	MUST_HAVE((ctx != NULL), ret, err);
20*f0865ec9SKyle Evans 
21*f0865ec9SKyle Evans         /* Zeroize the internal state */
22*f0865ec9SKyle Evans         ret = local_memset(ctx->shake_state, 0, sizeof(ctx->shake_state)); EG(ret, err);
23*f0865ec9SKyle Evans 
24*f0865ec9SKyle Evans         ctx->shake_idx = 0;
25*f0865ec9SKyle Evans         ctx->shake_digest_size = digest_size;
26*f0865ec9SKyle Evans         ctx->shake_block_size = block_size;
27*f0865ec9SKyle Evans 
28*f0865ec9SKyle Evans 	/* Detect endianness */
29*f0865ec9SKyle Evans 	ctx->shake_endian = arch_is_big_endian() ? SHAKE_BIG : SHAKE_LITTLE;
30*f0865ec9SKyle Evans 
31*f0865ec9SKyle Evans err:
32*f0865ec9SKyle Evans         return ret;
33*f0865ec9SKyle Evans }
34*f0865ec9SKyle Evans 
35*f0865ec9SKyle Evans /* Update hash function */
_shake_update(shake_context * ctx,const u8 * input,u32 ilen)36*f0865ec9SKyle Evans int _shake_update(shake_context *ctx, const u8 *input, u32 ilen)
37*f0865ec9SKyle Evans {
38*f0865ec9SKyle Evans         u32 i;
39*f0865ec9SKyle Evans         u8 *state;
40*f0865ec9SKyle Evans 	int ret;
41*f0865ec9SKyle Evans 
42*f0865ec9SKyle Evans         MUST_HAVE((ctx != NULL) && ((input != NULL) || (ilen == 0)), ret, err);
43*f0865ec9SKyle Evans 
44*f0865ec9SKyle Evans         state = (u8*)(ctx->shake_state);
45*f0865ec9SKyle Evans 
46*f0865ec9SKyle Evans         for(i = 0; i < ilen; i++){
47*f0865ec9SKyle Evans                 /* Compute the index depending on the endianness */
48*f0865ec9SKyle Evans 		u64 idx = (ctx->shake_endian == SHAKE_LITTLE) ? ctx->shake_idx : SWAP64_Idx(ctx->shake_idx);
49*f0865ec9SKyle Evans                 ctx->shake_idx++;
50*f0865ec9SKyle Evans                 /* Update the state, and adapt endianness order */
51*f0865ec9SKyle Evans                 state[idx] ^= input[i];
52*f0865ec9SKyle Evans                 if(ctx->shake_idx == ctx->shake_block_size){
53*f0865ec9SKyle Evans                         KECCAKF(ctx->shake_state);
54*f0865ec9SKyle Evans                         ctx->shake_idx = 0;
55*f0865ec9SKyle Evans                 }
56*f0865ec9SKyle Evans         }
57*f0865ec9SKyle Evans 	ret = 0;
58*f0865ec9SKyle Evans 
59*f0865ec9SKyle Evans err:
60*f0865ec9SKyle Evans         return ret;
61*f0865ec9SKyle Evans }
62*f0865ec9SKyle Evans 
63*f0865ec9SKyle Evans /* Finalize hash function */
_shake_finalize(shake_context * ctx,u8 * output)64*f0865ec9SKyle Evans int _shake_finalize(shake_context *ctx, u8 *output)
65*f0865ec9SKyle Evans {
66*f0865ec9SKyle Evans         unsigned int i;
67*f0865ec9SKyle Evans         u8 *state;
68*f0865ec9SKyle Evans 	int ret;
69*f0865ec9SKyle Evans 
70*f0865ec9SKyle Evans         MUST_HAVE((ctx != NULL) && (output != NULL), ret, err);
71*f0865ec9SKyle Evans         MUST_HAVE((ctx->shake_digest_size <= sizeof(ctx->shake_state)), ret, err);
72*f0865ec9SKyle Evans 
73*f0865ec9SKyle Evans         state = (u8*)(ctx->shake_state);
74*f0865ec9SKyle Evans 
75*f0865ec9SKyle Evans         /* Proceed with the padding of the last block */
76*f0865ec9SKyle Evans         /* Compute the index depending on the endianness */
77*f0865ec9SKyle Evans         if(ctx->shake_endian == SHAKE_LITTLE){
78*f0865ec9SKyle Evans                 /* Little endian case */
79*f0865ec9SKyle Evans                 state[ctx->shake_idx] ^= 0x1f;
80*f0865ec9SKyle Evans                 state[ctx->shake_block_size - 1] ^= 0x80;
81*f0865ec9SKyle Evans         }
82*f0865ec9SKyle Evans         else{
83*f0865ec9SKyle Evans                 /* Big endian case */
84*f0865ec9SKyle Evans                 state[SWAP64_Idx(ctx->shake_idx)] ^= 0x1f;
85*f0865ec9SKyle Evans                 state[SWAP64_Idx(ctx->shake_block_size - 1)] ^= 0x80;
86*f0865ec9SKyle Evans         }
87*f0865ec9SKyle Evans 	/* Produce the output.
88*f0865ec9SKyle Evans 	 * NOTE: we should have a fixed version of SHAKE producing an output size
89*f0865ec9SKyle Evans 	 * with size less than the state size.
90*f0865ec9SKyle Evans 	 */
91*f0865ec9SKyle Evans 	KECCAKF(ctx->shake_state);
92*f0865ec9SKyle Evans         for(i = 0; i < ctx->shake_digest_size; i++){
93*f0865ec9SKyle Evans                 output[i] = (ctx->shake_endian == SHAKE_LITTLE) ? state[i] : state[SWAP64_Idx(i)];
94*f0865ec9SKyle Evans 	}
95*f0865ec9SKyle Evans 
96*f0865ec9SKyle Evans         /* Uninit our context magic */
97*f0865ec9SKyle Evans         ctx->magic = WORD(0);
98*f0865ec9SKyle Evans 
99*f0865ec9SKyle Evans         ret = 0;
100*f0865ec9SKyle Evans 
101*f0865ec9SKyle Evans err:
102*f0865ec9SKyle Evans         return ret;
103*f0865ec9SKyle Evans }
104