]> git.cryptolib.org Git - avr-crypto-lib.git/blob - blake_small.c
ea89e65653e2ca49d9c5424deb1077066f08ed4a
[avr-crypto-lib.git] / blake_small.c
1 /* blake_small.c */
2 /*
3     This file is part of the AVR-Crypto-Lib.
4     Copyright (C) 2009  Daniel Otte (daniel.otte@rub.de)
5
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.
10
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.
15
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/>.
18 */
19 /*
20  * \file    blake_small.c
21  * \author  Daniel Otte
22  * \email   daniel.otte@rub.de
23  * \date    2009-05-04
24  * \license GPLv3 or later
25  * 
26  */
27
28 #include <stdint.h>
29 #include <string.h>
30 #include <avr/pgmspace.h>
31 #include "memxor.h"
32 #include "blake_small.h"
33 #include "blake_common.h"
34
35 #define BUG_1 0 /* bug compatibility for zero length message */
36 #define BUG_2 0 /* bug compatibility for messages of length%512=505...511 */
37
38
39 uint32_t blake_c[] PROGMEM = {
40    0x243F6A88, 0x85A308D3,
41    0x13198A2E, 0x03707344,
42    0xA4093822, 0x299F31D0,
43    0x082EFA98, 0xEC4E6C89,
44    0x452821E6, 0x38D01377,
45    0xBE5466CF, 0x34E90C6C,
46    0xC0AC29B7, 0xC97C50DD,
47    0x3F84D5B5, 0xB5470917
48 };
49
50 #define ROTL32(a, n) (((a)<<(n))|((a)>>(32-(n))))
51 #define ROTR32(a, n) (((a)>>(n))|((a)<<(32-(n))))
52 #define CHANGE_ENDIAN32(a) (((a)<<24)| \
53                             ((0x0000ff00&(a))<<8)| \
54                                                     ((0x00ff0000&(a))>>8)| \
55                                                     (a)>>24 )
56
57 void blake_small_g(uint8_t r, uint8_t i, uint32_t* v, const uint32_t* m){
58         uint8_t a,b,c,d, s0, s1;
59         a = pgm_read_byte(blake_index_lut+4*i+0);
60         b = pgm_read_byte(blake_index_lut+4*i+1);
61         c = pgm_read_byte(blake_index_lut+4*i+2);
62         d = pgm_read_byte(blake_index_lut+4*i+3);
63         s0 = pgm_read_byte(blake_sigma+16*r+2*i+0);
64         s1 = pgm_read_byte(blake_sigma+16*r+2*i+1);
65         v[a] += v[b] + (m[s0] ^ pgm_read_dword(&(blake_c[s1])));
66         v[d]  = ROTR32(v[d]^v[a], 16);
67         v[c] += v[d];
68         v[b]  = ROTR32(v[b]^v[c], 12);  
69         v[a] += v[b] + (m[s1] ^ pgm_read_dword(&(blake_c[s0])));
70         v[d]  = ROTR32(v[d]^v[a], 8);
71         v[c] += v[d];
72         v[b]  = ROTR32(v[b]^v[c], 7);
73
74 }
75
76 void blake_small_expand(uint32_t* v, const blake_small_ctx_t* ctx){
77         uint8_t i;
78         memcpy(v, ctx->h, 8*4);
79         for(i=0; i<8; ++i){
80                 v[8+i] = pgm_read_dword(&(blake_c[i]));
81         }
82         memxor((uint8_t*)v+8, ctx->s, 4*4);
83         
84 }
85
86 void blake_small_changeendian(void* dest, const void* src){
87         uint8_t i;
88         for(i=0; i<16; ++i){
89                 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(((uint32_t*)src)[i]);
90         }
91 }
92
93 void blake_small_compress(uint32_t* v,const void* m){
94         uint8_t r,i;
95         for(r=0; r<10; ++r){
96                 for(i=0; i<8; ++i){
97                         blake_small_g(r, i, v, (uint32_t*)m);
98                 }
99         }
100 }
101
102 void blake_small_collapse(blake_small_ctx_t* ctx, uint32_t* v){
103         uint8_t i;
104         for(i=0; i<8; ++i){
105                 ctx->h[i] ^= ctx->s[i%4] ^ v[i] ^ v[8+i];
106         }
107 }       
108
109 void blake_small_nextBlock(blake_small_ctx_t* ctx, const void* msg){
110         uint32_t v[16];
111         uint32_t m[16];
112         union {
113                 uint64_t v64;
114                 uint32_t v32[2];
115         }ctr;
116         blake_small_expand(v,ctx);
117         ctx->counter++;
118         ctr.v64 = ctx->counter*512;
119         v[12] ^= ctr.v32[0];
120         v[13] ^= ctr.v32[0];
121         v[14] ^= ctr.v32[1];
122         v[15] ^= ctr.v32[1];
123         blake_small_changeendian(m, msg);
124         blake_small_compress(v, m);
125         blake_small_collapse(ctx, v);
126 }
127
128 void blake_small_lastBlock(blake_small_ctx_t* ctx, const void* msg, uint16_t length_b){
129         while(length_b>=BLAKE_SMALL_BLOCKSIZE){
130                 blake_small_nextBlock(ctx, msg);
131                 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
132                 length_b -= BLAKE_SMALL_BLOCKSIZE;
133         }
134         uint8_t buffer[64];
135         uint32_t v[16];
136 #if BUG_2
137         uint32_t tmp=0;
138 #endif
139         union {
140                 uint64_t v64;
141                 uint32_t v32[2];
142         }ctr;
143         ctr.v64 = ctx->counter*512+length_b;
144 #if BUG_2
145         if(length_b>=505){
146                 tmp =ctr.v32[0];
147                 ctr.v32[0] = ctx->counter*512;
148                 ctr.v32[0] |= 0x40+length_b-504;
149         }
150 #endif  
151         memset(buffer, 0, 64);
152         memcpy(buffer, msg, (length_b+7)/8);
153         buffer[length_b/8] |= 0x80 >> (length_b%8);
154         blake_small_changeendian(buffer, buffer);
155         blake_small_expand(v, ctx);
156         v[12] ^= ctr.v32[0];
157         v[13] ^= ctr.v32[0];
158         v[14] ^= ctr.v32[1];
159         v[15] ^= ctr.v32[1];
160 #if BUG_2
161         if(length_b>=505)
162                 ctr.v32[0] = tmp;
163 #endif
164 #if BUG_1       
165         if(length_b==0 && ctx->counter==0){
166                 v[14] ^= 1;
167                 v[15] ^= 1;
168         }
169 #endif  
170         if(length_b>512-64-2){
171                 blake_small_compress(v, buffer);
172                 blake_small_collapse(ctx, v);
173                 memset(buffer, 0, 64-8);
174                 blake_small_expand(v, ctx);
175         }
176         if(ctx->appendone)
177                 buffer[64-8-4] |= 0x01; 
178         *((uint32_t*)(&(buffer[64-8]))) = ctr.v32[1];
179         *((uint32_t*)(&(buffer[64-4]))) = ctr.v32[0];
180         blake_small_compress(v, buffer);
181         blake_small_collapse(ctx, v);
182         
183 }
184
185 uint32_t blake32_iv[] PROGMEM = {
186         0x6A09E667L, 0xBB67AE85,
187         0x3C6EF372L, 0xA54FF53A,
188         0x510E527FL, 0x9B05688C,
189         0x1F83D9ABL, 0x5BE0CD19
190 };
191
192 void blake32_init(blake32_ctx_t* ctx){
193         uint8_t i;
194         for(i=0; i<8; ++i){
195                 ctx->h[i] = pgm_read_dword(&(blake32_iv[i]));
196         }
197         memset(ctx->s, 0, 4*4);
198         ctx->counter = 0;
199         ctx->appendone = 1;
200 }
201
202 uint32_t blake28_iv[] PROGMEM = {
203         0xC1059ED8, 0x367CD507,
204         0x3070DD17, 0xF70E5939,
205         0xFFC00B31, 0x68581511,
206         0x64F98FA7, 0xBEFA4FA4
207 };
208
209 void blake28_init(blake28_ctx_t* ctx){
210         uint8_t i;
211         for(i=0; i<8; ++i){
212                 ctx->h[i] = pgm_read_dword(&(blake28_iv[i]));
213         }
214         memset(ctx->s, 0, 4*4);
215         ctx->counter = 0;
216         ctx->appendone = 0;
217 }
218
219 void blake32_ctx2hash(void* dest, const blake32_ctx_t* ctx){
220         uint8_t i;
221         for(i=0; i<8; ++i){
222                 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(ctx->h[i]);
223         }
224 }
225
226 void blake28_ctx2hash(void* dest, const blake28_ctx_t* ctx){
227         uint8_t i;
228         for(i=0; i<7; ++i){
229                 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(ctx->h[i]);
230         }
231 }
232
233 void blake32_nextBlock(blake32_ctx_t* ctx, const void* block){
234         blake_small_nextBlock(ctx, block);
235 }
236
237 void blake28_nextBlock(blake28_ctx_t* ctx, const void* block){
238         blake_small_nextBlock(ctx, block);
239 }
240
241 void blake32_lastBlock(blake32_ctx_t* ctx, const void* block, uint16_t length_b){
242         blake_small_lastBlock(ctx, block, length_b);
243 }
244
245 void blake28_lastBlock(blake28_ctx_t* ctx, const void* block, uint16_t length_b){
246         blake_small_lastBlock(ctx, block, length_b);
247 }
248
249 void blake32(void* dest, const void* msg, uint32_t length_b){
250         blake_small_ctx_t ctx;
251         blake32_init(&ctx);
252         while(length_b>=BLAKE_SMALL_BLOCKSIZE){
253                 blake_small_nextBlock(&ctx, msg);
254                 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
255                 length_b -= BLAKE_SMALL_BLOCKSIZE;
256         }
257         blake_small_lastBlock(&ctx, msg, length_b);
258         blake32_ctx2hash(dest, &ctx);
259 }
260
261 void blake28(void* dest, const void* msg, uint32_t length_b){
262         blake_small_ctx_t ctx;
263         blake28_init(&ctx);
264         while(length_b>=BLAKE_SMALL_BLOCKSIZE){
265                 blake_small_nextBlock(&ctx, msg);
266                 msg = (uint8_t*)msg + BLAKE_SMALL_BLOCKSIZE_B;
267                 length_b -= BLAKE_SMALL_BLOCKSIZE;
268         }
269         blake_small_lastBlock(&ctx, msg, length_b);
270         blake28_ctx2hash(dest, &ctx);
271 }