X-Git-Url: https://git.cryptolib.org/?p=avr-crypto-lib.git;a=blobdiff_plain;f=test_src%2Fnessie_hash_test.c;h=afcd7aeb79bad0f02ef9524ba1372e196c7aea7b;hp=a870b8283ca58dc09ce69b76bee89f8ee4d30cd2;hb=4b5da1dc27a791b5c448274a3db09cd035b33493;hpb=2159c273c9d3361571a6ff1ab63d9bc76582fbab diff --git a/test_src/nessie_hash_test.c b/test_src/nessie_hash_test.c index a870b82..afcd7ae 100644 --- a/test_src/nessie_hash_test.c +++ b/test_src/nessie_hash_test.c @@ -1,7 +1,7 @@ /* nessie_hash_test.c */ /* - This file is part of the Crypto-avr-lib/microcrypt-lib. - Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de) + This file is part of the AVR-Crypto-Lib. + Copyright (C) 2006-2015 Daniel Otte (bg@nerilex.org) 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 @@ -19,7 +19,7 @@ /** * * author: Daniel Otte - * email: daniel.otte@rub.de + * email: bg@nerilex.org * license: GPLv3 * * a suit for running the nessie-tests for hashes @@ -27,28 +27,36 @@ * */ #include #include +#include #include "nessie_hash_test.h" #include "nessie_common.h" -#include "uart.h" +#include "dbz_strings.h" nessie_hash_ctx_t nessie_hash_ctx; +uint8_t nessie_hash_quick=0; + +#define HASHSIZE_B ((nessie_hash_ctx.hashsize_b+7)/8) +#define BLOCKSIZE_B (nessie_hash_ctx.blocksize_B) static -void ascii_hash(char* data, char* desc){ +void ascii_hash_P(PGM_P data, PGM_P desc){ uint8_t ctx[nessie_hash_ctx.ctx_size_B]; - uint8_t hash[(nessie_hash_ctx.hashsize_b+7)/8]; + uint8_t hash[HASHSIZE_B]; uint16_t sl; + uint8_t buffer[BLOCKSIZE_B]; - uart_putstr_P(PSTR("\r\n message=")); - uart_putstr(desc); + fputs_P(PSTR("\n message="), stdout); + fputs_P(desc, stdout); nessie_hash_ctx.hash_init(ctx); - sl = strlen(data); - while(sl>=nessie_hash_ctx.blocksize_B){ - nessie_hash_ctx.hash_next(data, ctx); - data += nessie_hash_ctx.blocksize_B; - sl -= nessie_hash_ctx.blocksize_B; + sl = strlen_P(data); + while(sl>=BLOCKSIZE_B){ + memcpy_P(buffer, data, BLOCKSIZE_B); + nessie_hash_ctx.hash_next(ctx, buffer); + data += BLOCKSIZE_B; + sl -= BLOCKSIZE_B; } - nessie_hash_ctx.hash_last(data, sl*8, ctx); + memcpy_P(buffer, data, sl); + nessie_hash_ctx.hash_last(ctx, buffer, sl*8); nessie_hash_ctx.hash_conv(hash, ctx); nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8); } @@ -61,16 +69,18 @@ void amillion_hash(void){ uint8_t hash[(nessie_hash_ctx.hashsize_b+7)/8]; uint8_t block[nessie_hash_ctx.blocksize_B]; uint32_t n=1000000LL; + uint16_t i=0; - uart_putstr_P(PSTR("\r\n message=")); - uart_putstr_P(PSTR("1 million times \"a\"")); + fputs_P(PSTR("\n message="), stdout); + fputs_P(PSTR("1 million times \"a\""), stdout); memset(block, 'a', nessie_hash_ctx.blocksize_B); nessie_hash_ctx.hash_init(ctx); while(n>=nessie_hash_ctx.blocksize_B){ - nessie_hash_ctx.hash_next(block, ctx); + nessie_hash_ctx.hash_next(ctx, block); n -= nessie_hash_ctx.blocksize_B; + NESSIE_SEND_ALIVE_A(i++); } - nessie_hash_ctx.hash_last(block, n*8, ctx); + nessie_hash_ctx.hash_last(ctx, block, n*8); nessie_hash_ctx.hash_conv(hash, ctx); nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8); } @@ -82,25 +92,16 @@ void zero_hash(uint16_t n){ uint8_t hash[(nessie_hash_ctx.hashsize_b+7)/8]; uint8_t block[nessie_hash_ctx.blocksize_B]; - uart_putstr_P(PSTR("\r\n message=")); - if(n>=10000) - uart_putc('0'+n/10000); - if(n>=1000) - uart_putc('0'+(n/1000)%10); - if(n>=100) - uart_putc('0'+(n/100)%10); - if(n>=10) - uart_putc('0'+(n/10)%10); - uart_putc('0'+n%10); - uart_putstr_P(PSTR(" zero bits")); + fputs_P(PSTR("\n message="), stdout); + fprintf_P(stdout, PSTR("%"PRIu16" zero bits")); memset(block, 0, nessie_hash_ctx.blocksize_B); nessie_hash_ctx.hash_init(ctx); while(n>=nessie_hash_ctx.blocksize_B*8){ - nessie_hash_ctx.hash_next(block, ctx); + nessie_hash_ctx.hash_next(ctx, block); n -= nessie_hash_ctx.blocksize_B*8; } - nessie_hash_ctx.hash_last(block, n, ctx); + nessie_hash_ctx.hash_last(ctx, block, n); nessie_hash_ctx.hash_conv(hash, ctx); nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8); } @@ -111,38 +112,24 @@ void one_in512_hash(uint16_t pos){ uint8_t hash[(nessie_hash_ctx.hashsize_b+7)/8]; uint8_t block[nessie_hash_ctx.blocksize_B]; uint16_t n=512; - char* tab[8]={"80", "40", "20", "10", - "08", "04", "02", "01" }; + char *tab[8] = { "80", "40", "20", "10", + "08", "04", "02", "01" }; pos&=511; - uart_putstr_P(PSTR("\r\n message=")); - uart_putstr_P(PSTR("512-bit string: ")); - if((pos/8) >=10){ - uart_putc('0'+(pos/8/10)%10); - } else { - uart_putc(' '); - } - uart_putc('0'+(pos/8)%10); - uart_putstr_P(PSTR("*00,")); - uart_putstr(tab[pos&7]); - uart_putc(','); - if(63-(pos/8) >=10){ - uart_putc('0'+((63-pos/8)/10)%10); - } else { - uart_putc(' '); - } - uart_putc('0'+(63-pos/8)%10); - uart_putstr_P(PSTR("*00")); + fputs_P(PSTR("\n message="), stdout); + fputs_P(PSTR("512-bit string: "), stdout); + + fprintf_P(stdout, PSTR("%2"PRIu16"*00,%s,%2"PRIu16"*00"), pos / 8, tab[pos & 7], 63 - pos / 8); /* now the real stuff */ memset(block, 0, 512/8); block[pos>>3] = 0x80>>(pos&0x7); nessie_hash_ctx.hash_init(ctx); while(n>=nessie_hash_ctx.blocksize_B*8){ - nessie_hash_ctx.hash_next(block, ctx); + nessie_hash_ctx.hash_next(ctx, block); n -= nessie_hash_ctx.blocksize_B*8; } - nessie_hash_ctx.hash_last(block, n, ctx); + nessie_hash_ctx.hash_last(ctx, block, n); nessie_hash_ctx.hash_conv(hash, ctx); nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8); } @@ -151,26 +138,30 @@ static void tv4_hash(void){ uint8_t ctx[nessie_hash_ctx.ctx_size_B]; uint8_t hash[(nessie_hash_ctx.hashsize_b+7)/8]; - uint8_t block[256/8]; - uint16_t n=256; + uint8_t block[nessie_hash_ctx.hashsize_b/8]; + uint16_t n=nessie_hash_ctx.hashsize_b; uint32_t i; - uart_putstr_P(PSTR("\r\n message=")); - uart_putstr(PSTR("256 zero bits")); - memset(block, 0, 256/8); + fputs_P(PSTR("\r\n message="), stdout); + fprintf_P(stdout, PSTR("%"PRIu16" zero bits"), nessie_hash_ctx.hashsize_b); + + memset(block, 0, nessie_hash_ctx.hashsize_b/8); nessie_hash_ctx.hash_init(ctx); while(n>=nessie_hash_ctx.blocksize_B*8){ - nessie_hash_ctx.hash_next(block, ctx); + nessie_hash_ctx.hash_next(ctx, block); n -= nessie_hash_ctx.blocksize_B*8; } - nessie_hash_ctx.hash_last(block, n, ctx); + nessie_hash_ctx.hash_last(ctx, block, n); nessie_hash_ctx.hash_conv(hash, ctx); nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8); + if(nessie_hash_quick) + return; for(i=1; i<100000L; ++i){ /* this assumes BLOCKSIZE >= HASHSIZE */ nessie_hash_ctx.hash_init(ctx); - nessie_hash_ctx.hash_last(hash, nessie_hash_ctx.hashsize_b, ctx); + nessie_hash_ctx.hash_last(ctx, hash, nessie_hash_ctx.hashsize_b); nessie_hash_ctx.hash_conv(hash, ctx); + NESSIE_SEND_ALIVE_A(i); } nessie_print_item("iterated 100000 times", hash, (nessie_hash_ctx.hashsize_b+7)/8); } @@ -193,29 +184,38 @@ void nessie_hash_run(void){ nessie_print_header(nessie_hash_ctx.name, 0, 0, nessie_hash_ctx.hashsize_b, 0, 0); /* test set 1 */ - char* challange[8][2]= { - {"", "\"\" (empty string)"}, - {"a", "\"a\""}, - {"abc", "\"abc\""}, - {"message digest", "\"message digest\""}, - {"abcdefghijklmnopqrstuvwxyz","\"abcdefghijklmnopqrstuvwxyz\""}, - {"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", - "\"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\""}, - {"ABCDEFGHIJKLMNOPQRSTUVWXYZ" - "abcdefghijklmnopqrstuvwxyz" - "0123456789" , "\"A...Za...z0...9\""}, - {"1234567890" "1234567890" "1234567890" "1234567890" - "1234567890" "1234567890" "1234567890" "1234567890", - "8 times \"1234567890\""} - }; + const char *challange_dbz= PSTR( + "\0" + "\"\" (empty string)\0" + "a\0" + "\"a\"\0" + "abc\0" + "\"abc\"\0" + "message digest\0" + "\"message digest\"\0" + "abcdefghijklmnopqrstuvwxyz\0" + "\"abcdefghijklmnopqrstuvwxyz\"\0" + "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\0" + "\"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\"\0" + "ABCDEFGHIJKLMNOPQRSTUVWXYZ" + "abcdefghijklmnopqrstuvwxyz" + "0123456789\0" + "\"A...Za...z0...9\"\0" + "1234567890123456789012345678901234567890" + "1234567890123456789012345678901234567890\0" + "8 times \"1234567890\"\0" + ); + PGM_P challange[16]; set=1; nessie_print_setheader(set); + dbz_splitup_P(challange_dbz, challange); for(i=0; i<8; ++i){ nessie_print_set_vector(set, i); - ascii_hash(challange[i][0], challange[i][1]); + ascii_hash_P(challange[2*i], challange[2*i+1]); } nessie_print_set_vector(set, i); - amillion_hash(); + if(!nessie_hash_quick) + amillion_hash(); /* test set 2 */ set=2; nessie_print_setheader(set);