Branch data Line data Source code
1 : : /* aes_decrypt.c - TinyCrypt implementation of AES decryption procedure */
2 : :
3 : : /*
4 : : * Copyright (C) 2017 by Intel Corporation, All Rights Reserved.
5 : : *
6 : : * Redistribution and use in source and binary forms, with or without
7 : : * modification, are permitted provided that the following conditions are met:
8 : : *
9 : : * - Redistributions of source code must retain the above copyright notice,
10 : : * 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 Intel Corporation nor the names of its contributors
17 : : * may be used to endorse or promote products derived from this software
18 : : * 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, THE
22 : : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 : : * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
24 : : * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 : : * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 : : * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 : : * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 : : * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 : : * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 : : * POSSIBILITY OF SUCH DAMAGE.
31 : : */
32 : :
33 : : #include <tinycrypt/aes.h>
34 : : #include <tinycrypt/constants.h>
35 : : #include <tinycrypt/utils.h>
36 : :
37 : : static const uint8_t inv_sbox[256] = {
38 : : 0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e,
39 : : 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87,
40 : : 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32,
41 : : 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e,
42 : : 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49,
43 : : 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16,
44 : : 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50,
45 : : 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84,
46 : : 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05,
47 : : 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02,
48 : : 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41,
49 : : 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73,
50 : : 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8,
51 : : 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89,
52 : : 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b,
53 : : 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4,
54 : : 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59,
55 : : 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d,
56 : : 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d,
57 : : 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61,
58 : : 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63,
59 : : 0x55, 0x21, 0x0c, 0x7d
60 : : };
61 : :
62 : 0 : int tc_aes128_set_decrypt_key(TCAesKeySched_t s, const uint8_t *k)
63 : : {
64 : 0 : return tc_aes128_set_encrypt_key(s, k);
65 : : }
66 : :
67 : : #define mult8(a)(_double_byte(_double_byte(_double_byte(a))))
68 : : #define mult9(a)(mult8(a)^(a))
69 : : #define multb(a)(mult8(a)^_double_byte(a)^(a))
70 : : #define multd(a)(mult8(a)^_double_byte(_double_byte(a))^(a))
71 : : #define multe(a)(mult8(a)^_double_byte(_double_byte(a))^_double_byte(a))
72 : :
73 : 0 : static inline void mult_row_column(uint8_t *out, const uint8_t *in)
74 : : {
75 : 0 : out[0] = multe(in[0]) ^ multb(in[1]) ^ multd(in[2]) ^ mult9(in[3]);
76 : 0 : out[1] = mult9(in[0]) ^ multe(in[1]) ^ multb(in[2]) ^ multd(in[3]);
77 : 0 : out[2] = multd(in[0]) ^ mult9(in[1]) ^ multe(in[2]) ^ multb(in[3]);
78 : 0 : out[3] = multb(in[0]) ^ multd(in[1]) ^ mult9(in[2]) ^ multe(in[3]);
79 : 0 : }
80 : :
81 : 0 : static inline void inv_mix_columns(uint8_t *s)
82 : : {
83 : 0 : uint8_t t[Nb*Nk];
84 : :
85 : 0 : mult_row_column(t, s);
86 : 0 : mult_row_column(&t[Nb], s+Nb);
87 : 0 : mult_row_column(&t[2*Nb], s+(2*Nb));
88 : 0 : mult_row_column(&t[3*Nb], s+(3*Nb));
89 : 0 : (void)_copy(s, sizeof(t), t, sizeof(t));
90 : 0 : }
91 : :
92 : 0 : static inline void add_round_key(uint8_t *s, const unsigned int *k)
93 : : {
94 : 0 : s[0] ^= (uint8_t)(k[0] >> 24); s[1] ^= (uint8_t)(k[0] >> 16);
95 : 0 : s[2] ^= (uint8_t)(k[0] >> 8); s[3] ^= (uint8_t)(k[0]);
96 : 0 : s[4] ^= (uint8_t)(k[1] >> 24); s[5] ^= (uint8_t)(k[1] >> 16);
97 : 0 : s[6] ^= (uint8_t)(k[1] >> 8); s[7] ^= (uint8_t)(k[1]);
98 : 0 : s[8] ^= (uint8_t)(k[2] >> 24); s[9] ^= (uint8_t)(k[2] >> 16);
99 : 0 : s[10] ^= (uint8_t)(k[2] >> 8); s[11] ^= (uint8_t)(k[2]);
100 : 0 : s[12] ^= (uint8_t)(k[3] >> 24); s[13] ^= (uint8_t)(k[3] >> 16);
101 : 0 : s[14] ^= (uint8_t)(k[3] >> 8); s[15] ^= (uint8_t)(k[3]);
102 : 0 : }
103 : :
104 : 0 : static inline void inv_sub_bytes(uint8_t *s)
105 : : {
106 : 0 : unsigned int i;
107 : :
108 [ # # ]: 0 : for (i = 0; i < (Nb*Nk); ++i) {
109 : 0 : s[i] = inv_sbox[s[i]];
110 : : }
111 : 0 : }
112 : :
113 : : /*
114 : : * This inv_shift_rows also implements the matrix flip required for
115 : : * inv_mix_columns, but performs it here to reduce the number of memory
116 : : * operations.
117 : : */
118 : 0 : static inline void inv_shift_rows(uint8_t *s)
119 : : {
120 : 0 : uint8_t t[Nb*Nk];
121 : :
122 : 0 : t[0] = s[0]; t[1] = s[13]; t[2] = s[10]; t[3] = s[7];
123 : 0 : t[4] = s[4]; t[5] = s[1]; t[6] = s[14]; t[7] = s[11];
124 : 0 : t[8] = s[8]; t[9] = s[5]; t[10] = s[2]; t[11] = s[15];
125 : 0 : t[12] = s[12]; t[13] = s[9]; t[14] = s[6]; t[15] = s[3];
126 : 0 : (void)_copy(s, sizeof(t), t, sizeof(t));
127 : 0 : }
128 : :
129 : 0 : int tc_aes_decrypt(uint8_t *out, const uint8_t *in, const TCAesKeySched_t s)
130 : : {
131 : 0 : uint8_t state[Nk*Nb];
132 : 0 : unsigned int i;
133 : :
134 [ # # ]: 0 : if (out == (uint8_t *) 0) {
135 : : return TC_CRYPTO_FAIL;
136 [ # # ]: 0 : } else if (in == (const uint8_t *) 0) {
137 : : return TC_CRYPTO_FAIL;
138 [ # # ]: 0 : } else if (s == (TCAesKeySched_t) 0) {
139 : : return TC_CRYPTO_FAIL;
140 : : }
141 : :
142 : 0 : (void)_copy(state, sizeof(state), in, sizeof(state));
143 : :
144 : 0 : add_round_key(state, s->words + Nb*Nr);
145 : :
146 [ # # ]: 0 : for (i = Nr - 1; i > 0; --i) {
147 : 0 : inv_shift_rows(state);
148 : 0 : inv_sub_bytes(state);
149 : 0 : add_round_key(state, s->words + Nb*i);
150 : 0 : inv_mix_columns(state);
151 : : }
152 : :
153 : 0 : inv_shift_rows(state);
154 : 0 : inv_sub_bytes(state);
155 : 0 : add_round_key(state, s->words);
156 : :
157 : 0 : (void)_copy(out, sizeof(state), state, sizeof(state));
158 : :
159 : : /*zeroing out the state buffer */
160 : 0 : _set(state, TC_ZERO_BYTE, sizeof(state));
161 : :
162 : :
163 : 0 : return TC_CRYPTO_SUCCESS;
164 : : }
|
