495 lines
12 KiB
C
495 lines
12 KiB
C
/* shavs.c */
|
|
/*
|
|
This file is part of the AVR-Crypto-Lib.
|
|
Copyright (C) 2006 2007 2008 2009 Daniel Otte (daniel.otte@rub.de)
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* \file shavs.c
|
|
* \author Daniel Otte
|
|
* \date 2006-05-16
|
|
* \license GPLv3 or later
|
|
*
|
|
*/
|
|
|
|
#include <avr/pgmspace.h>
|
|
#include <stdint.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <ctype.h>
|
|
#include "hashfunction_descriptor.h"
|
|
#include "hfal-basic.h"
|
|
#include "shavs.h"
|
|
#include "string-extras.h"
|
|
#include "cli.h"
|
|
|
|
|
|
#ifdef DEBUG
|
|
# undef DEBUG
|
|
#endif
|
|
|
|
#define DEBUG 0
|
|
|
|
#if DEBUG
|
|
# include "config.h"
|
|
# include <util/delay.h>
|
|
#endif
|
|
|
|
hfdesc_t* shavs_algo=NULL;
|
|
hfdesc_t** shavs_algolist=NULL;
|
|
|
|
#define shavs_out_file stdout
|
|
|
|
void shavs_listalgos(void){
|
|
char option = 'a';
|
|
|
|
hfdesc_t* t;
|
|
uint8_t i=0;
|
|
fputs_P(PSTR("\nthe following algorithms are available:\n"), shavs_out_file);
|
|
while(option <= 'z' && (t = (hfdesc_t*)pgm_read_word(&(shavs_algolist[i])))){
|
|
fprintf_P(shavs_out_file, PSTR("\t%c%c:\t%S\n"),
|
|
(t == shavs_algo) ? '*' : ' ', option++, pgm_read_word(&(t->name)));
|
|
i++;
|
|
}
|
|
}
|
|
|
|
void shavs_setalgo(char* param){
|
|
param = strstrip(param);
|
|
if(param[1]=='\0'){ /* single letter specified */
|
|
uint8_t i, option = param[0] - 'a';
|
|
|
|
if(!shavs_algolist){
|
|
fputs_P(PSTR("\nERROR: shavs_algolist not set!"), shavs_out_file);
|
|
return;
|
|
}
|
|
for(i=0; i<=option; ++i){
|
|
if((void*)pgm_read_word(&(shavs_algolist[i]))==NULL){
|
|
fputs_P(PSTR("\r\nERROR: invalid selection!"), shavs_out_file);
|
|
return;
|
|
}
|
|
}
|
|
shavs_algo=(hfdesc_t*)pgm_read_word(&(shavs_algolist[option]));
|
|
} else { /* name specifyed */
|
|
hfdesc_t* t=NULL;
|
|
uint8_t i=0;
|
|
while((t=(hfdesc_t*)pgm_read_word(&(shavs_algolist[i]))) &&
|
|
strcasecmp_P(param, (void*)pgm_read_word(&(t->name))))
|
|
++i;
|
|
if(t){
|
|
shavs_algo=t;
|
|
}else{
|
|
fprintf_P(shavs_out_file, PSTR("\nERROR: could not find \"%s\"!"), param);
|
|
cli_putstr_P(PSTR("\r\nERROR: could not find \""));
|
|
cli_putstr(param);
|
|
cli_putstr_P(PSTR("\"!"));
|
|
}
|
|
}
|
|
}
|
|
|
|
typedef struct {
|
|
uint16_t buffer_idx;
|
|
uint16_t buffersize_B;
|
|
uint32_t blocks;
|
|
hfgen_ctx_t ctx;
|
|
uint8_t* buffer;
|
|
uint8_t in_byte;
|
|
} shavs_ctx_t;
|
|
|
|
static shavs_ctx_t shavs_ctx;
|
|
|
|
uint8_t buffer_add(char c){
|
|
uint8_t v,t;
|
|
if(shavs_ctx.buffer_idx==shavs_ctx.buffersize_B){
|
|
hfal_hash_nextBlock(&(shavs_ctx.ctx), shavs_ctx.buffer);
|
|
++shavs_ctx.blocks;
|
|
shavs_ctx.buffer_idx=0;
|
|
cli_putc('.');
|
|
}
|
|
if(c>='0' && c<='9'){
|
|
v=c-'0';
|
|
}else{
|
|
c &= (uint8_t)~('a' ^ 'A');
|
|
if(c>='A' && c<='F'){
|
|
v=c-'A'+10;
|
|
}else{
|
|
return 1;
|
|
}
|
|
}
|
|
t=shavs_ctx.buffer[shavs_ctx.buffer_idx];
|
|
if(shavs_ctx.in_byte){
|
|
t |= v;
|
|
shavs_ctx.buffer[shavs_ctx.buffer_idx] = t;
|
|
shavs_ctx.buffer_idx++;
|
|
shavs_ctx.in_byte = 0;
|
|
}else{
|
|
t = v<<4;
|
|
shavs_ctx.buffer[shavs_ctx.buffer_idx] = t;
|
|
shavs_ctx.in_byte = 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static
|
|
uint32_t my_strtoul(const char* str){
|
|
uint32_t r=0;
|
|
while(*str && (*str<'0' || *str>'9')){
|
|
str++;
|
|
}
|
|
if(!*str){
|
|
return 0;
|
|
}
|
|
while(*str && (*str>='0' && *str<='9')){
|
|
r *= 10;
|
|
r += *str-'0';
|
|
str++;
|
|
}
|
|
return r;
|
|
}
|
|
|
|
int32_t getLength(void){
|
|
uint32_t len=0;
|
|
char lenstr[21];
|
|
char* len2;
|
|
for(;;){
|
|
memset(lenstr, 0, 21);
|
|
cli_getsn_cecho(lenstr, 20);
|
|
len2 = strstrip(lenstr);
|
|
if(!strncasecmp_P(len2, PSTR("LEN"), 3)){
|
|
while(*len2 && *len2!='=')
|
|
len2++;
|
|
if(*len2=='='){
|
|
do{
|
|
len2++;
|
|
}while(*len2 && !isdigit((uint8_t)*len2));
|
|
len = my_strtoul(len2);
|
|
//len=(uint32_t)strtoul(len2, NULL, 10);
|
|
return len;
|
|
}
|
|
} else {
|
|
if(!strncasecmp_P(len2, PSTR("EXIT"), 4)){
|
|
return -1;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
void shavs_test1(void){ /* KAT tests */
|
|
uint32_t length=0;
|
|
int32_t expect_input=0;
|
|
|
|
if(!shavs_algo){
|
|
fputs_P(PSTR("\r\nERROR: select algorithm first!"), shavs_out_file);
|
|
return;
|
|
}
|
|
char c;
|
|
uint8_t diggest[pgm_read_word(&(shavs_algo->hashsize_b))/8];
|
|
shavs_ctx.buffersize_B=pgm_read_word(&(shavs_algo->blocksize_b))/8;
|
|
uint8_t buffer[shavs_ctx.buffersize_B+5];
|
|
shavs_ctx.buffer = buffer;
|
|
fprintf_P(shavs_out_file, PSTR("\nbuffer_size = 0x%04"PRIx16" bytes"));
|
|
for(;;){
|
|
shavs_ctx.blocks = 0;
|
|
memset(buffer, 0, shavs_ctx.buffersize_B);
|
|
length = getLength();
|
|
if(length<0){
|
|
return;
|
|
}
|
|
|
|
#if DEBUG
|
|
fprintf_P(shavs_out_file, PSTR("\nLen == %"PRIu32), length)
|
|
#endif
|
|
if(length==0){
|
|
expect_input=2;
|
|
}else{
|
|
expect_input=((length + 7) >> 2) & (~1L);
|
|
}
|
|
#if DEBUG
|
|
fprintf_P(shavs_out_file, PSTR("\r\nexpected_input == %"PRId32), expected_input);
|
|
#endif
|
|
shavs_ctx.buffer_idx = 0;
|
|
shavs_ctx.in_byte = 0;
|
|
shavs_ctx.blocks = 0;
|
|
uint8_t ret;
|
|
#if DEBUG
|
|
fprintf_P(shavs_out_file, PSTR("\n HFAL init\n (2) expected_input == "), expected_input);
|
|
#endif
|
|
ret = hfal_hash_init(shavs_algo, &(shavs_ctx.ctx));
|
|
if(ret){
|
|
fprintf_P(shavs_out_file, PSTR("\r\n HFAL init returned with: %"PRIx8), ret);
|
|
return;
|
|
}
|
|
#if DEBUG
|
|
fprintf_P(shavs_out_file, PSTR("\r\n (3) expected_input == %"PRId32"\n"), expected_input)
|
|
#endif
|
|
while((c=cli_getc_cecho())!='M' && c!='m'){
|
|
if(!isblank(c)){
|
|
fprintf_P(shavs_out_file, PSTR("\nERROR: wrong input (1) [0x%"PRIx8"]!\n"), c);
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
return;
|
|
}
|
|
}
|
|
if((c=cli_getc_cecho())!='s' && c!='S'){
|
|
fputs_P(PSTR("\nERROR: wrong input (2)!\n"), shavs_out_file);
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
return;
|
|
}
|
|
if((c=cli_getc_cecho())!='g' && c!='G'){
|
|
fputs_P(PSTR("\nERROR: wrong input (3)!\n"), shavs_out_file);
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
return;
|
|
}
|
|
while((c=cli_getc_cecho())!='='){
|
|
if(!isblank(c)){
|
|
fputs_P(PSTR("\nERROR: wrong input (4)!\n"), shavs_out_file);
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
return;
|
|
}
|
|
}
|
|
#if DEBUG
|
|
fputs_P(PSTR("\r\nparsing started"), shavs_out_file);
|
|
#endif
|
|
shavs_ctx.buffer_idx = 0;
|
|
shavs_ctx.in_byte = 0;
|
|
shavs_ctx.blocks = 0;
|
|
while(expect_input>0){
|
|
c=cli_getc_cecho();
|
|
#if DEBUG
|
|
fprintf_P(shavs_out_file, PSTR("\n\t(%"PRId32") "), expected_input);
|
|
_delay_ms(500);
|
|
#endif
|
|
if(buffer_add(c)==0){
|
|
--expect_input;
|
|
}else{
|
|
if(!isblank((uint16_t)c)){
|
|
fprintf_P(shavs_out_file, PSTR("\nERROR: wrong input (5) (%c)!\n"), c);
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
#if DEBUG
|
|
cli_putstr_P(PSTR("\r\nBuffer-A:"));
|
|
cli_hexdump_block(buffer, shavs_ctx.buffersize_B, 5, 8);
|
|
|
|
cli_putstr_P(PSTR("\r\n starting finalisation"));
|
|
cli_putstr_P(PSTR("\r\n\tblocks == "));
|
|
cli_hexdump_rev(&(shavs_ctx.blocks),4);
|
|
cli_putstr_P(PSTR("\r\n\tbuffer_idx == "));
|
|
cli_hexdump_rev(&(shavs_ctx.buffer_idx),2);
|
|
cli_putstr_P(PSTR("\r\n\tin_byte == "));
|
|
cli_hexdump_rev(&(shavs_ctx.in_byte),1);
|
|
_delay_ms(500);
|
|
|
|
cli_putstr_P(PSTR("\r\n starting last block"));
|
|
cli_putstr_P(PSTR("\r\n\tlength == "));
|
|
cli_hexdump_rev(&length,4);
|
|
cli_putstr_P(PSTR("\r\n\tbuffersize_B == "));
|
|
cli_hexdump_rev(&(shavs_ctx.buffersize_B),2);
|
|
uint16_t temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
|
|
cli_putstr_P(PSTR("\r\n\t (temp) == "));
|
|
cli_hexdump_rev(&temp,2);
|
|
_delay_ms(500);
|
|
temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
|
|
#else
|
|
uint16_t temp=length-(shavs_ctx.blocks)*((shavs_ctx.buffersize_B)*8);
|
|
#endif
|
|
hfal_hash_lastBlock( &(shavs_ctx.ctx), buffer, /* be aware of freaking compilers!!! */
|
|
temp );
|
|
#if DEBUG
|
|
cli_putstr_P(PSTR("\r\n starting ctx2hash"));
|
|
_delay_ms(500);
|
|
#endif
|
|
hfal_hash_ctx2hash(diggest, &(shavs_ctx.ctx));
|
|
#if DEBUG
|
|
cli_putstr_P(PSTR("\r\n starting hash free"));
|
|
#endif
|
|
hfal_hash_free(&(shavs_ctx.ctx));
|
|
cli_putstr_P(PSTR("\r\n MD = "));
|
|
cli_hexdump(diggest, pgm_read_word(&(shavs_algo->hashsize_b))/8);
|
|
|
|
}
|
|
}
|
|
|
|
void shavs_test2(void){ /* Monte Carlo tests for SHA-1 & SHA-2 */
|
|
uint16_t expected_input;
|
|
uint16_t count;
|
|
uint8_t v;
|
|
uint8_t index=0;
|
|
char c;
|
|
if(!shavs_algo){
|
|
cli_putstr_P(PSTR("\r\nERROR: select algorithm first!"));
|
|
return;
|
|
}
|
|
uint8_t ml=pgm_read_word(&(shavs_algo->hashsize_b))/8;
|
|
uint8_t m[ml*4+8];
|
|
for(;;){
|
|
while((c=cli_getc_cecho())!='S' && c!='s'){
|
|
if(!isblank(c)){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (1) [0x"));
|
|
cli_hexdump(&c, 1);
|
|
cli_putstr_P(PSTR("]!\r\n"));
|
|
return;
|
|
}
|
|
}
|
|
if((c=cli_getc_cecho())!='e' && c!='e'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (2)!\r\n"));
|
|
return;
|
|
}
|
|
if((c=cli_getc_cecho())!='e' && c!='e'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (3)!\r\n"));
|
|
return;
|
|
}
|
|
if((c=cli_getc_cecho())!='d' && c!='D'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (4)!\r\n"));
|
|
return;
|
|
}
|
|
while((c=cli_getc_cecho())!='='){
|
|
if(!isblank(c)){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (5)!\r\n"));
|
|
return;
|
|
}
|
|
}
|
|
expected_input = ml*2;
|
|
memset(m+2*ml, 0, ml);
|
|
do{
|
|
v=0xff;
|
|
c=cli_getc_cecho();
|
|
if(c>='0' && c<='9'){
|
|
v = c - '0';
|
|
}else{
|
|
c |= 'A'^'a';
|
|
if(c>='a' && c<='f'){
|
|
v = c - 'a' +10;
|
|
}
|
|
}
|
|
if(v<0x10){
|
|
c=m[ml*2+index/2];
|
|
if(index&1){
|
|
c |= v;
|
|
}else{
|
|
c |=v<<4;
|
|
}
|
|
m[ml*2+index/2]=c;
|
|
index++;
|
|
expected_input--;
|
|
}
|
|
}while(expected_input);
|
|
/* so we have the seed */
|
|
cli_putstr_P(PSTR("\r\nstarting processing"));
|
|
uint16_t j;
|
|
for(count=0; count<100; ++count){
|
|
memcpy(m, m+ml*2, ml);
|
|
memcpy(m+ml, m+ml*2, ml);
|
|
for(j=0; j<1000; ++j){
|
|
hfal_hash_mem(shavs_algo, m+ml*3, m, ml*3*8);
|
|
memmove(m, m+ml, 3*ml);
|
|
}
|
|
cli_putstr_P(PSTR("\r\n\r\nCOUNT = "));
|
|
if(count>=10){
|
|
cli_putc(count/10+'0');
|
|
}
|
|
cli_putc(count%10+'0');
|
|
cli_putstr_P(PSTR("\r\nMD = "));
|
|
cli_hexdump(m+ml*2, ml);
|
|
}
|
|
}
|
|
}
|
|
|
|
void shavs_test3(void){ /* Monte Carlo tests for SHA-3 */
|
|
uint16_t expected_input;
|
|
uint16_t count;
|
|
uint8_t v;
|
|
uint8_t index=0;
|
|
char c;
|
|
if(!shavs_algo){
|
|
cli_putstr_P(PSTR("\r\nERROR: select algorithm first!"));
|
|
return;
|
|
}
|
|
uint8_t ml=pgm_read_word(&(shavs_algo->hashsize_b))/8;
|
|
uint8_t m[ml+128];
|
|
for(;;){
|
|
while((c=cli_getc_cecho())!='S' && c!='s'){
|
|
if(!isblank(c)){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (1) [0x"));
|
|
cli_hexdump(&c, 1);
|
|
cli_putstr_P(PSTR("]!\r\n"));
|
|
return;
|
|
}
|
|
}
|
|
if((c=cli_getc_cecho())!='e' && c!='e'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (2)!\r\n"));
|
|
return;
|
|
}
|
|
if((c=cli_getc_cecho())!='e' && c!='e'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (3)!\r\n"));
|
|
return;
|
|
}
|
|
if((c=cli_getc_cecho())!='d' && c!='D'){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (4)!\r\n"));
|
|
return;
|
|
}
|
|
while((c=cli_getc_cecho())!='='){
|
|
if(!isblank(c)){
|
|
cli_putstr_P(PSTR("\r\nERROR: wrong input (5)!\r\n"));
|
|
return;
|
|
}
|
|
}
|
|
expected_input = 1024/4;
|
|
memset(m+ml, 0, 1024/8);
|
|
do{
|
|
v=0xff;
|
|
c=cli_getc_cecho();
|
|
if(c>='0' && c<='9'){
|
|
v = c - '0';
|
|
}else{
|
|
c |= 'A'^'a';
|
|
if(c>='a' && c<='f'){
|
|
v = c - 'a' +10;
|
|
}
|
|
}
|
|
if(v<0x10){
|
|
c=m[ml+index/2];
|
|
if(index&1){
|
|
c |= v;
|
|
}else{
|
|
c |=v<<4;
|
|
}
|
|
m[ml+index/2]=c;
|
|
index++;
|
|
expected_input--;
|
|
}
|
|
}while(expected_input);
|
|
/* so we have the seed */
|
|
cli_putstr_P(PSTR("\r\nstarting processing"));
|
|
uint16_t j;
|
|
for(count=0; count<100; ++count){
|
|
for(j=0; j<1000; ++j){
|
|
hfal_hash_mem(shavs_algo, m, m+ml, 1024);
|
|
memmove(m+ml, m, 1024/8);
|
|
}
|
|
cli_putstr_P(PSTR("\r\n\r\nj = "));
|
|
if(count>=10){
|
|
cli_putc(count/10+'0');
|
|
}
|
|
cli_putc(count%10+'0');
|
|
cli_putstr_P(PSTR("\r\nMD = "));
|
|
cli_hexdump(m+ml, ml);
|
|
|
|
}
|
|
}
|
|
}
|