blake_large.c

   1 /* blake_large.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_large.c
  21  * \author  Daniel Otte
  22  * \email   daniel.otte@rub.de
  23  * \date    2009-05-08
  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_large.h"
  33 #include "blake_common.h"
  34
  35 #define BUG_3 1 /* bug compatibility with reference code */
  36 #define BUG_4 1 /* bug compatibility with reference code */
  37
  38 uint64_t pgm_read_qword(void* p){
  39         union{
  40                 uint64_t v64;
  41                 uint32_t v32[2];
  42         }r;
  43         r.v32[0] = pgm_read_dword(p);
  44         r.v32[1] = pgm_read_dword((uint8_t*)p+4);
  45         return r.v64;
  46 }
  47
  48 static
  49 uint64_t blake_c[] PROGMEM = {
  50    0x243F6A8885A308D3LL, 0x13198A2E03707344LL,
  51    0xA4093822299F31D0LL, 0x082EFA98EC4E6C89LL,
  52    0x452821E638D01377LL, 0xBE5466CF34E90C6CLL,
  53    0xC0AC29B7C97C50DDLL, 0x3F84D5B5B5470917LL,
  54    0x9216D5D98979FB1BLL, 0xD1310BA698DFB5ACLL,
  55    0x2FFD72DBD01ADFB7LL, 0xB8E1AFED6A267E96LL,
  56    0xBA7C9045F12C7F99LL, 0x24A19947B3916CF7LL,
  57    0x0801F2E2858EFC16LL, 0x636920D871574E69LL
  58
  59 };
  60
  61
  62
  63 #define ROTL64(a, n) (((a)<<(n))|((a)>>(64-(n))))
  64 #define ROTR64(a, n) (((a)>>(n))|((a)<<(64-(n))))
  65 #define CHANGE_ENDIAN32(a) (((a)<<24)| \
  66                             ((0x0000ff00&(a))<<8)| \
  67                                                     ((0x00ff0000&(a))>>8)| \
  68                                                     (a)>>24 )
  69
  70 void blake_large_expand(uint64_t* v, const blake_large_ctx_t* ctx){
  71         uint8_t i;
  72         memcpy(v, ctx->h, 8*8);
  73         for(i=0; i<8; ++i){
  74                 v[8+i] = pgm_read_qword(&(blake_c[i]));
  75         }
  76         memxor((uint8_t*)v+8, ctx->s, 4*8);
  77
  78 }
  79
  80 void blake_large_changeendian(void* dest, const void* src){
  81         uint8_t i;
  82         uint32_t tmp;
  83         for(i=0; i<32; i+=2){
  84                 tmp = CHANGE_ENDIAN32(((uint32_t*)src)[i]);
  85                 ((uint32_t*)dest)[i] = CHANGE_ENDIAN32(((uint32_t*)src)[i+1]);
  86                 ((uint32_t*)dest)[i+1] = tmp;
  87         }
  88 }
  89
  90 void blake_large_compress(uint64_t* v,const void* m){
  91         uint8_t r,i;
  92         uint8_t a,b,c,d, s0, s1;
  93         for(r=0; r<14; ++r){
  94                 for(i=0; i<8; ++i){
  95         //              blake_large_g(r%10, i, v, (uint64_t*)m);
  96                         a = pgm_read_byte(blake_index_lut+4*i+0);
  97                         b = pgm_read_byte(blake_index_lut+4*i+1);
  98                         c = pgm_read_byte(blake_index_lut+4*i+2);
  99                         d = pgm_read_byte(blake_index_lut+4*i+3);
 100                         s0 = pgm_read_byte(blake_sigma+16*r+2*i+0);
 101                         s1 = pgm_read_byte(blake_sigma+16*r+2*i+1);
 102                         v[a] += v[b] + (((uint64_t*)m)[s0] ^ pgm_read_qword(&(blake_c[s1])));
 103                         v[d]  = ROTR64(v[d]^v[a], 32);
 104                         v[c] += v[d];
 105                         v[b]  = ROTR64(v[b]^v[c], 25);
 106                         v[a] += v[b] + (((uint64_t*)m)[s1] ^ pgm_read_qword(&(blake_c[s0])));
 107                         v[d]  = ROTR64(v[d]^v[a], 16);
 108                         v[c] += v[d];
 109                         v[b]  = ROTR64(v[b]^v[c], 11);
 110                 }
 111         }
 112 }
 113
 114 void blake_large_collapse(blake_large_ctx_t* ctx, uint64_t* v){
 115         uint8_t i;
 116         for(i=0; i<8; ++i){
 117                 ctx->h[i] ^= ctx->s[i%4] ^ v[i] ^ v[8+i];
 118         }
 119 }
 120
 121 void blake_large_nextBlock(blake_large_ctx_t* ctx, const void* msg){
 122         uint64_t v[16];
 123         uint64_t m[16];
 124         union {
 125                 uint64_t v64;
 126                 uint32_t v32[2];
 127         }ctr;
 128         blake_large_expand(v,ctx);
 129         ctx->counter++;
 130         ctr.v64 = ctx->counter*1024;
 131         v[12] ^= ctr.v64;
 132         v[13] ^= ctr.v64;
 133         blake_large_changeendian(m, msg);
 134         blake_large_compress(v, m);
 135         blake_large_collapse(ctx, v);
 136 }
 137
 138 void blake_large_lastBlock(blake_large_ctx_t* ctx, const void* msg, uint16_t length_b){
 139         while(length_b>=BLAKE_LARGE_BLOCKSIZE){
 140                 blake_large_nextBlock(ctx, msg);
 141                 msg = (uint8_t*)msg + BLAKE_LARGE_BLOCKSIZE_B;
 142                 length_b -= BLAKE_LARGE_BLOCKSIZE;
 143         }
 144         uint8_t buffer[128];
 145         uint64_t v[16];
 146         uint64_t ctr;
 147         ctr = ctx->counter*1024+length_b;
 148         memset(buffer, 0, 128);
 149         memcpy(buffer, msg, (length_b+7)/8);
 150         buffer[length_b/8] |= 0x80 >> (length_b%8);
 151         blake_large_changeendian(buffer, buffer);
 152         blake_large_expand(v, ctx);
 153 #if BUG_3
 154         uint8_t x=0;
 155         if(length_b%1024<895 && length_b%8)
 156                 x=0x40;
 157         v[12] ^= ctr + x;
 158         v[13] ^= ctr + x;
 159
 160 #else
 161         v[12] ^= ctr;
 162         v[13] ^= ctr;
 163 #endif
 164         if(length_b>1024-128-2){
 165 #if BUG_4
 166                 if(length_b<1017){
 167                         blake_large_compress(v, buffer);
 168                         blake_large_collapse(ctx, v);
 169                 }
 170 #else
 171                 blake_large_compress(v, buffer);
 172                 blake_large_collapse(ctx, v);
 173 #endif
 174                 memset(buffer, 0, 128-8);
 175                 blake_large_expand(v, ctx);
 176         }
 177         if(ctx->appendone)
 178                 buffer[128-16-8] |= 0x01;
 179         *((uint64_t*)(&(buffer[128-8]))) = ctr;
 180         blake_large_compress(v, buffer);
 181         blake_large_collapse(ctx, v);
 182
 183 }
 184
 185 uint64_t blake64_iv[] PROGMEM = {
 186     0x6A09E667F3BCC908LL, 0xBB67AE8584CAA73BLL,
 187     0x3C6EF372FE94F82BLL, 0xA54FF53A5F1D36F1LL,
 188     0x510E527FADE682D1LL, 0x9B05688C2B3E6C1FLL,
 189     0x1F83D9ABFB41BD6BLL, 0x5BE0CD19137E2179LL
 190 };
 191
 192 void blake64_init(blake64_ctx_t* ctx){
 193         uint8_t i;
 194         for(i=0; i<8; ++i){
 195                 ctx->h[i] = pgm_read_qword(&(blake64_iv[i]));
 196         }
 197         memset(ctx->s, 0, 4*8);
 198         ctx->counter = 0;
 199         ctx->appendone = 1;
 200 }
 201
 202 uint64_t blake48_iv[] PROGMEM = {
 203     0xCBBB9D5DC1059ED8LL, 0x629A292A367CD507LL,
 204     0x9159015A3070DD17LL, 0x152FECD8F70E5939LL,
 205     0x67332667FFC00B31LL, 0x8EB44A8768581511LL,
 206     0xDB0C2E0D64F98FA7LL, 0x47B5481DBEFA4FA4LL
 207 };
 208
 209 void blake48_init(blake48_ctx_t* ctx){
 210         uint8_t i;
 211         for(i=0; i<8; ++i){
 212                 ctx->h[i] = pgm_read_qword(&(blake48_iv[i]));
 213         }
 214         memset(ctx->s, 0, 4*8);
 215         ctx->counter = 0;
 216         ctx->appendone = 0;
 217 }
 218
 219 void blake64_ctx2hash(void* dest, const blake64_ctx_t* ctx){
 220         uint8_t i;
 221         for(i=0; i<8; ++i){
 222                 ((uint32_t*)dest)[2*i+0] = CHANGE_ENDIAN32((ctx->h[i])>>32);
 223                 ((uint32_t*)dest)[2*i+1] = CHANGE_ENDIAN32((uint32_t)ctx->h[i]);
 224         }
 225 }
 226
 227 void blake48_ctx2hash(void* dest, const blake48_ctx_t* ctx){
 228         uint8_t i;
 229         for(i=0; i<6; ++i){
 230                 ((uint32_t*)dest)[2*i+0] = CHANGE_ENDIAN32((ctx->h[i])>>32);
 231                 ((uint32_t*)dest)[2*i+1] = CHANGE_ENDIAN32((uint32_t)ctx->h[i]);
 232         }
 233 }
 234
 235 void blake64_nextBlock(blake64_ctx_t* ctx, const void* block){
 236         blake_large_nextBlock(ctx, block);
 237 }
 238
 239 void blake48_nextBlock(blake48_ctx_t* ctx, const void* block){
 240         blake_large_nextBlock(ctx, block);
 241 }
 242
 243 void blake64_lastBlock(blake64_ctx_t* ctx, const void* block, uint16_t length_b){
 244         blake_large_lastBlock(ctx, block, length_b);
 245 }
 246
 247 void blake48_lastBlock(blake48_ctx_t* ctx, const void* block, uint16_t length_b){
 248         blake_large_lastBlock(ctx, block, length_b);
 249 }
 250
 251 void blake64(void* dest, const void* msg, uint32_t length_b){
 252         blake_large_ctx_t ctx;
 253         blake64_init(&ctx);
 254         while(length_b>=BLAKE_LARGE_BLOCKSIZE){
 255                 blake_large_nextBlock(&ctx, msg);
 256                 msg = (uint8_t*)msg + BLAKE_LARGE_BLOCKSIZE_B;
 257                 length_b -= BLAKE_LARGE_BLOCKSIZE;
 258         }
 259         blake_large_lastBlock(&ctx, msg, length_b);
 260         blake64_ctx2hash(dest, &ctx);
 261 }
 262
 263 void blake48(void* dest, const void* msg, uint32_t length_b){
 264         blake_large_ctx_t ctx;
 265         blake48_init(&ctx);
 266         while(length_b>=BLAKE_LARGE_BLOCKSIZE){
 267                 blake_large_nextBlock(&ctx, msg);
 268                 msg = (uint8_t*)msg + BLAKE_LARGE_BLOCKSIZE_B;
 269                 length_b -= BLAKE_LARGE_BLOCKSIZE;
 270         }
 271         blake_large_lastBlock(&ctx, msg, length_b);
 272         blake48_ctx2hash(dest, &ctx);
 273 }