3 This file is part of the AVR-Crypto-Lib.
4 Copyright (C) 2006-2015 Daniel Otte (bg@nerilex.org)
6 This program is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * \file groestl_large.c
22 * \email bg@nerilex.org
24 * \license GPLv3 or later
28 #include "groestl_large.h"
33 #include <avr/pgmspace.h>
43 void dump_m(const uint8_t *m){
46 cli_putstr_P(PSTR("\r\n"));
49 cli_hexdump(m+8*i+j, 1);
57 static const uint8_t matrix[] PROGMEM = {
58 2, 2, 3, 4, 5, 3, 5, 7,
59 7, 2, 2, 3, 4, 5, 3, 5,
60 5, 7, 2, 2, 3, 4, 5, 3,
61 3, 5, 7, 2, 2, 3, 4, 5,
62 5, 3, 5, 7, 2, 2, 3, 4,
63 4, 5, 3, 5, 7, 2, 2, 3,
64 3, 4, 5, 3, 5, 7, 2, 2,
65 2, 3, 4, 5, 3, 5, 7, 2
69 void shift_columns(uint8_t *a, PGM_VOID_P shifts){
74 s = pgm_read_byte(shifts);
75 shifts = (uint8_t*)shifts + 1;
83 a[i+((j-s+16)%16)*8] = tmp[j];
88 static const uint8_t p_shifts[] PROGMEM = {
89 0, 1, 2, 3, 4, 5, 6, 11
92 static const uint8_t q_shifts[] PROGMEM = {
93 1, 3, 5, 11, 0, 2, 4, 6
96 void groestl_large_rounds(uint8_t *m, uint8_t q){
99 for(r=0; r<ROUNDS; ++r){
101 for(i=0; i<(8*16); ++i){
105 m[7+i*8] ^= r ^ (i<<4);
109 m[i*8] ^= r ^ (i<<4);
114 cli_putstr_P(PSTR("\r\npost add-const"));
118 for(i=0;i<16*8; ++i){
119 m[i] = pgm_read_byte(aes_sbox+m[i]);
122 shift_columns(m, p_shifts);
124 shift_columns(m, q_shifts);
129 cli_putstr_P(PSTR("\r\npost shift-bytes"));
134 memcpy(tmp, m+8*i, 8);
136 m[j+i*8] = gf256mul(pgm_read_byte(matrix+8*j+0),tmp[0], POLYNOM)
137 ^ gf256mul(pgm_read_byte(matrix+8*j+1),tmp[1], POLYNOM)
138 ^ gf256mul(pgm_read_byte(matrix+8*j+2),tmp[2], POLYNOM)
139 ^ gf256mul(pgm_read_byte(matrix+8*j+3),tmp[3], POLYNOM)
140 ^ gf256mul(pgm_read_byte(matrix+8*j+4),tmp[4], POLYNOM)
141 ^ gf256mul(pgm_read_byte(matrix+8*j+5),tmp[5], POLYNOM)
142 ^ gf256mul(pgm_read_byte(matrix+8*j+6),tmp[6], POLYNOM)
143 ^ gf256mul(pgm_read_byte(matrix+8*j+7),tmp[7], POLYNOM);
148 cli_putstr_P(PSTR("\r\npost mix-bytes"));
155 void groestl384_init(groestl384_ctx_t *ctx){
156 memset(ctx->h, 0, 16*8);
157 ctx->h[8*16-1] = (uint8_t)384;
158 ctx->h[8*16-2] = (uint8_t)(384>>8);
162 void groestl512_init(groestl512_ctx_t *ctx){
163 memset(ctx->h, 0, 16*8);
168 void groestl_large_nextBlock(groestl_large_ctx_t *ctx, const void *block){
169 uint8_t tmp1[128], tmp2[128];
173 tmp1[j*8+i] = ((uint8_t*)block)[i*8+j];
177 memcpy(tmp1, block, 128);
178 memcpy(tmp2, tmp1, 128);
179 memxor(tmp1, ctx->h, 128);
180 groestl_large_rounds(tmp1, 0);
181 groestl_large_rounds(tmp2, 1);
182 memxor(ctx->h, tmp1, 128);
183 memxor(ctx->h, tmp2, 128);
187 void groestl_large_lastBlock(groestl_large_ctx_t *ctx, const void *block, uint16_t length_b){
189 while(length_b>=GROESTL_LARGE_BLOCKSIZE){
190 groestl_large_nextBlock(ctx, block);
191 length_b -= GROESTL_LARGE_BLOCKSIZE;
192 block = (uint8_t*)block + GROESTL_LARGE_BLOCKSIZE_B;
194 memset(buffer, 0, 128);
195 memcpy(buffer, block, (length_b+7)/8);
196 buffer[length_b/8] |= 0x80>>(length_b%8);
197 if(length_b>1024-65){
198 groestl_large_nextBlock(ctx, buffer);
199 memset(buffer, 0, 128-4);
202 buffer[128-1] = (uint8_t)(ctx->counter);
203 buffer[128-2] = (uint8_t)((ctx->counter)>>8);
204 buffer[128-3] = (uint8_t)((ctx->counter)>>16);
205 buffer[128-4] = (uint8_t)((ctx->counter)>>24);
206 groestl_large_nextBlock(ctx, buffer);
209 void groestl_large_ctx2hash(void *dest, const groestl_large_ctx_t *ctx, uint16_t outlength_b){
211 memcpy(tmp, ctx->h, 128);
212 groestl_large_rounds(tmp, 0);
213 memxor(tmp, ctx->h, 128);
215 cli_putstr_P(PSTR("\r\npost finalisation"));
218 memcpy(dest, tmp+128-outlength_b/8, outlength_b/8);
221 void groestl384_ctx2hash(void *dest, const groestl384_ctx_t *ctx){
222 groestl_large_ctx2hash(dest, ctx, 384);
225 void groestl512_ctx2hash(void *dest, const groestl512_ctx_t *ctx){
226 groestl_large_ctx2hash(dest, ctx, 512);
229 void groestl384_nextBlock(groestl384_ctx_t *ctx, const void *block){
230 groestl_large_nextBlock(ctx, block);
233 void groestl512_nextBlock(groestl512_ctx_t *ctx, const void *block){
234 groestl_large_nextBlock(ctx, block);
237 void groestl384_lastBlock(groestl384_ctx_t *ctx, const void *block, uint16_t length_b){
238 groestl_large_lastBlock(ctx, block, length_b);
241 void groestl512_lastBlock(groestl512_ctx_t *ctx, const void *block, uint16_t length_b){
242 groestl_large_lastBlock(ctx, block, length_b);
245 void groestl384(void *dest, const void *msg, uint32_t length_b){
246 groestl_large_ctx_t ctx;
247 groestl384_init(&ctx);
248 while(length_b>=GROESTL_LARGE_BLOCKSIZE){
249 groestl_large_nextBlock(&ctx, msg);
250 length_b -= GROESTL_LARGE_BLOCKSIZE;
251 msg = (uint8_t*)msg + GROESTL_LARGE_BLOCKSIZE_B;
253 groestl_large_lastBlock(&ctx, msg, length_b);
254 groestl_large_ctx2hash(dest, &ctx, 384);
257 void groestl512(void *dest, const void *msg, uint32_t length_b){
258 groestl_large_ctx_t ctx;
259 groestl512_init(&ctx);
260 while(length_b>=GROESTL_LARGE_BLOCKSIZE){
261 groestl_large_nextBlock(&ctx, msg);
262 length_b -= GROESTL_LARGE_BLOCKSIZE;
263 msg = (uint8_t*)msg + GROESTL_LARGE_BLOCKSIZE_B;
265 groestl_large_lastBlock(&ctx, msg, length_b);
266 groestl_large_ctx2hash(dest, &ctx, 512);