PandA-2024.02
sha-256.c
Go to the documentation of this file.
1 #include <stdint.h>
2 #include <string.h>
3 
4 #include "sha-256.h"
5 
6 #define CHUNK_SIZE 64
7 #define TOTAL_LEN_LEN 8
8 
9 /*
10  * ABOUT bool: this file does not use bool in order to be as pre-C99 compatible as possible.
11  */
12 
13 /*
14  * Comments from pseudo-code at https://en.wikipedia.org/wiki/SHA-2 are reproduced here.
15  * When useful for clarification, portions of the pseudo-code are reproduced here too.
16  */
17 
18 /*
19  * Initialize array of round constants:
20  * (first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311):
21  */
22 static const uint32_t k[] = {
23  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
24  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
25  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
26  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
27  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
28  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
29  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
30  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
31 };
32 
33 struct buffer_state {
34  const uint8_t * p;
35  size_t len;
36  size_t total_len;
37  int single_one_delivered; /* bool */
38  int total_len_delivered; /* bool */
39 };
40 
41 static inline uint32_t right_rot(uint32_t value, unsigned int count)
42 {
43  /*
44  * Defined behaviour in standard C for all count where 0 < count < 32,
45  * which is what we need here.
46  */
47  return value >> count | value << (32 - count);
48 }
49 
50 static void init_buf_state(struct buffer_state * state, const void * input, size_t len)
51 {
52  state->p = input;
53  state->len = len;
54  state->total_len = len;
55  state->single_one_delivered = 0;
56  state->total_len_delivered = 0;
57 }
58 
59 /* Return value: bool */
60 static int calc_chunk(uint8_t chunk[CHUNK_SIZE], struct buffer_state * state)
61 {
62  size_t space_in_chunk;
63 
64  if (state->total_len_delivered) {
65  return 0;
66  }
67 
68  if (state->len >= CHUNK_SIZE) {
69  memcpy(chunk, state->p, CHUNK_SIZE);
70  state->p += CHUNK_SIZE;
71  state->len -= CHUNK_SIZE;
72  return 1;
73  }
74 
75  memcpy(chunk, state->p, state->len);
76  chunk += state->len;
77  space_in_chunk = CHUNK_SIZE - state->len;
78  state->p += state->len;
79  state->len = 0;
80 
81  /* If we are here, space_in_chunk is one at minimum. */
82  if (!state->single_one_delivered) {
83  *chunk++ = 0x80;
84  space_in_chunk -= 1;
85  state->single_one_delivered = 1;
86  }
87 
88  /*
89  * Now:
90  * - either there is enough space left for the total length, and we can conclude,
91  * - or there is too little space left, and we have to pad the rest of this chunk with zeroes.
92  * In the latter case, we will conclude at the next invokation of this function.
93  */
94  if (space_in_chunk >= TOTAL_LEN_LEN) {
95  const size_t left = space_in_chunk - TOTAL_LEN_LEN;
96  size_t len = state->total_len;
97  int i;
98  memset(chunk, 0x00, left);
99  chunk += left;
100 
101  /* Storing of len * 8 as a big endian 64-bit without overflow. */
102  chunk[7] = (uint8_t) (len << 3);
103  len >>= 5;
104  for (i = 6; i >= 0; i--) {
105  chunk[i] = (uint8_t) len;
106  len >>= 8;
107  }
108  state->total_len_delivered = 1;
109  } else {
110  memset(chunk, 0x00, space_in_chunk);
111  }
112 
113  return 1;
114 }
115 
116 /*
117  * Limitations:
118  * - Since input is a pointer in RAM, the data to hash should be in RAM, which could be a problem
119  * for large data sizes.
120  * - SHA algorithms theoretically operate on bit strings. However, this implementation has no support
121  * for bit string lengths that are not multiples of eight, and it really operates on arrays of bytes.
122  * In particular, the len parameter is a number of bytes.
123  */
124 void calc_sha_256(uint8_t hash[32], const void * input, size_t len)
125 {
126  /*
127  * Note 1: All integers (expect indexes) are 32-bit unsigned integers and addition is calculated modulo 2^32.
128  * Note 2: For each round, there is one round constant k[i] and one entry in the message schedule array w[i], 0 = i = 63
129  * Note 3: The compression function uses 8 working variables, a through h
130  * Note 4: Big-endian convention is used when expressing the constants in this pseudocode,
131  * and when parsing message block data from bytes to words, for example,
132  * the first word of the input message "abc" after padding is 0x61626380
133  */
134 
135  /*
136  * Initialize hash values:
137  * (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
138  */
139  uint32_t h[] = { 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 };
140  unsigned i, j;
141 
142  /* 512-bit chunks is what we will operate on. */
143  uint8_t chunk[64];
144 
145  struct buffer_state state;
146 
147  init_buf_state(&state, input, len);
148 
149  while (calc_chunk(chunk, &state)) {
150  uint32_t ah[8];
151 
152  const uint8_t *p = chunk;
153 
154  /* Initialize working variables to current hash value: */
155  for (i = 0; i < 8; i++)
156  ah[i] = h[i];
157 
158  /* Compression function main loop: */
159  for (i = 0; i < 4; i++) {
160  /*
161  * The w-array is really w[64], but since we only need
162  * 16 of them at a time, we save stack by calculating
163  * 16 at a time.
164  *
165  * This optimization was not there initially and the
166  * rest of the comments about w[64] are kept in their
167  * initial state.
168  */
169 
170  /*
171  * create a 64-entry message schedule array w[0..63] of 32-bit words
172  * (The initial values in w[0..63] don't matter, so many implementations zero them here)
173  * copy chunk into first 16 words w[0..15] of the message schedule array
174  */
175  uint32_t w[16];
176 
177  for (j = 0; j < 16; j++) {
178  if (i == 0) {
179  w[j] = (uint32_t) p[0] << 24 | (uint32_t) p[1] << 16 |
180  (uint32_t) p[2] << 8 | (uint32_t) p[3];
181  p += 4;
182  } else {
183  /* Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array: */
184  const uint32_t s0 = right_rot(w[(j + 1) & 0xf], 7) ^ right_rot(w[(j + 1) & 0xf], 18) ^ (w[(j + 1) & 0xf] >> 3);
185  const uint32_t s1 = right_rot(w[(j + 14) & 0xf], 17) ^ right_rot(w[(j + 14) & 0xf], 19) ^ (w[(j + 14) & 0xf] >> 10);
186  w[j] = w[j] + s0 + w[(j + 9) & 0xf] + s1;
187  }
188  const uint32_t s1 = right_rot(ah[4], 6) ^ right_rot(ah[4], 11) ^ right_rot(ah[4], 25);
189  const uint32_t ch = (ah[4] & ah[5]) ^ (~ah[4] & ah[6]);
190  const uint32_t temp1 = ah[7] + s1 + ch + k[i << 4 | j] + w[j];
191  const uint32_t s0 = right_rot(ah[0], 2) ^ right_rot(ah[0], 13) ^ right_rot(ah[0], 22);
192  const uint32_t maj = (ah[0] & ah[1]) ^ (ah[0] & ah[2]) ^ (ah[1] & ah[2]);
193  const uint32_t temp2 = s0 + maj;
194 
195  ah[7] = ah[6];
196  ah[6] = ah[5];
197  ah[5] = ah[4];
198  ah[4] = ah[3] + temp1;
199  ah[3] = ah[2];
200  ah[2] = ah[1];
201  ah[1] = ah[0];
202  ah[0] = temp1 + temp2;
203  }
204  }
205 
206  /* Add the compressed chunk to the current hash value: */
207  for (i = 0; i < 8; i++)
208  h[i] += ah[i];
209  }
210 
211  /* Produce the final hash value (big-endian): */
212  for (i = 0, j = 0; i < 8; i++)
213  {
214  hash[j++] = (uint8_t) (h[i] >> 24);
215  hash[j++] = (uint8_t) (h[i] >> 16);
216  hash[j++] = (uint8_t) (h[i] >> 8);
217  hash[j++] = (uint8_t) h[i];
218  }
219 }
int input[SIZE]
Definition: hash.h:1
size_t len
Definition: sha-256.c:35
const uint8_t * p
Definition: sha-256.c:34
#define TOTAL_LEN_LEN
Definition: sha-256.c:7
static const uint32_t k[]
Definition: sha-256.c:22
const int h[24]
Definition: adpcm.c:87
int single_one_delivered
Definition: sha-256.c:37
int total_len_delivered
Definition: sha-256.c:38
static void init_buf_state(struct buffer_state *state, const void *input, size_t len)
Definition: sha-256.c:50
void calc_sha_256(uint8_t hash[32], const void *input, size_t len)
Definition: sha-256.c:124
static uint32_t right_rot(uint32_t value, unsigned int count)
Definition: sha-256.c:41
size_t total_len
Definition: sha-256.c:36
#define CHUNK_SIZE
Definition: sha-256.c:6
static int calc_chunk(uint8_t chunk[CHUNK_SIZE], struct buffer_state *state)
Definition: sha-256.c:60

Generated on Mon Feb 12 2024 13:02:50 for PandA-2024.02 by doxygen 1.8.13