mirror of
https://github.com/RIOT-OS/RIOT.git
synced 2024-12-29 04:50:03 +01:00
250 lines
9.1 KiB
C
250 lines
9.1 KiB
C
/*-
|
|
* Copyright 2005 Colin Percival
|
|
* Copyright 2013 Christian Mehlis & René Kijewski
|
|
* Copyright 2016 Martin Landsmann <martin.landsmann@haw-hamburg.de>
|
|
* Copyright 2016 OTA keys S.A.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD: src/lib/libmd/sha256.h,v 1.1.2.1 2005/06/24 13:32:25 cperciva Exp $
|
|
*/
|
|
|
|
/**
|
|
* @defgroup sys_hashes_sha256 SHA-256
|
|
* @ingroup sys_hashes_unkeyed
|
|
* @brief Implementation of the SHA-256 hashing function
|
|
* @{
|
|
*
|
|
* @file
|
|
* @brief Header definitions for the SHA256 hash function
|
|
*
|
|
* @author Colin Percival
|
|
* @author Christian Mehlis
|
|
* @author Rene Kijewski
|
|
* @author Hermann Lelong
|
|
*/
|
|
|
|
#ifndef HASHES_SHA256_H
|
|
#define HASHES_SHA256_H
|
|
|
|
#include <inttypes.h>
|
|
#include <stddef.h>
|
|
|
|
#include "hashes/sha2xx_common.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/**
|
|
* @brief Length of SHA256 digests in bytes
|
|
*/
|
|
#define SHA256_DIGEST_LENGTH 32
|
|
|
|
/**
|
|
* @brief 512 Bit (64 Byte) internally used block size for sha256
|
|
*/
|
|
#define SHA256_INTERNAL_BLOCK_SIZE (64)
|
|
|
|
/**
|
|
* @brief Context for cipher operations based on sha256
|
|
*/
|
|
typedef sha2xx_context_t sha256_context_t;
|
|
|
|
/**
|
|
* @brief Context for HMAC operations based on sha256
|
|
*/
|
|
typedef struct {
|
|
/** Context for inner hash calculation */
|
|
sha256_context_t c_in;
|
|
/** Context for outer hash calculation */
|
|
sha256_context_t c_out;
|
|
} hmac_context_t;
|
|
|
|
/**
|
|
* @brief sha256-chain indexed element
|
|
*/
|
|
typedef struct {
|
|
/** the position of this element in its chain */
|
|
size_t index;
|
|
/** the element */
|
|
unsigned char element[SHA256_DIGEST_LENGTH];
|
|
} sha256_chain_idx_elm_t;
|
|
|
|
/**
|
|
* @brief SHA-256 initialization. Begins a SHA-256 operation.
|
|
*
|
|
* @param ctx sha256_context_t handle to init
|
|
*/
|
|
void sha256_init(sha256_context_t *ctx);
|
|
|
|
/**
|
|
* @brief Add bytes into the hash
|
|
*
|
|
* @param ctx sha256_context_t handle to use
|
|
* @param[in] data Input data
|
|
* @param[in] len Length of @p data
|
|
*/
|
|
static inline void sha256_update(sha256_context_t *ctx, const void *data, size_t len)
|
|
{
|
|
sha2xx_update(ctx, data, len);
|
|
}
|
|
|
|
/**
|
|
* @brief SHA-256 finalization. Pads the input data, exports the hash value,
|
|
* and clears the context state.
|
|
*
|
|
* @param ctx sha256_context_t handle to use
|
|
* @param digest resulting digest, this is the hash of all the bytes
|
|
*/
|
|
static inline void sha256_final(sha256_context_t *ctx, void *digest)
|
|
{
|
|
sha2xx_final(ctx, digest, SHA256_DIGEST_LENGTH);
|
|
}
|
|
|
|
/**
|
|
* @brief A wrapper function to simplify the generation of a hash, this is
|
|
* useful for generating sha256 for one buffer
|
|
*
|
|
* @param[in] data pointer to the buffer to generate hash from
|
|
* @param[in] len length of the buffer
|
|
* @param[out] digest optional pointer to an array for the result, length must
|
|
* be SHA256_DIGEST_LENGTH
|
|
* if digest == NULL, one static buffer is used
|
|
*/
|
|
void *sha256(const void *data, size_t len, void *digest);
|
|
|
|
/**
|
|
* @brief hmac_sha256_init HMAC SHA-256 calculation. Initiate calculation of a HMAC
|
|
* @param[in] ctx hmac_context_t handle to use
|
|
* @param[in] key key used in the hmac-sha256 computation
|
|
* @param[in] key_length the size in bytes of the key
|
|
*/
|
|
void hmac_sha256_init(hmac_context_t *ctx, const void *key, size_t key_length);
|
|
|
|
/**
|
|
* @brief hmac_sha256_update Add data bytes for HMAC calculation
|
|
* @param[in] ctx hmac_context_t handle to use
|
|
* @param[in] data pointer to the buffer to generate hash from
|
|
* @param[in] len length of the buffer
|
|
*/
|
|
void hmac_sha256_update(hmac_context_t *ctx, const void *data, size_t len);
|
|
|
|
/**
|
|
* @brief hmac_sha256_final HMAC SHA-256 finalization. Finish HMAC calculation and export the value
|
|
* @param[in] ctx hmac_context_t handle to use
|
|
* @param[out] digest the computed hmac-sha256,
|
|
* length MUST be SHA256_DIGEST_LENGTH
|
|
* if digest == NULL, a static buffer is used
|
|
*/
|
|
void hmac_sha256_final(hmac_context_t *ctx, void *digest);
|
|
|
|
/**
|
|
* @brief function to compute a hmac-sha256 from a given message
|
|
*
|
|
* @param[in] key key used in the hmac-sha256 computation
|
|
* @param[in] key_length the size in bytes of the key
|
|
* @param[in] data pointer to the buffer to generate the hmac-sha256
|
|
* @param[in] len the length of the message in bytes
|
|
* @param[out] digest the computed hmac-sha256,
|
|
* length MUST be SHA256_DIGEST_LENGTH
|
|
* if digest == NULL, a static buffer is used
|
|
* @returns pointer to the resulting digest.
|
|
* if result == NULL the pointer points to the static buffer
|
|
*/
|
|
const void *hmac_sha256(const void *key, size_t key_length,
|
|
const void *data, size_t len, void *digest);
|
|
|
|
/**
|
|
* @brief function to produce a hash chain starting with a given seed element.
|
|
* The chain is computed by taking the sha256 from the seed,
|
|
* hash the resulting sha256 and continuing taking sha256
|
|
* from each result consecutively.
|
|
*
|
|
* @param[in] seed the seed of the sha256-chain, i.e. the first element
|
|
* @param[in] seed_length the size of seed in bytes
|
|
* @param[in] elements the number of chained elements,
|
|
* i.e. the index of the last element is (elements-1)
|
|
* @param[out] tail_element the final element of the sha256-chain
|
|
*
|
|
* @returns pointer to tail_element
|
|
*/
|
|
void *sha256_chain(const void *seed, size_t seed_length,
|
|
size_t elements, void *tail_element);
|
|
|
|
/**
|
|
* @brief function to produce a hash chain starting with a given seed element.
|
|
* The chain is computed the same way as done with sha256_chain().
|
|
* Additionally intermediate elements are saved while computing the chain.
|
|
* This slows down computation, but provides the caller with indexed
|
|
* "waypoint"-elements.
|
|
* They are supposed to shortcut computing verification elements,
|
|
* this comes in handy when using long chains,
|
|
* e.g. a chain with 2<sup>32</sup> elements.
|
|
*
|
|
* @param[in] seed the seed of the sha256-chain, i.e. the first element
|
|
* @param[in] seed_length the size of seed in bytes
|
|
* @param[in] elements the number of chained elements,
|
|
* i.e. the index of the last element is (elements-1)
|
|
* @param[out] tail_element the final element of the sha256-chain
|
|
* @param[out] waypoints intermediate elements are stored there.
|
|
* @param[in, out] waypoints_length the size of the waypoints array.
|
|
* If the given size is equal or greater elements, the complete
|
|
* chain will be stored.
|
|
* Otherwise every n-th element is stored where:
|
|
* n = floor(elements / waypoints_length);
|
|
* floor is implicitly used since we perform unsigned integer division.
|
|
* The last used waypoint index is stored in the variable after call.
|
|
* That is (elements - 1) if the complete chain is stored,
|
|
* and (*waypoints_length - 1) if we only store some waypoints.
|
|
*
|
|
* @returns pointer to tail_element
|
|
*/
|
|
void *sha256_chain_with_waypoints(const void *seed, size_t seed_length,
|
|
size_t elements, void *tail_element,
|
|
sha256_chain_idx_elm_t *waypoints,
|
|
size_t *waypoints_length);
|
|
|
|
/**
|
|
* @brief function to verify if a given chain element is part of the chain.
|
|
*
|
|
* @param[in] element the chain element to be verified
|
|
* @param[in] element_index the position in the chain
|
|
* @param[in] tail_element the last element of the sha256-chain
|
|
* @param[in] chain_length the number of elements in the chain
|
|
*
|
|
* @returns 0 if element is verified to be part of the chain at element_index
|
|
* 1 if the element cannot be verified as part of the chain
|
|
*/
|
|
int sha256_chain_verify_element(void *element,
|
|
size_t element_index,
|
|
void *tail_element,
|
|
size_t chain_length);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
/** @} */
|
|
#endif /* HASHES_SHA256_H */
|