1 /*
2 * Copyright (c) 2015 South Silicon Valley Microelectronics Inc.
3 * Copyright (c) 2015 iComm Corporation
4 *
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12 * See the GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this program. If not, see <http://www.gnu.org/licenses/>.
15 */
16
17 #include <linux/kernel.h>
18 #include <linux/string.h>
19 #define SHA256_BLOCK_SIZE 64
20 #define SHA256_DIGEST_SIZE 32
21 typedef enum{
22 FALSE = 0,
23 TRUE = 1
24 }CsrBool;
25 #define BYTES_PER_WORD 4
26 #define BYTE_LEN 8
27 #define WORD_LEN (BYTE_LEN * BYTES_PER_WORD)
28 #define TEXT_LEN 128
29 #define MK_LEN (TEXT_LEN / WORD_LEN)
30 #define RK_LEN 32
31 #define TEXT_BYTES (TEXT_LEN / BYTE_LEN)
32 #define CK_INCREMENT 7
33 #define KEY_MULTIPLIER 0x80040100
34 #define TEXT_MULTIPLIER 0xa0202080
35 #define FK_PARAMETER_0 0xa3b1bac6
36 #define FK_PARAMETER_1 0x56aa3350
37 #define FK_PARAMETER_2 0x677d9197
38 #define FK_PARAMETER_3 0xb27022dc
39 static const u8 S_Box[] = {
40 0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
41 0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
42 0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
43 0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
44 0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
45 0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
46 0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
47 0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
48 0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
49 0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
50 0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
51 0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
52 0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
53 0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
54 0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
55 0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48 };
56 static const u32 FK_Parameter[] = { FK_PARAMETER_0, FK_PARAMETER_1, FK_PARAMETER_2, FK_PARAMETER_3 };
57 static const u8 S_XState[] = {
58 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
59 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
60 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
61 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
62 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
63 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
64 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
65 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
66 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
67 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
68 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
69 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
70 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,
71 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
72 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1,
73 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0
74 };
75 static const u32 g_NextInputTable[RK_LEN] =
76 {
77 0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
78 0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
79 0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
80 0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
81 0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
82 0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
83 0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
84 0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279
85 };
86 static const u32 CipherDataIdx[MK_LEN][MK_LEN] =
87 {
88 {3, 2, 1, 0},
89 {0, 3, 2, 1},
90 {1, 0 ,3, 2},
91 {2, 1, 0, 3}
92 };
93 #define PARITY_MACRO(Value) (S_XState[(Value) >> 24] ^ S_XState[((Value) >> 16) & 0xFF] ^ S_XState[((Value) >> 8) & 0xFF] ^ S_XState[(Value) & 0xFF])
94 #define XOR_MACRO(A,B) ((A) ^ (B))
95 #define L_TRANSFORM_MACRO(Word,Key) MultiplyCircular(Word, Key ? KEY_MULTIPLIER : TEXT_MULTIPLIER )
T_Transform(u32 Word)96 static u32 T_Transform(u32 Word)
97 {
98 u32 j;
99 u32 New_Word;
100 int offset = 0;
101 New_Word = 0;
102 for (j = 0; j < MK_LEN; j++)
103 {
104 New_Word = (New_Word << BYTE_LEN);
105 offset = ((u32)(Word >> (WORD_LEN - BYTE_LEN))) & ((u32)((1 << BYTE_LEN) - 1));
106 New_Word = New_Word | (u32)S_Box[offset];
107 Word = (Word << BYTE_LEN);
108 }
109 return (New_Word);
110 }
MultiplyCircular(u32 Word,u32 Basis)111 static u32 MultiplyCircular(u32 Word, u32 Basis)
112 {
113 u32 New_Word;
114 u32 i;
115 New_Word = 0;
116 for (i = 0; i < WORD_LEN; i++)
117 {
118 New_Word = (New_Word << 1) | PARITY_MACRO(Word & Basis);
119 Basis = (Basis >> 1) | ((Basis & 1) << (WORD_LEN - 1));
120 }
121 return (New_Word);
122 }
Iterate(CsrBool Key,u32 Next_Input,u32 * Cipher_Text,u32 curIdx)123 static u32 Iterate(CsrBool Key, u32 Next_Input, u32 *Cipher_Text, u32 curIdx)
124 {
125 u32 New_State;
126 New_State = Next_Input;
127 New_State = XOR_MACRO(New_State, Cipher_Text[CipherDataIdx[curIdx][0]]);
128 New_State = XOR_MACRO(New_State, Cipher_Text[CipherDataIdx[curIdx][1]]);
129 New_State = XOR_MACRO(New_State, Cipher_Text[CipherDataIdx[curIdx][2]]);
130 New_State = L_TRANSFORM_MACRO(T_Transform(New_State), Key);
131 New_State = XOR_MACRO(New_State, Cipher_Text[CipherDataIdx[curIdx][3]]);
132 Cipher_Text[curIdx] = New_State;
133 return (New_State);
134 }
CalculateEnKey(u8 * Key,u32 * Key_Store)135 static void CalculateEnKey(u8 *Key, u32 *Key_Store)
136 {
137 u32 Cipher_Text[MK_LEN];
138 u32 Next, i, j, Next_Input;
139 for (j = 0; j < MK_LEN; j++)
140 {
141 Next = 0;
142 for (i = 0; i < BYTES_PER_WORD; i++)
143 {
144 Next = (Next << BYTE_LEN);
145 Next = Next | Key[(j <<2) + i];
146 }
147 Cipher_Text[j] = XOR_MACRO(Next, FK_Parameter[j]);
148 }
149 for (i = 0; i < RK_LEN; i++)
150 {
151 Next_Input = g_NextInputTable[i];
152 Key_Store[i] = Iterate(TRUE, Next_Input, Cipher_Text, i & (MK_LEN - 1));
153 }
154 }
SMS4_Run(u32 * Key_Store,u8 * PlainText,u8 * CipherText)155 static void SMS4_Run(u32 *Key_Store, u8 *PlainText, u8 *CipherText)
156 {
157 u32 i, j;
158 u32 Next;
159 u32 Next_Input;
160 u32 Plain_Text[MK_LEN];
161 for (j = 0; j < MK_LEN; j++)
162 {
163 Next = 0;
164 for (i = 0; i < BYTES_PER_WORD; i++)
165 {
166 Next = (Next << BYTE_LEN);
167 Next = Next | PlainText[(j<<2) + i];
168 }
169 Plain_Text[j] = Next;
170 }
171 for (i = 0; i < RK_LEN; i++)
172 {
173 Next_Input = Key_Store[i];
174 (void)Iterate(FALSE, Next_Input, Plain_Text, i & (MK_LEN - 1));
175 }
176 for (j = 0; j < MK_LEN; j++)
177 {
178 Next = Plain_Text[(MK_LEN - 1) - j];
179 for (i = 0; i < BYTES_PER_WORD; i++)
180 {
181 CipherText[(j << 2) + i] = (u8)((Next >> (WORD_LEN - BYTE_LEN)) & ((1 << BYTE_LEN) - 1));
182 Next = (Next << BYTE_LEN);
183 }
184 }
185 }
WapiCryptoSms4(u8 * iv,u8 * key,u8 * input,u32 length,u8 * output)186 void WapiCryptoSms4(u8 *iv, u8 *key, u8 *input, u32 length, u8 *output)
187 {
188 u32 i;
189 u8 sms4Output[TEXT_BYTES];
190 u8 tmp_data[TEXT_BYTES];
191 u32 Key_Store[RK_LEN];
192 u32 j = 0;
193 u8 * p[2];
194 p[0] = sms4Output;
195 p[1] = tmp_data;
196 memcpy(tmp_data, iv, TEXT_BYTES);
197 CalculateEnKey(key, Key_Store);
198 for (i = 0; i < length; i++)
199 {
200 if ((i & (TEXT_BYTES - 1)) == 0)
201 {
202 SMS4_Run(Key_Store, p[1-j], p[j]);
203 j = 1 - j;
204 }
205 output[i] = input[i] ^ p[1-j][i & (TEXT_BYTES - 1)];
206 }
207 }
WapiCryptoSms4Mic(u8 * iv,u8 * key,u8 * header,u32 headerLength,const u8 * input,u32 dataLength,u8 * mic)208 void WapiCryptoSms4Mic(u8 *iv, u8 *key, u8 *header, u32 headerLength,
209 const u8 *input, u32 dataLength, u8 *mic)
210 {
211 u32 i, j = 0, totalLength;
212 u8 sms4Output[TEXT_BYTES], sms4Input[TEXT_BYTES];
213 u32 tmp_headerLength = 0;
214 u32 tmp_dataLength = 0;
215 u32 header_cnt = 0 ;
216 u32 header0_cnt = 0;
217 u32 data_cnt = 0;
218 u32 data0_cnt = 0;
219 u32 Key_Store[RK_LEN];
220 memcpy(sms4Input, iv, TEXT_BYTES);
221 totalLength = headerLength + dataLength;
222 tmp_headerLength = ((headerLength & (TEXT_BYTES-1)) == 0) ? 0 : (TEXT_BYTES - (headerLength & (TEXT_BYTES-1)));
223 tmp_dataLength = ((dataLength & (TEXT_BYTES-1)) == 0) ? 0 : (TEXT_BYTES - (dataLength & (TEXT_BYTES-1)));
224 totalLength += tmp_headerLength;
225 totalLength += tmp_dataLength;
226 CalculateEnKey(key, Key_Store);
227 for (i = 0; i < totalLength; i++)
228 {
229 if ((i & (TEXT_BYTES-1)) == 0)
230 {
231 SMS4_Run(Key_Store, sms4Input, sms4Output);
232 }
233 if ((dataLength == 0) && (headerLength == 0))
234 {
235 sms4Input[i & (TEXT_BYTES-1)] = 0 ^ sms4Output[i & (TEXT_BYTES-1)];
236 data0_cnt++;
237 }
238 else if ( (headerLength == 0) && (tmp_headerLength == 0) )
239 {
240 sms4Input[i & (TEXT_BYTES-1)] = input[j] ^ sms4Output[i & (TEXT_BYTES-1)];
241 j++;
242 dataLength--;
243 data_cnt++;
244 }
245 else if( headerLength == 0 )
246 {
247 sms4Input[i & (TEXT_BYTES-1)] = 0 ^ sms4Output[i & (TEXT_BYTES-1)];
248 tmp_headerLength--;
249 header0_cnt++;
250 }
251 else
252 {
253 sms4Input[i & (TEXT_BYTES-1)] = header[i] ^ sms4Output[i & (TEXT_BYTES-1)];
254 headerLength--;
255 header_cnt++;
256 }
257 }
258 SMS4_Run(Key_Store, sms4Input, mic);
259 }
260