3 This file is part of the AVR-Crypto-Lib.
4 Copyright (C) 2009 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/>.
22 * \email daniel.otte@rub.de
24 * \license GPLv3 or later
30 #include <avr/pgmspace.h>
31 #include "memxor/memxor.h"
32 #include "blake_small.h"
33 #include "blake_common.h"
36 uint32_t blake_c[] PROGMEM = {
37 0x243F6A88, 0x85A308D3,
38 0x13198A2E, 0x03707344,
39 0xA4093822, 0x299F31D0,
40 0x082EFA98, 0xEC4E6C89,
41 0x452821E6, 0x38D01377,
42 0xBE5466CF, 0x34E90C6C,
43 0xC0AC29B7, 0xC97C50DD,
44 0x3F84D5B5, 0xB5470917
47 #define ROTL32(a, n) (((a)<<(n))|((a)>>(32-(n))))
48 #define ROTR32(a, n) (((a)>>(n))|((a)<<(32-(n))))
49 #define CHANGE_ENDIAN32(a) (((a)<<24)| \
50 ((0x0000ff00&(a))<<8)| \
51 ((0x00ff0000&(a))>>8)| \
54 void blake_small_expand(uint32_t* v, const blake_small_ctx_t* ctx){
56 memcpy(v, ctx->h, 8*4);
58 v[8+i] = pgm_read_dword(&(blake_c[i]));
60 memxor((uint8_t*)v+8, ctx->s, 4*4);
65 void blake_small_changeendian(void* dest, const void* src){
68 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(((uint32_t*)src)[i]);
73 void blake_small_compress(uint32_t* v,const void* m){
75 uint8_t a,b,c,d, s0, s1;
79 a = pgm_read_byte(blake_index_lut+4*i+0);
80 b = pgm_read_byte(blake_index_lut+4*i+1);
81 c = pgm_read_byte(blake_index_lut+4*i+2);
82 d = pgm_read_byte(blake_index_lut+4*i+3);
83 s0 = pgm_read_byte(blake_sigma+16*r+2*i+0);
84 s1 = pgm_read_byte(blake_sigma+16*r+2*i+1);
91 lv[0] += lv[1] + (((uint32_t*)m)[s0] ^ pgm_read_dword(&(blake_c[s1])));
92 lv[3] = ROTR32(lv[3]^lv[0], 16);
94 lv[1] = ROTR32(lv[1]^lv[2], 12);
95 lv[0] += lv[1] + (((uint32_t*)m)[s1] ^ pgm_read_dword(&(blake_c[s0])));
96 lv[3] = ROTR32(lv[3]^lv[0], 8);
98 lv[1] = ROTR32(lv[1]^lv[2], 7);
109 void blake_small_collapse(blake_small_ctx_t* ctx, uint32_t* v){
112 ctx->h[i] ^= ctx->s[i%4] ^ v[i] ^ v[8+i];
116 void blake_small_nextBlock(blake_small_ctx_t* ctx, const void* msg){
123 blake_small_expand(v,ctx);
125 ctr.v64 = ctx->counter*512;
130 blake_small_changeendian(m, msg);
131 blake_small_compress(v, m);
132 blake_small_collapse(ctx, v);
135 void blake_small_lastBlock(blake_small_ctx_t* ctx, const void* msg, uint16_t length_b){
136 while(length_b>=BLAKE_SMALL_BLOCKSIZE){
137 blake_small_nextBlock(ctx, msg);
138 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
139 length_b -= BLAKE_SMALL_BLOCKSIZE;
147 ctr.v64 = ctx->counter*512+length_b;
148 memset(buffer, 0, 64);
149 memcpy(buffer, msg, (length_b+7)/8);
150 buffer[length_b/8] |= 0x80 >> (length_b&0x7);
151 blake_small_changeendian(buffer, buffer);
152 blake_small_expand(v, ctx);
153 if(length_b>512-64-2){
158 blake_small_compress(v, buffer);
159 blake_small_collapse(ctx, v);
160 memset(buffer, 0, 64-8);
161 blake_small_expand(v, ctx);
171 buffer[64-8-4] |= 0x01;
172 *((uint32_t*)(&(buffer[64-8]))) = ctr.v32[1];
173 *((uint32_t*)(&(buffer[64-4]))) = ctr.v32[0];
174 blake_small_compress(v, buffer);
175 blake_small_collapse(ctx, v);
179 uint32_t blake32_iv[] PROGMEM = {
180 0x6A09E667L, 0xBB67AE85,
181 0x3C6EF372L, 0xA54FF53A,
182 0x510E527FL, 0x9B05688C,
183 0x1F83D9ABL, 0x5BE0CD19
186 void blake32_init(blake32_ctx_t* ctx){
189 ctx->h[i] = pgm_read_dword(&(blake32_iv[i]));
191 memset(ctx->s, 0, 4*4);
196 uint32_t blake28_iv[] PROGMEM = {
197 0xC1059ED8, 0x367CD507,
198 0x3070DD17, 0xF70E5939,
199 0xFFC00B31, 0x68581511,
200 0x64F98FA7, 0xBEFA4FA4
203 void blake28_init(blake28_ctx_t* ctx){
206 ctx->h[i] = pgm_read_dword(&(blake28_iv[i]));
208 memset(ctx->s, 0, 4*4);
213 void blake32_ctx2hash(void* dest, const blake32_ctx_t* ctx){
216 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(ctx->h[i]);
220 void blake28_ctx2hash(void* dest, const blake28_ctx_t* ctx){
223 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(ctx->h[i]);
227 void blake32_nextBlock(blake32_ctx_t* ctx, const void* block){
228 blake_small_nextBlock(ctx, block);
231 void blake28_nextBlock(blake28_ctx_t* ctx, const void* block){
232 blake_small_nextBlock(ctx, block);
235 void blake32_lastBlock(blake32_ctx_t* ctx, const void* block, uint16_t length_b){
236 blake_small_lastBlock(ctx, block, length_b);
239 void blake28_lastBlock(blake28_ctx_t* ctx, const void* block, uint16_t length_b){
240 blake_small_lastBlock(ctx, block, length_b);
243 void blake32(void* dest, const void* msg, uint32_t length_b){
244 blake_small_ctx_t ctx;
246 while(length_b>=BLAKE_SMALL_BLOCKSIZE){
247 blake_small_nextBlock(&ctx, msg);
248 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
249 length_b -= BLAKE_SMALL_BLOCKSIZE;
251 blake_small_lastBlock(&ctx, msg, length_b);
252 blake32_ctx2hash(dest, &ctx);
255 void blake28(void* dest, const void* msg, uint32_t length_b){
256 blake_small_ctx_t ctx;
258 while(length_b>=BLAKE_SMALL_BLOCKSIZE){
259 blake_small_nextBlock(&ctx, msg);
260 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
261 length_b -= BLAKE_SMALL_BLOCKSIZE;
263 blake_small_lastBlock(&ctx, msg, length_b);
264 blake28_ctx2hash(dest, &ctx);