jh/jh_simple_speed_core.c

   1 /* jh_simple_speed.c */
   2 /*
   3     This file is part of the ARM-Crypto-Lib.
   4     Copyright (C) 2006-2010 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 #include <stdint.h>
  21 #include <stdlib.h>
  22 #include <string.h>
  23 #include "memxor.h"
  24 #include "jh_simple.h"
  25 #include "jh_tables.h"
  26
  27 #define DEBUG 0
  28
  29 #if DEBUG
  30 #include "cli.h"
  31 #endif
  32
  33 static
  34 void jh_round(uint8_t* a, uint8_t roundno){
  35         uint8_t b[128];
  36         uint8_t i,r,u,v,x,y;
  37         const uint8_t *pr;
  38         pr = jh_round_const + 32*roundno;
  39         for(i=0; i<128; ++i){
  40                 if(i%4==0){
  41                         r = *pr++;
  42                 }
  43                 b[i]=jh_lutbox[((r&0xC0)<<2)|a[i]];
  44                 r<<=2;
  45         }
  46         for(i=0;i<128;++i){
  47                 u = jh_permutation_table[2*i];
  48                 v = jh_permutation_table[2*i+1];
  49                 x = b[u>>1];
  50                 y = b[v>>1];
  51                 if(u&1){
  52                         x <<= 4;
  53                 }else{
  54                         x &= 0xf0;
  55                 }
  56                 if(v&1){
  57                         y &= 0x0f;
  58                 }else{
  59                         y >>= 4;
  60                 }
  61                 a[i] = x|y;
  62         }
  63 }
  64
  65 static
  66 uint8_t jh_l_inv(uint8_t a){
  67         uint8_t v,w;
  68         v = a>>4;
  69         w = a&0xf;
  70         v ^= ((w<<1)^(w>>3)^((w>>2)&2))&0xf;
  71         w ^= ((v<<1)^(v>>3)^((v>>2)&2))&0xf;
  72         return w|(v<<4);
  73 }
  74
  75 static inline
  76 void group(uint8_t *a){
  77         uint8_t b[128];
  78         uint8_t i,x,y;
  79         for(i=0; i<128; ++i){
  80                 x =   (((a[i/8+  0])>>4)&0x8)
  81                         | (((a[i/8+ 32])>>5)&0x4)
  82                         | (((a[i/8+ 64])>>6)&0x2)
  83                         | (((a[i/8+ 96])>>7)&0x1);
  84                 a[i/8] <<= 1; a[i/8+32]<<=1; a[i/8+64]<<=1; a[i/8+96]<<=1;
  85                 y =   (((a[i/8+ 16])>>4)&0x8)
  86                     | (((a[i/8+ 48])>>5)&0x4)
  87                     | (((a[i/8+ 80])>>6)&0x2)
  88                     | (((a[i/8+112])>>7)&0x1);
  89                 a[i/8+16] <<= 1; a[i/8+48]<<=1; a[i/8+80]<<=1; a[i/8+112]<<=1;
  90                 b[i]= (x<<4)|y;
  91         }
  92         memcpy(a,b,128);
  93 }
  94
  95 static inline
  96 void degroup(uint8_t *a){
  97         uint8_t b[128];
  98         uint8_t i,j;
  99         for(i=0;i<128;++i){
 100                 j=i/8;
 101             b[j+  0]<<=1; b[j+  0] |= ((a[i])>>7)&1;
 102             b[j+ 32]<<=1; b[j+ 32] |= ((a[i])>>6)&1;
 103             b[j+ 64]<<=1; b[j+ 64] |= ((a[i])>>5)&1;
 104             b[j+ 96]<<=1; b[j+ 96] |= ((a[i])>>4)&1;
 105             b[j+ 16]<<=1; b[j+ 16] |= ((a[i])>>3)&1;
 106             b[j+ 48]<<=1; b[j+ 48] |= ((a[i])>>2)&1;
 107             b[j+ 80]<<=1; b[j+ 80] |= ((a[i])>>1)&1;
 108             b[j+112]<<=1; b[j+112] |= ((a[i])>>0)&1;
 109         }
 110         memcpy(a,b,128);
 111 }
 112
 113 void jh_encrypt(uint8_t* a){
 114         uint8_t i;
 115         /* grouping */
 116 #if DEBUG
 117         cli_putstr("\r\n== pre group ==\r\n");
 118         cli_hexdump_block(a, 128, 4, 16);
 119 #endif
 120         group(a);
 121         for(i=0;i<42;++i){
 122                 jh_round(a, i);
 123         }
 124
 125         /* degrouping */
 126 #if DEBUG
 127         cli_putstr("\r\n== pre degroup ==\r\n");
 128         cli_hexdump_block(a, 128, 4, 16);
 129 #endif
 130         degroup(a);
 131 #if DEBUG
 132         cli_putstr("\r\n== post degroup ==\r\n");
 133         cli_hexdump_block(a, 128, 4, 16);
 134 #endif
 135 }
 136
 137