1
1
mirror of https://github.com/henrydcase/pqc.git synced 2024-11-24 00:11:27 +00:00
pqcrypto/crypto_sign/sphincs-shake256-256s-robust/clean/hash_shake256.c

105 lines
5.0 KiB
C
Raw Normal View History

2019-04-16 14:15:03 +01:00
#include <stdint.h>
#include <string.h>
#include "address.h"
#include "hash.h"
#include "params.h"
#include "utils.h"
#include "fips202.h"
/* For SHAKE256, there is no immediate reason to initialize at the start,
so this function is an empty operation. */
void PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_initialize_hash_function(
2019-08-01 08:13:05 +01:00
hash_state *hash_state_seeded, // NOLINT(readability-non-const-parameter)
2019-04-16 14:15:03 +01:00
const unsigned char *pub_seed, const unsigned char *sk_seed) {
(void)hash_state_seeded; /* Suppress an 'unused parameter' warning. */
2019-04-16 14:15:03 +01:00
(void)pub_seed; /* Suppress an 'unused parameter' warning. */
(void)sk_seed; /* Suppress an 'unused parameter' warning. */
}
/* This is not necessary for SHAKE256, so we don't do anything */
void PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_destroy_hash_function(
hash_state *hash_state_seeded) { // NOLINT(readability-non-const-parameter)
(void)hash_state_seeded;
}
2019-04-16 14:15:03 +01:00
/*
* Computes PRF(key, addr), given a secret key of PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N bytes and an address
2019-04-16 14:15:03 +01:00
*/
void PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_prf_addr(
unsigned char *out, const unsigned char *key, const uint32_t addr[8],
const hash_state *hash_state_seeded) {
unsigned char buf[PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N + PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_ADDR_BYTES];
2019-04-16 14:15:03 +01:00
memcpy(buf, key, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N);
PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_addr_to_bytes(buf + PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N, addr);
2019-04-16 14:15:03 +01:00
shake256(out, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N, buf, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N + PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_ADDR_BYTES);
(void)hash_state_seeded; /* Prevent unused parameter warning. */
2019-04-16 14:15:03 +01:00
}
/**
* Computes the message-dependent randomness R, using a secret seed and an
* optional randomization value as well as the message.
*/
void PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_gen_message_random(
unsigned char *R,
const unsigned char *sk_prf, const unsigned char *optrand,
const unsigned char *m, size_t mlen,
const hash_state *hash_state_seeded) {
shake256incctx state;
2019-04-16 14:15:03 +01:00
shake256_inc_init(&state);
shake256_inc_absorb(&state, sk_prf, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N);
shake256_inc_absorb(&state, optrand, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N);
shake256_inc_absorb(&state, m, mlen);
shake256_inc_finalize(&state);
shake256_inc_squeeze(R, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N, &state);
(void)hash_state_seeded; /* Prevent unused parameter warning. */
2019-04-16 14:15:03 +01:00
}
/**
* Computes the message hash using R, the public key, and the message.
* Outputs the message digest and the index of the leaf. The index is split in
* the tree index and the leaf index, for convenient copying to an address.
*/
void PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_hash_message(
unsigned char *digest, uint64_t *tree, uint32_t *leaf_idx,
const unsigned char *R, const unsigned char *pk,
const unsigned char *m, size_t mlen,
const hash_state *hash_state_seeded) {
#define PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BITS (PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_HEIGHT * (PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_D - 1))
#define PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BYTES ((PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BITS + 7) / 8)
#define PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BITS PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_HEIGHT
#define PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BYTES ((PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BITS + 7) / 8)
#define PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_DGST_BYTES (PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_FORS_MSG_BYTES + PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BYTES + PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BYTES)
2019-04-16 14:15:03 +01:00
unsigned char buf[PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_DGST_BYTES];
2019-04-16 14:15:03 +01:00
unsigned char *bufp = buf;
shake256incctx state;
2019-04-16 14:15:03 +01:00
shake256_inc_init(&state);
shake256_inc_absorb(&state, R, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_N);
shake256_inc_absorb(&state, pk, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_PK_BYTES);
shake256_inc_absorb(&state, m, mlen);
shake256_inc_finalize(&state);
shake256_inc_squeeze(buf, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_DGST_BYTES, &state);
2019-04-16 14:15:03 +01:00
memcpy(digest, bufp, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_FORS_MSG_BYTES);
bufp += PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_FORS_MSG_BYTES;
2019-04-16 14:15:03 +01:00
*tree = PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_bytes_to_ull(
bufp, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BYTES);
*tree &= (~(uint64_t)0) >> (64 - PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BITS);
bufp += PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_TREE_BYTES;
2019-04-16 14:15:03 +01:00
*leaf_idx = (uint32_t)PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_bytes_to_ull(
bufp, PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BYTES);
*leaf_idx &= (~(uint32_t)0) >> (32 - PQCLEAN_SPHINCSSHAKE256256SROBUST_CLEAN_LEAF_BITS);
(void)hash_state_seeded; /* Prevent unused parameter warning. */
2019-04-16 14:15:03 +01:00
}