3 This file is part of the ARM-Crypto-Lib.
4 Copyright (C) 2006-2010 Daniel Otte (daniel.otte@rub.de)
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.
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.
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/>.
23 * \license GPLv3 or later
31 #include "hashfunction_descriptor.h"
32 #include "hfal-basic.h"
34 #include "string-extras.h"
45 //# include "config.h"
46 //# include <util/delay.h>
49 hfdesc_t* shavs_algo=NULL;
50 hfdesc_t** shavs_algolist=NULL;
52 void shavs_listalgos(void){
57 cli_putstr("\r\nthe following algorithms are available:\r\n");
58 while(option<='z' && (t=shavs_algolist[i])){
60 cli_putc((t==shavs_algo)?'*':' ');
69 void shavs_setalgo(char* param){
70 param = strstrip(param);
71 if(param[1]=='\0'){ /* single letter specified */
72 uint8_t i,option = param[0]-'a';
75 cli_putstr("\r\nERROR: shavs_algolist not set!");
78 for(i=0; i<=option; ++i){
79 if((shavs_algolist[i])==NULL){
80 cli_putstr("\r\nERROR: invalid selection!");
84 shavs_algo=(hfdesc_t*)(shavs_algolist[option]);
85 } else { /* name specified */
88 while((t=shavs_algolist[i]) && strcasecmp(param, t->name)){
94 cli_putstr("\r\nERROR: could not find \"");
103 uint16_t buffersize_B;
110 static shavs_ctx_t shavs_ctx;
112 uint8_t buffer_add(char c){
114 if(shavs_ctx.buffer_idx==shavs_ctx.buffersize_B){
115 hfal_hash_nextBlock(&(shavs_ctx.ctx), shavs_ctx.buffer);
117 shavs_ctx.buffer_idx=0;
120 memset(shavs_ctx.buffer, 0, shavs_ctx.buffersize_B);
122 if(c>='0' && c<='9'){
125 c &= (uint8_t)~('a' ^ 'A');
126 if(c>='A' && c<='F'){
132 t=shavs_ctx.buffer[shavs_ctx.buffer_idx];
133 if(shavs_ctx.in_byte){
135 shavs_ctx.buffer[shavs_ctx.buffer_idx]=t;
136 shavs_ctx.buffer_idx++;
137 shavs_ctx.in_byte = 0;
140 shavs_ctx.buffer[shavs_ctx.buffer_idx]=t;
141 shavs_ctx.in_byte = 1;
146 int32_t getLength(void){
151 memset(lenstr, 0, 21);
152 cli_getsn(lenstr, 20);
153 len2 = strstrip(lenstr);
154 if(!strncasecmp(len2, "LEN", 3)){
155 while(*len2 && *len2!='=')
160 }while(*len2 && !isdigit((uint8_t)*len2));
161 len=(uint32_t)strtoul(len2, NULL, 10);
165 if(!strncasecmp(len2, "EXIT", 4)){
172 void shavs_test1(void){ /* KAT tests */
174 int32_t expect_input=0;
177 cli_putstr("\r\nERROR: select algorithm first!");
181 uint8_t diggest[shavs_algo->hashsize_b/8];
182 shavs_ctx.buffersize_B=shavs_algo->blocksize_b/8;
183 uint8_t buffer[shavs_ctx.buffersize_B+5];
184 shavs_ctx.buffer = buffer;
185 cli_putstr("\r\nbuffer_size = 0x");
186 cli_hexdump_rev(&(shavs_ctx.buffersize_B), 2);
187 cli_putstr(" bytes");
189 shavs_ctx.blocks = 0;
190 memset(buffer, 0, shavs_ctx.buffersize_B);
191 length = getLength();
197 cli_putstr("\r\nLen == ");
198 cli_hexdump_rev(&length, 4);
203 expect_input=((length+7)>>2)&(~1L);
206 cli_putstr("\r\nexpected_input == ");
207 cli_hexdump_rev(&expect_input, 4);
209 cli_putstr("\r\nexpected_input == 0 !!!");
211 shavs_ctx.buffer_idx = 0;
212 shavs_ctx.in_byte = 0;
213 shavs_ctx.blocks = 0;
216 cli_putstr("\r\n HFAL init");
217 cli_putstr("\r\n (2) expected_input == ");
218 cli_hexdump_rev(&expect_input, 4);
220 ret = hfal_hash_init(shavs_algo, &(shavs_ctx.ctx));
222 cli_putstr("\r\n HFAL init returned with: ");
223 cli_hexdump(&ret, 1);
227 cli_putstr("\r\n (3) expected_input == ");
228 cli_hexdump_rev(&expect_input, 4);
231 while((c=cli_getc_cecho())!='M' && c!='m'){
232 if(!isblank((uint8_t)c)){
233 cli_putstr("\r\nERROR: wrong input (1) [0x");
235 cli_putstr("]!\r\n");
236 hfal_hash_free(&(shavs_ctx.ctx));
240 if((c=cli_getc_cecho())!='s' && c!='S'){
241 cli_putstr("\r\nERROR: wrong input (2)!\r\n");
242 hfal_hash_free(&(shavs_ctx.ctx));
245 if((c=cli_getc_cecho())!='g' && c!='G'){
246 cli_putstr("\r\nERROR: wrong input (3)!\r\n");
247 hfal_hash_free(&(shavs_ctx.ctx));
250 while((c=cli_getc_cecho())!='='){
251 if(!isblank((uint8_t)c)){
252 cli_putstr("\r\nERROR: wrong input (4)!\r\n");
253 hfal_hash_free(&(shavs_ctx.ctx));
258 cli_putstr("\r\nparsing started");
260 shavs_ctx.buffer_idx = 0;
261 shavs_ctx.in_byte = 0;
262 shavs_ctx.blocks = 0;
263 while(expect_input>0){
266 cli_putstr("\r\n\t(");
267 cli_hexdump_rev(&expect_input, 4);
270 if(buffer_add(c)==0){
273 if(!isblank((uint16_t)c)){
274 cli_putstr("\r\nERROR: wrong input (5) (");
276 cli_putstr(")!\r\n");
277 hfal_hash_free(&(shavs_ctx.ctx));
283 cli_putstr("\r\nBuffer-A:");
284 cli_hexdump_block(buffer, shavs_ctx.buffersize_B, 5, 8);
286 cli_putstr("\r\n starting finalisation");
287 cli_putstr("\r\n\tblocks == ");
288 cli_hexdump_rev(&(shavs_ctx.blocks),4);
289 cli_putstr("\r\n\tbuffer_idx == ");
290 cli_hexdump_rev(&(shavs_ctx.buffer_idx),2);
291 cli_putstr("\r\n\tin_byte == ");
292 cli_hexdump_rev(&(shavs_ctx.in_byte),1);
294 cli_putstr("\r\n starting last block");
295 cli_putstr("\r\n\tlength == ");
296 cli_hexdump_rev(&length,4);
297 cli_putstr("\r\n\tbuffersize_B == ");
298 cli_hexdump_rev(&(shavs_ctx.buffersize_B),2);
299 uint16_t temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
300 cli_putstr("\r\n\t (temp) == ");
301 cli_hexdump_rev(&temp,2);
302 temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
304 uint16_t temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
306 /* cli_putstr("\r\n\t (temp) == ");
307 cli_hexdump_rev(&temp,2); */
308 hfal_hash_lastBlock( &(shavs_ctx.ctx), buffer, /* be aware of freaking compilers!!! */
309 // length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8));
312 cli_putstr("\r\n starting ctx2hash");
314 hfal_hash_ctx2hash(diggest, &(shavs_ctx.ctx));
316 cli_putstr("\r\n starting hash free");
318 hfal_hash_free(&(shavs_ctx.ctx));
319 cli_putstr("\r\n MD = ");
320 cli_hexdump(diggest, shavs_algo->hashsize_b/8);
325 void shavs_test2(void){ /* Monte Carlo tests for SHA-1 & SHA-2 */
326 uint16_t expected_input;
332 cli_putstr("\r\nERROR: select algorithm first!");
335 uint8_t ml=shavs_algo->hashsize_b/8;
338 while((c=cli_getc_cecho())!='S' && c!='s'){
339 if(!isblank((uint8_t)c)){
340 cli_putstr("\r\nERROR: wrong input (1) [0x");
342 cli_putstr("]!\r\n");
346 if((c=cli_getc_cecho())!='e' && c!='e'){
347 cli_putstr("\r\nERROR: wrong input (2)!\r\n");
350 if((c=cli_getc_cecho())!='e' && c!='e'){
351 cli_putstr("\r\nERROR: wrong input (3)!\r\n");
354 if((c=cli_getc_cecho())!='d' && c!='D'){
355 cli_putstr("\r\nERROR: wrong input (4)!\r\n");
358 while((c=cli_getc_cecho())!='='){
359 if(!isblank((uint8_t)c)){
360 cli_putstr("\r\nERROR: wrong input (5)!\r\n");
364 expected_input = ml*2;
365 memset(m+2*ml, 0, ml);
369 if(c>='0' && c<='9'){
373 if(c>='a' && c<='f'){
388 }while(expected_input);
389 /* so we have the seed */
390 cli_putstr("\r\nstarting processing");
392 for(count=0; count<100; ++count){
393 memcpy(m, m+ml*2, ml);
394 memcpy(m+ml, m+ml*2, ml);
395 for(j=0; j<1000; ++j){
396 hfal_hash_mem(shavs_algo, m+ml*3, m, ml*3*8);
397 memmove(m, m+ml, 3*ml);
399 cli_putstr("\r\n\r\nCOUNT = ");
401 cli_putc(count/10+'0');
403 cli_putc(count%10+'0');
404 cli_putstr("\r\nMD = ");
405 cli_hexdump(m+ml*2, ml);
410 void shavs_test3(void){ /* Monte Carlo tests for SHA-3 */
411 uint16_t expected_input;
417 cli_putstr("\r\nERROR: select algorithm first!");
420 uint8_t ml=shavs_algo->hashsize_b/8;
423 while((c=cli_getc_cecho())!='S' && c!='s'){
424 if(!isblank((uint8_t)c)){
425 cli_putstr("\r\nERROR: wrong input (1) [0x");
427 cli_putstr("]!\r\n");
431 if((c=cli_getc_cecho())!='e' && c!='e'){
432 cli_putstr("\r\nERROR: wrong input (2)!\r\n");
435 if((c=cli_getc_cecho())!='e' && c!='e'){
436 cli_putstr("\r\nERROR: wrong input (3)!\r\n");
439 if((c=cli_getc_cecho())!='d' && c!='D'){
440 cli_putstr("\r\nERROR: wrong input (4)!\r\n");
443 while((c=cli_getc_cecho())!='='){
444 if(!isblank((uint8_t)c)){
445 cli_putstr("\r\nERROR: wrong input (5)!\r\n");
449 expected_input = 1024/4;
450 memset(m+ml, 0, 1024/8);
454 if(c>='0' && c<='9'){
458 if(c>='a' && c<='f'){
473 }while(expected_input);
474 /* so we have the seed */
475 cli_putstr("\r\nstarting processing");
477 for(count=0; count<100; ++count){
478 for(j=0; j<1000; ++j){
479 hfal_hash_mem(shavs_algo, m, m+ml, 1024);
480 memmove(m+ml, m, 1024/8);
482 cli_putstr("\r\n\r\nj = ");
484 cli_putc(count/10+'0');
486 cli_putc(count%10+'0');
487 cli_putstr("\r\nMD = ");
488 cli_hexdump(m+ml, ml);