forked from Qortal/Brooklyn
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
139 lines
5.0 KiB
139 lines
5.0 KiB
/* $Id: sph_sha0.h 216 2010-06-08 09:46:57Z tp $ */ |
|
/** |
|
* SHA-0 interface. |
|
* |
|
* SHA-0 is the current name for the original SHA as published in 1993 in |
|
* FIPS 180. In 1995, FIPS 180 was withdrawn, and replaced with FIPS 180-1 |
|
* which describes SHA-1 (which differs from SHA-0 by a one-bit rotation |
|
* added in the message expansion). |
|
* |
|
* Although the FIPS standards can be found at |
|
* http://csrc.nist.gov/publications/fips/ , the original FIPS 180 was |
|
* withdrawn and cannot be found there. The description of SHA-0 can be |
|
* infered from that of SHA-1 by removing the rotation in the message |
|
* expansion; test vectors can be used to verify the correctness of this |
|
* tweak. In particular, this implementation is compatible with the |
|
* published collision. |
|
* |
|
* @warning A collision for SHA-0 has been published. SHA-0 is thus |
|
* cryptographically broken and should not be used for security purposes. |
|
* |
|
* ==========================(LICENSE BEGIN)============================ |
|
* |
|
* Copyright (c) 2007-2010 Projet RNRT SAPHIR |
|
* |
|
* Permission is hereby granted, free of charge, to any person obtaining |
|
* a copy of this software and associated documentation files (the |
|
* "Software"), to deal in the Software without restriction, including |
|
* without limitation the rights to use, copy, modify, merge, publish, |
|
* distribute, sublicense, and/or sell copies of the Software, and to |
|
* permit persons to whom the Software is furnished to do so, subject to |
|
* the following conditions: |
|
* |
|
* The above copyright notice and this permission notice shall be |
|
* included in all copies or substantial portions of the Software. |
|
* |
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
|
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
|
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, |
|
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE |
|
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
* |
|
* ===========================(LICENSE END)============================= |
|
* |
|
* @file sph_sha0.h |
|
* @author Thomas Pornin <[email protected]> |
|
*/ |
|
|
|
#ifndef SPH_SHA0_H__ |
|
#define SPH_SHA0_H__ |
|
|
|
#include <stddef.h> |
|
#include "sph_types.h" |
|
|
|
/** |
|
* Output size (in bits) for SHA-0. |
|
*/ |
|
#define SPH_SIZE_sha0 160 |
|
|
|
/** |
|
* This structure is a context for SHA-0 computations: it contains the |
|
* intermediate values and some data from the last entered block. Once |
|
* a SHA-0 computation has been performed, the context can be reused for |
|
* another computation. |
|
* |
|
* The contents of this structure are private. A running SHA-0 computation |
|
* can be cloned by copying the context (e.g. with a simple |
|
* <code>memcpy()</code>). |
|
*/ |
|
typedef struct { |
|
#ifndef DOXYGEN_IGNORE |
|
unsigned char buf[64]; /* first field, for alignment */ |
|
sph_u32 val[5]; |
|
#if SPH_64 |
|
sph_u64 count; |
|
#else |
|
sph_u32 count_high, count_low; |
|
#endif |
|
#endif |
|
} sph_sha0_context; |
|
|
|
/** |
|
* Initialize a SHA-0 context. This process performs no memory allocation. |
|
* |
|
* @param cc the SHA-0 context (pointer to a <code>sph_sha0_context</code>) |
|
*/ |
|
void sph_sha0_init(void *cc); |
|
|
|
/** |
|
* Process some data bytes. It is acceptable that <code>len</code> is zero |
|
* (in which case this function does nothing). |
|
* |
|
* @param cc the SHA-0 context |
|
* @param data the input data |
|
* @param len the input data length (in bytes) |
|
*/ |
|
void sph_sha0(void *cc, const void *data, size_t len); |
|
|
|
/** |
|
* Terminate the current SHA-0 computation and output the result into the |
|
* provided buffer. The destination buffer must be wide enough to |
|
* accomodate the result (20 bytes). The context is automatically |
|
* reinitialized. |
|
* |
|
* @param cc the SHA-0 context |
|
* @param dst the destination buffer |
|
*/ |
|
void sph_sha0_close(void *cc, void *dst); |
|
|
|
/** |
|
* Add a few additional bits (0 to 7) to the current computation, then |
|
* terminate it and output the result in the provided buffer, which must |
|
* be wide enough to accomodate the result (20 bytes). If bit number i |
|
* in <code>ub</code> has value 2^i, then the extra bits are those |
|
* numbered 7 downto 8-n (this is the big-endian convention at the byte |
|
* level). The context is automatically reinitialized. |
|
* |
|
* @param cc the SHA-0 context |
|
* @param ub the extra bits |
|
* @param n the number of extra bits (0 to 7) |
|
* @param dst the destination buffer |
|
*/ |
|
void sph_sha0_addbits_and_close(void *cc, unsigned ub, unsigned n, void *dst); |
|
|
|
/** |
|
* Apply the SHA-0 compression function on the provided data. The |
|
* <code>msg</code> parameter contains the 16 32-bit input blocks, |
|
* as numerical values (hence after the big-endian decoding). The |
|
* <code>val</code> parameter contains the 5 32-bit input blocks for |
|
* the compression function; the output is written in place in this |
|
* array. |
|
* |
|
* @param msg the message block (16 values) |
|
* @param val the function 160-bit input and output |
|
*/ |
|
void sph_sha0_comp(const sph_u32 msg[16], sph_u32 val[5]); |
|
|
|
#endif
|
|
|