3 This file is part of the ARM-Crypto-Lib.
4 Copyright (C) 2006-2010 Daniel Otte (daniel.otte@rub.de)
6 This program is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
23 * \license GPLv3 or later
24 * \brief SHA-1 implementation.
28 #include <string.h> /* memcpy & co */
38 /********************************************************************************************************/
41 * \brief initialises given SHA-1 context
44 void sha1_init(sha1_ctx_t *state){
45 state->h[0] = 0x67452301;
46 state->h[1] = 0xefcdab89;
47 state->h[2] = 0x98badcfe;
48 state->h[3] = 0x10325476;
49 state->h[4] = 0xc3d2e1f0;
53 /********************************************************************************************************/
54 /* some helping functions */
56 uint32_t rotl32(uint32_t n, uint8_t bits){
57 return ((n<<bits) | (n>>(32-bits)));
61 uint32_t change_endian32(uint32_t x){
62 return (((x)<<24) | ((x)>>24) | (((x)& 0x0000ff00)<<8) | (((x)& 0x00ff0000)>>8));
66 /* three SHA-1 inner functions */
68 uint32_t ch(uint32_t x, uint32_t y, uint32_t z){
69 return ((x&y)^((~x)&z));
73 uint32_t maj(uint32_t x, uint32_t y, uint32_t z){
74 return ((x&y)^(x&z)^(y&z));
78 uint32_t parity(uint32_t x, uint32_t y, uint32_t z){
82 /********************************************************************************************************/
84 * \brief "add" a block to the hash
85 * This is the core function of the hash algorithm. To understand how it's working
86 * and what thoese variables do, take a look at FIPS-182. This is an "alternativ" implementation
89 #define MASK 0x0000000f
91 typedef uint32_t (*pf_t)(uint32_t x, uint32_t y, uint32_t z);
93 void sha1_nextBlock (sha1_ctx_t *state, const void* block){
98 pf_t f[] = {ch,parity,maj,parity};
99 uint32_t k[4]={ 0x5a827999,
104 /* load the w array (changing the endian and so) */
106 w[t] = change_endian32(((uint32_t*)block)[t]);
111 for(dbgi=0; dbgi<16; ++dbgi){
112 cli_putstr("\r\nBlock:");
113 cli_hexdump(&dbgi, 1);
115 cli_hexdump(&(w[dbgi]) ,4);
120 memcpy(a, state->h, 5*sizeof(uint32_t));
124 for(fi=0,fib=0,t=0; t<=79; ++t){
127 w[s] = rotl32( w[(s+13)&MASK] ^ w[(s+8)&MASK] ^
128 w[(s+ 2)&MASK] ^ w[s] ,1);
132 temp = rotl32(a[0],5) + (dtemp=f[fi](a[1],a[2],a[3])) + a[4] + k[fi] + w[s];
133 memmove(&(a[1]), &(a[0]), 4*sizeof(uint32_t)); /* e=d; d=c; c=b; b=a; */
135 a[2] = rotl32(a[2],30); /* we might also do rotr32(c,2) */
143 /* update the state */
147 state->length += 512;
150 /********************************************************************************************************/
152 void sha1_lastBlock(sha1_ctx_t *state, const void* block, uint16_t length){
153 uint8_t lb[SHA1_BLOCK_BYTES]; /* local block */
154 while(length>=SHA1_BLOCK_BITS){
155 sha1_nextBlock(state, block);
156 length -= SHA1_BLOCK_BITS;
157 block = (uint8_t*)block + SHA1_BLOCK_BYTES;
159 state->length += length;
160 memset(lb, 0, SHA1_BLOCK_BYTES);
161 memcpy (lb, block, (length+7)>>3);
163 /* set the final one bit */
164 lb[length>>3] |= 0x80>>(length & 0x07);
166 if (length>512-64-1){ /* not enouth space for 64bit length value */
167 sha1_nextBlock(state, lb);
168 state->length -= 512;
169 memset(lb, 0, SHA1_BLOCK_BYTES);
171 /* store the 64bit length value */
172 #if defined LITTLE_ENDIAN
173 /* this is now rolled up */
176 lb[56+i] = ((uint8_t*)&(state->length))[7-i];
178 #elif defined BIG_ENDIAN
179 *((uint64_t)&(lb[56])) = state->length;
181 sha1_nextBlock(state, lb);
184 /********************************************************************************************************/
186 void sha1_ctx2hash (sha1_hash_t *dest, sha1_ctx_t *state){
187 #if defined LITTLE_ENDIAN
190 ((uint32_t*)dest)[i] = change_endian32(state->h[i]);
193 if (dest != state->h)
194 memcpy(dest, state->h, SHA1_HASH_BITS/8);
196 # error unsupported endian type!
200 /********************************************************************************************************/
205 void sha1 (sha1_hash_t *dest, const void* msg, uint32_t length){
208 while(length & (~0x0001ff)){ /* length>=512 */
209 sha1_nextBlock(&s, msg);
210 msg = (uint8_t*)msg + SHA1_BLOCK_BITS/8; /* increment pointer to next block */
211 length -= SHA1_BLOCK_BITS;
213 sha1_lastBlock(&s, msg, length);
214 sha1_ctx2hash(dest, &s);