3 This file is part of the AVR-Crypto-Lib.
4 Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)
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/>.
21 * \email daniel.otte@rub.de
24 * \license GPLv3 or later
34 static uint32_t rol32(uint32_t a, uint8_t r){
35 return (a<<r)|(a>>(32-r));
38 • Add x_0jklm into x_1jklm modulo 232 , for each (j, k, l, m).
39 • Rotate x_0jklm upwards by 7 bits, for each (j, k, l, m).
40 • Swap x_00klm with x_01klm , for each (k, l, m).
41 • Xor x_1jklm into x_0jklm , for each (j, k, l, m).
42 • Swap x_1jk0m with x_1jk1m , for each (j, k, m).
43 • Add x_0jklm into x_1jklm modulo 232 , for each (j, k, l, m).
44 • Rotate x_0jklm upwards by 11 bits, for each (j, k, l, m).
45 • Swap x_0j0lm with x_0j1lm , for each (j, l, m).
46 • Xor x_1jklm into x_0jklm , for each (j, k, l, m).
47 • Swap x_1jkl0 with x_1jkl1 , for each (j, k, l).
50 static void cubehash_round(cubehash_ctx_t* ctx){
54 ctx->a[i+16] += ctx->a[i];
57 ctx->a[i] = rol32(ctx->a[i], 7);
61 ctx->a[i] = ctx->a[i+8];
65 ctx->a[i] ^= ctx->a[i+16];
67 for(i=16; i<4*4+16; i+=4){
69 ctx->a[i] = ctx->a[i+2];
72 ctx->a[i+1] = ctx->a[i+3];
76 ctx->a[i+16] += ctx->a[i];
79 ctx->a[i] = rol32(ctx->a[i], 11);
83 ctx->a[i] = ctx->a[i+4];
88 ctx->a[i] = ctx->a[i+4];
92 ctx->a[i] ^= ctx->a[i+16];
94 for(i=16; i<16+16; i+=2){
96 ctx->a[i] = ctx->a[i+1];
101 void cubehash_init(uint8_t r, uint8_t b, uint16_t h, cubehash_ctx_t* ctx){
102 memset(ctx->a, 0, 32*4);
107 ctx->blocksize_B = b;
108 for(b=0; b<10*r; ++b){
113 void cubehash_nextBlock(cubehash_ctx_t* ctx, void* block){
115 memxor(ctx->a, block, ctx->blocksize_B);
116 for(i=0; i<ctx->rounds; ++i){
121 void cubehash_lastBlock(cubehash_ctx_t* ctx, void* block, uint16_t length_b){
122 while(length_b>=ctx->blocksize_B*8){
123 cubehash_nextBlock(ctx, block);
124 block = (uint8_t*)block + ctx->blocksize_B;
125 length_b -= ctx->blocksize_B*8;
127 uint8_t buffer[ctx->blocksize_B];
129 memset(buffer, 0, ctx->blocksize_B);
130 memcpy(buffer, block, (length_b+7)/8);
131 buffer[length_b/8] |= 0x80 >> (length_b&7);
132 cubehash_nextBlock(ctx, buffer);
134 for(i=0; i<10*(ctx->rounds); ++i){
139 void cubehash_ctx2hash(void* dest, uint16_t length_b, cubehash_ctx_t* ctx){
140 memcpy(dest, ctx->a, (length_b+7)/8);
143 /******************************************************************************/
145 void cubehash224_init(cubehash_ctx_t* ctx){
146 cubehash_init(16, 32, 224, ctx);
149 void cubehash224_ctx2hash(void* dest, cubehash_ctx_t* ctx){
150 cubehash_ctx2hash(dest, 224, ctx);
153 /******************************************************************************/
155 void cubehash256_init(cubehash_ctx_t* ctx){
156 cubehash_init(16, 32, 256, ctx);
159 void cubehash256_ctx2hash(void* dest, cubehash_ctx_t* ctx){
160 cubehash_ctx2hash(dest, 256, ctx);
163 /******************************************************************************/
165 void cubehash384_init(cubehash_ctx_t* ctx){
166 cubehash_init(16, 32, 384, ctx);
169 void cubehash384_ctx2hash(void* dest, cubehash_ctx_t* ctx){
170 cubehash_ctx2hash(dest, 384, ctx);
173 /******************************************************************************/
175 void cubehash512_init(cubehash_ctx_t* ctx){
176 cubehash_init(16, 32, 512, ctx);
179 void cubehash512_ctx2hash(void* dest, cubehash_ctx_t* ctx){
180 cubehash_ctx2hash(dest, 512, ctx);