137 lines
3.3 KiB
C
137 lines
3.3 KiB
C
/*
|
|
hash.c version 20160722
|
|
Andreas Hülsing
|
|
Joost Rijneveld
|
|
Public domain.
|
|
*/
|
|
|
|
#include "hash_address.h"
|
|
#include "xmss_commons.h"
|
|
#include "params.h"
|
|
#include "hash.h"
|
|
#include "fips202.h"
|
|
|
|
#include <stddef.h>
|
|
#include <stdio.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
#include <openssl/sha.h>
|
|
|
|
unsigned char* addr_to_byte(unsigned char *bytes, const uint32_t addr[8])
|
|
{
|
|
#if IS_LITTLE_ENDIAN==1
|
|
int i = 0;
|
|
for(i=0;i<8;i++)
|
|
to_byte(bytes+i*4, addr[i],4);
|
|
return bytes;
|
|
#else
|
|
memcpy(bytes, addr, 32);
|
|
return bytes;
|
|
#endif
|
|
}
|
|
|
|
static int core_hash(unsigned char *out, const unsigned int type, const unsigned char *key, unsigned int keylen, const unsigned char *in, unsigned long long inlen, int n)
|
|
{
|
|
unsigned long long i = 0;
|
|
unsigned char buf[inlen + n + keylen];
|
|
|
|
// Input is (toByte(X, 32) || KEY || M)
|
|
|
|
// set toByte
|
|
to_byte(buf, type, n);
|
|
|
|
for (i=0; i < keylen; i++) {
|
|
buf[i+n] = key[i];
|
|
}
|
|
|
|
for (i=0; i < inlen; i++) {
|
|
buf[keylen + n + i] = in[i];
|
|
}
|
|
|
|
if (n == 32 && XMSS_FUNC == XMSS_SHA2_256) {
|
|
SHA256(buf, inlen + keylen + n, out);
|
|
}
|
|
else if (n == 32 && XMSS_FUNC == XMSS_SHAKE128) {
|
|
shake128(out, 32, buf, inlen + keylen + n);
|
|
}
|
|
else if (n == 64 && XMSS_FUNC == XMSS_SHA2_512) {
|
|
SHA512(buf, inlen + keylen + n, out);
|
|
}
|
|
else if (n == 64 && XMSS_FUNC == XMSS_SHAKE256) {
|
|
shake256(out, 64, buf, inlen + keylen + n);
|
|
}
|
|
else {
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* Implements PRF
|
|
*/
|
|
int prf(unsigned char *out, const unsigned char *in, const unsigned char *key, unsigned int keylen)
|
|
{
|
|
return core_hash(out, 3, key, keylen, in, 32, keylen);
|
|
}
|
|
|
|
/*
|
|
* Implemts H_msg
|
|
*/
|
|
int h_msg(unsigned char *out, const unsigned char *in, unsigned long long inlen, const unsigned char *key, const unsigned int keylen)
|
|
{
|
|
if (keylen != 3*XMSS_N){
|
|
fprintf(stderr, "H_msg takes 3n-bit keys, we got n=%d but a keylength of %d.\n", XMSS_N, keylen);
|
|
return 1;
|
|
}
|
|
return core_hash(out, 2, key, keylen, in, inlen, XMSS_N);
|
|
}
|
|
|
|
/**
|
|
* We assume the left half is in in[0]...in[n-1]
|
|
*/
|
|
int hash_h(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8])
|
|
{
|
|
unsigned char buf[2*XMSS_N];
|
|
unsigned char key[XMSS_N];
|
|
unsigned char bitmask[2*XMSS_N];
|
|
unsigned char byte_addr[32];
|
|
unsigned int i;
|
|
|
|
setKeyAndMask(addr, 0);
|
|
addr_to_byte(byte_addr, addr);
|
|
prf(key, byte_addr, pub_seed, XMSS_N);
|
|
// Use MSB order
|
|
setKeyAndMask(addr, 1);
|
|
addr_to_byte(byte_addr, addr);
|
|
prf(bitmask, byte_addr, pub_seed, XMSS_N);
|
|
setKeyAndMask(addr, 2);
|
|
addr_to_byte(byte_addr, addr);
|
|
prf(bitmask+XMSS_N, byte_addr, pub_seed, XMSS_N);
|
|
for (i = 0; i < 2*XMSS_N; i++) {
|
|
buf[i] = in[i] ^ bitmask[i];
|
|
}
|
|
return core_hash(out, 1, key, XMSS_N, buf, 2*XMSS_N, XMSS_N);
|
|
}
|
|
|
|
int hash_f(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8])
|
|
{
|
|
unsigned char buf[XMSS_N];
|
|
unsigned char key[XMSS_N];
|
|
unsigned char bitmask[XMSS_N];
|
|
unsigned char byte_addr[32];
|
|
unsigned int i;
|
|
|
|
setKeyAndMask(addr, 0);
|
|
addr_to_byte(byte_addr, addr);
|
|
prf(key, byte_addr, pub_seed, XMSS_N);
|
|
|
|
setKeyAndMask(addr, 1);
|
|
addr_to_byte(byte_addr, addr);
|
|
prf(bitmask, byte_addr, pub_seed, XMSS_N);
|
|
|
|
for (i = 0; i < XMSS_N; i++) {
|
|
buf[i] = in[i] ^ bitmask[i];
|
|
}
|
|
return core_hash(out, 0, key, XMSS_N, buf, XMSS_N, XMSS_N);
|
|
}
|