fork download
copy 
  1. /* --COPYRIGHT--,BSD 
  2.  * Copyright (c) 2011, Texas Instruments Incorporated
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * *  Redistributions of source code must retain the above copyright
  10.  *    notice, this list of conditions and the following disclaimer.
  11.  *
  12.  * *  Redistributions in binary form must reproduce the above copyright
  13.  *    notice, this list of conditions and the following disclaimer in the
  14.  *    documentation and/or other materials provided with the distribution.
  15.  *
  16.  * *  Neither the name of Texas Instruments Incorporated nor the names of
  17.  *    its contributors may be used to endorse or promote products derived
  18.  *    from this software without specific prior written permission.
  19.  *
  20.  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  21.  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
  22.  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  23.  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  24.  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  25.  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  26.  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
  27.  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  28.  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  29.  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
  30.  * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31.  * --/COPYRIGHT--*/
  32. /*
  33.  *  aes_128.c
  34.  *
  35.  *  Created on: Nov 3, 2011
  36.  *      Author: Eric Peeters
  37.  *
  38.  *  Description: Implementation of the AES-128 as defined by the FIPS PUB 197: 
  39.  *  the official AES standard
  40.  */
  41. #include <gatt.h>
  42. #include <gatt_prim.h>
  43. #include <buf_utils.h>
  44. #include <timer.h>
  45. #include "aes_128.h"
  46. #include "debug_interface.h"    /* Application debug routines */
  47.  
  48.  
  49. /* foreward sbox */
  50. const unsigned char sbox[256] =   {
  51. //0     1    2      3     4    5     6     7      8    9     A      B    C     D     E     F
  52. 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, //0
  53. 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, //1
  54. 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, //2
  55. 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, //3
  56. 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, //4
  57. 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, //5
  58. 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, //6
  59. 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, //7
  60. 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, //8
  61. 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, //9
  62. 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, //A
  63. 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, //B
  64. 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, //C
  65. 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, //D
  66. 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, //E
  67. 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 }; //F
  68.  
  69. // inverse sbox
  70. const unsigned char rsbox[256] =
  71. { 0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb
  72. , 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb
  73. , 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e
  74. , 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25
  75. , 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92
  76. , 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84
  77. , 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06
  78. , 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b
  79. , 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73
  80. , 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e
  81. , 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b
  82. , 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4
  83. , 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f
  84. , 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef
  85. , 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61
  86. , 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d };
  87.  
  88. // round constant
  89. const unsigned char Rcon[10] = {
  90.     0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36};
  91.  
  92.  
  93. // multiply by 2 in the galois field
  94. /* uint8 galois_mul2(uint8 value)
  95. {
  96.   int8 temp;
  97.   // cast to signed value
  98.   temp = (int8) value;
  99.   // if MSB is 1, then this will signed extend and fill the temp variable with 1's
  100.   temp = temp >> 7;
  101.   // AND with the reduction variable
  102.   temp = temp & 0x1b;
  103.   // finally shift and reduce the value
  104.   return ((value << 1)^temp);
  105. } */
  106.  
  107. unsigned char galois_mul2(unsigned char value)
  108. {
  109. 	if (value>>7)
  110. 	{
  111. 		value = (value << 1) & 0xff;
  112. 		return (value^0x1b);
  113. 	} else
  114. 		return value<<1;
  115. }
  116.  
  117.  /*    uint8 galois_mul2(uint8 a) {
  118.   // the product of the multiplication 
  119.     uint8 p = 0;  
  120.     uint8 b = 2;	
  121.     while (b) {
  122.             // if b is odd, then add the corresponding a to p 
  123.             // (final product = sum of all a's corresponding to odd b's)       
  124.             if (b & 1)  //checking if the b is odd
  125.                 // since we're in GF(2^m), addition is an XOR
  126.                 p ^= a;  // p = p^a
  127.             // GF modulo: if a >= 128, then it will overflow when shifted left, so reduce 
  128.             if (a & 0x80)  {
  129.             // XOR with the primitive polynomial x^8 + x^4 + x^3 + x + 1 -- you can change it but it must be irreducible                
  130.                 a = (a << 1);
  131.                 a = (a & 0xff);
  132.                 a = (a ^ 0x1b); 
  133.             }
  134.             //    Rotate a one bit to the left, discarding the high bit, 
  135.             //    and making the low bit have a value of zero
  136.             //    Tomer: added AND with 0xff to eliminate 1's after 8th bit.
  137.             else
  138.             // equivalent to a*2 
  139.             //    a <<= 1;
  140.             //    Tomer: added AND with 0xff to eliminate 1's after 8th bit.
  141.             {               
  142.                 a = (a << 1);
  143.                 a = (a & 0xff);
  144.             }
  145.             // equivalent to b // 2            
  146.             //  b >>= 1;   
  147.                 b = (b >> 1);
  148.                 b = (b & 0xff);
  149. 	}
  150. 	return p;
  151. } */
  152.  
  153. /* uint8 galois_mul2(uint8 a) {
  154. 	uint8 p = 0;
  155. 	uint8 counter;
  156. 	uint8 hi_bit_set;
  157.     uint8 b=2;
  158. 	for(counter = 0; counter < 8; counter++) {
  159. 		if((b & 1) == 1) 
  160. 			p ^= a;
  161. 		hi_bit_set = (a & 0x80);
  162. 		a <<= 1;
  163. 		if(hi_bit_set == 0x80) 
  164. 			a ^= 0x1b;		
  165. 		b >>= 1;
  166. 	}
  167. 	return p;
  168. } */
  169.  
  170.  
  171. // AES encryption and decryption function
  172. // The code was optimized for memory (flash and ram)
  173. // Combining both encryption and decryption resulted in a slower implementation
  174. // but much smaller than the 2 functions separated
  175. // This function only implements AES-128 encryption and decryption (AES-192 and 
  176. // AES-256 are not supported by this code) 
  177. void aes_enc_dec(unsigned char *state, unsigned char *key, unsigned char dir)
  178. {
  179.   unsigned char buf1, buf2, buf3, buf4, round, i;
  180.  
  181.   // In case of decryption
  182.   if (dir) {
  183.     // compute the last key of encryption before starting the decryption
  184.     for (round = 0 ; round < 10; round++) {
  185.       //key schedule
  186.       key[0] = sbox[key[13]]^key[0]^Rcon[round];
  187.       key[1] = sbox[key[14]]^key[1];
  188.       key[2] = sbox[key[15]]^key[2];
  189.       key[3] = sbox[key[12]]^key[3];
  190.       for (i=4; i<16; i++) {
  191.         key[i] = key[i] ^ key[i-4];
  192.       }
  193.     }
  194.  
  195.     //first Addroundkey
  196.     for (i = 0; i <16; i++){
  197.       state[i]=state[i] ^ key[i];
  198.     }
  199.   }
  200.  
  201.   // main loop
  202.   for (round = 0; round < 10; round++){
  203.     if (dir){
  204.       //Inverse key schedule
  205.       for (i=15; i>3; --i) {
  206. 	key[i] = key[i] ^ key[i-4];
  207.       }  
  208.       key[0] = sbox[key[13]]^key[0]^Rcon[9-round];
  209.       key[1] = sbox[key[14]]^key[1];
  210.       key[2] = sbox[key[15]]^key[2];
  211.       key[3] = sbox[key[12]]^key[3]; 
  212.     } else {
  213.       for (i = 0; i <16; i++){
  214.         // with shiftrow i+5 mod 16
  215. 	state[i]=sbox[state[i] ^ key[i]];
  216.       }
  217.       //shift rows
  218.       buf1 = state[1];
  219.       state[1] = state[5];
  220.       state[5] = state[9];
  221.       state[9] = state[13];
  222.       state[13] = buf1;
  223.  
  224.       buf1 = state[2];
  225.       buf2 = state[6];
  226.       state[2] = state[10];
  227.       state[6] = state[14];
  228.       state[10] = buf1;
  229.       state[14] = buf2;
  230.  
  231.       buf1 = state[15];
  232.       state[15] = state[11];
  233.       state[11] = state[7];
  234.       state[7] = state[3];
  235.       state[3] = buf1;
  236.     }
  237.     //mixcol - inv mix
  238.     if ((round > 0 && dir) || (round < 9 && !dir)) {
  239.       for (i=0; i <4; i++){
  240.         buf4 = (i << 2);
  241.         buf4 = (buf4 & 0xff);
  242.         if (dir){
  243.           // precompute for decryption
  244.           buf1 = galois_mul2(galois_mul2(state[buf4]^state[buf4+2]));
  245.           buf2 = galois_mul2(galois_mul2(state[buf4+1]^state[buf4+3]));
  246.           state[buf4] ^= buf1; state[buf4+1] ^= buf2; state[buf4+2] ^= buf1; state[buf4+3] ^= buf2; 
  247.         }
  248.         // in all cases
  249.         buf1 = state[buf4] ^ state[buf4+1] ^ state[buf4+2] ^ state[buf4+3];
  250.         buf2 = state[buf4];
  251.         buf3 = state[buf4]^state[buf4+1]; 
  252.         buf3 = galois_mul2(buf3); 
  253.         state[buf4] = state[buf4] ^ buf3 ^ buf1;
  254.         buf3 = state[buf4+1]^state[buf4+2]; 
  255.         buf3=galois_mul2(buf3); 
  256.         state[buf4+1] = state[buf4+1] ^ buf3 ^ buf1;
  257.         buf3 = state[buf4+2]^state[buf4+3]; 
  258.         buf3=galois_mul2(buf3); 
  259.         state[buf4+2] = state[buf4+2] ^ buf3 ^ buf1;
  260.         buf3 = state[buf4+3]^buf2;     
  261.         buf3=galois_mul2(buf3); 
  262.         state[buf4+3] = state[buf4+3] ^ buf3 ^ buf1;
  263.       }
  264.     }
  265.  
  266.     if (dir) {
  267.       //Inv shift rows
  268.       // Row 1
  269.       buf1 = state[13];
  270.       state[13] = state[9];
  271.       state[9] = state[5];
  272.       state[5] = state[1];
  273.       state[1] = buf1;
  274.       //Row 2
  275.       buf1 = state[10];
  276.       buf2 = state[14];
  277.       state[10] = state[2];
  278.       state[14] = state[6];
  279.       state[2] = buf1;
  280.       state[6] = buf2;
  281.       //Row 3
  282.       buf1 = state[3];
  283.       state[3] = state[7];
  284.       state[7] = state[11];
  285.       state[11] = state[15];
  286.       state[15] = buf1;         
  287.  
  288.       for (i = 0; i <16; i++){
  289.         // with shiftrow i+5 mod 16
  290.         state[i]=rsbox[state[i]] ^ key[i];
  291.       } 
  292.     } else {
  293.       //key schedule
  294.       key[0] = sbox[key[13]]^key[0]^Rcon[round];
  295.       key[1] = sbox[key[14]]^key[1];
  296.       key[2] = sbox[key[15]]^key[2];
  297.       key[3] = sbox[key[12]]^key[3];
  298.       for (i=4; i<16; i++) {
  299.         key[i] = key[i] ^ key[i-4];
  300.       }
  301.     }
  302.   }
  303.   if (!dir) {
  304.   //last Addroundkey
  305.     for (i = 0; i <16; i++){
  306.       // with shiftrow i+5 mod 16
  307.       state[i]=state[i] ^ key[i];
  308.     } // enf for
  309.   } // end if (!dir)
  310. } // end function
  311.  
Compilation error #stdin compilation error #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
compilation info 
prog.c:41:18: fatal error: gatt.h: No such file or directory
compilation terminated.
stdout
copy 
Standard output is empty
https://ideone.com/pAmlWM
language:
C (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!