blake2s_prov.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /*
  2. * Copyright 2016-2024 The OpenSSL Project Authors. All Rights Reserved.
  3. *
  4. * Licensed under the Apache License 2.0 (the "License"). You may not use
  5. * this file except in compliance with the License. You can obtain a copy
  6. * in the file LICENSE in the source distribution or at
  7. * https://www.openssl.org/source/license.html
  8. */
  9. /*
  10. * Derived from the BLAKE2 reference implementation written by Samuel Neves.
  11. * Copyright 2012, Samuel Neves <[email protected]>
  12. * More information about the BLAKE2 hash function and its implementations
  13. * can be found at https://blake2.net.
  14. */
  15. #include <assert.h>
  16. #include <string.h>
  17. #include <openssl/crypto.h>
  18. #include "blake2_impl.h"
  19. #include "prov/blake2.h"
  20. static const uint32_t blake2s_IV[8] = {
  21. 0x6A09E667U, 0xBB67AE85U, 0x3C6EF372U, 0xA54FF53AU,
  22. 0x510E527FU, 0x9B05688CU, 0x1F83D9ABU, 0x5BE0CD19U
  23. };
  24. static const uint8_t blake2s_sigma[10][16] = {
  25. { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
  26. { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
  27. { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
  28. { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
  29. { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
  30. { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
  31. { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
  32. { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
  33. { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
  34. { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
  35. };
  36. /* Set that it's the last block we'll compress */
  37. static ossl_inline void blake2s_set_lastblock(BLAKE2S_CTX *S)
  38. {
  39. S->f[0] = -1;
  40. }
  41. /* Initialize the hashing state. */
  42. static ossl_inline void blake2s_init0(BLAKE2S_CTX *S)
  43. {
  44. int i;
  45. memset(S, 0, sizeof(BLAKE2S_CTX));
  46. for (i = 0; i < 8; ++i) {
  47. S->h[i] = blake2s_IV[i];
  48. }
  49. }
  50. /* init xors IV with input parameter block and sets the output length */
  51. static void blake2s_init_param(BLAKE2S_CTX *S, const BLAKE2S_PARAM *P)
  52. {
  53. size_t i;
  54. const uint8_t *p = (const uint8_t *)(P);
  55. blake2s_init0(S);
  56. S->outlen = P->digest_length;
  57. /* The param struct is carefully hand packed, and should be 32 bytes on
  58. * every platform. */
  59. assert(sizeof(BLAKE2S_PARAM) == 32);
  60. /* IV XOR ParamBlock */
  61. for (i = 0; i < 8; ++i) {
  62. S->h[i] ^= load32(&p[i*4]);
  63. }
  64. }
  65. void ossl_blake2s_param_init(BLAKE2S_PARAM *P)
  66. {
  67. P->digest_length = BLAKE2S_DIGEST_LENGTH;
  68. P->key_length = 0;
  69. P->fanout = 1;
  70. P->depth = 1;
  71. store32(P->leaf_length, 0);
  72. store48(P->node_offset, 0);
  73. P->node_depth = 0;
  74. P->inner_length = 0;
  75. memset(P->salt, 0, sizeof(P->salt));
  76. memset(P->personal, 0, sizeof(P->personal));
  77. }
  78. void ossl_blake2s_param_set_digest_length(BLAKE2S_PARAM *P, uint8_t outlen)
  79. {
  80. P->digest_length = outlen;
  81. }
  82. void ossl_blake2s_param_set_key_length(BLAKE2S_PARAM *P, uint8_t keylen)
  83. {
  84. P->key_length = keylen;
  85. }
  86. void ossl_blake2s_param_set_personal(BLAKE2S_PARAM *P, const uint8_t *personal,
  87. size_t len)
  88. {
  89. memcpy(P->personal, personal, len);
  90. memset(P->personal + len, 0, BLAKE2S_PERSONALBYTES - len);
  91. }
  92. void ossl_blake2s_param_set_salt(BLAKE2S_PARAM *P, const uint8_t *salt,
  93. size_t len)
  94. {
  95. memcpy(P->salt, salt, len);
  96. memset(P->salt + len, 0, BLAKE2S_SALTBYTES - len);}
  97. /*
  98. * Initialize the hashing context with the given parameter block.
  99. * Always returns 1.
  100. */
  101. int ossl_blake2s_init(BLAKE2S_CTX *c, const BLAKE2S_PARAM *P)
  102. {
  103. blake2s_init_param(c, P);
  104. return 1;
  105. }
  106. /*
  107. * Initialize the hashing context with the given parameter block and key.
  108. * Always returns 1.
  109. */
  110. int ossl_blake2s_init_key(BLAKE2S_CTX *c, const BLAKE2S_PARAM *P,
  111. const void *key)
  112. {
  113. blake2s_init_param(c, P);
  114. /* Pad the key to form first data block */
  115. {
  116. uint8_t block[BLAKE2S_BLOCKBYTES] = {0};
  117. memcpy(block, key, P->key_length);
  118. ossl_blake2s_update(c, block, BLAKE2S_BLOCKBYTES);
  119. OPENSSL_cleanse(block, BLAKE2S_BLOCKBYTES);
  120. }
  121. return 1;
  122. }
  123. /* Permute the state while xoring in the block of data. */
  124. static void blake2s_compress(BLAKE2S_CTX *S,
  125. const uint8_t *blocks,
  126. size_t len)
  127. {
  128. uint32_t m[16];
  129. uint32_t v[16];
  130. size_t i;
  131. size_t increment;
  132. /*
  133. * There are two distinct usage vectors for this function:
  134. *
  135. * a) BLAKE2s_Update uses it to process complete blocks,
  136. * possibly more than one at a time;
  137. *
  138. * b) BLAK2s_Final uses it to process last block, always
  139. * single but possibly incomplete, in which case caller
  140. * pads input with zeros.
  141. */
  142. assert(len < BLAKE2S_BLOCKBYTES || len % BLAKE2S_BLOCKBYTES == 0);
  143. /*
  144. * Since last block is always processed with separate call,
  145. * |len| not being multiple of complete blocks can be observed
  146. * only with |len| being less than BLAKE2S_BLOCKBYTES ("less"
  147. * including even zero), which is why following assignment doesn't
  148. * have to reside inside the main loop below.
  149. */
  150. increment = len < BLAKE2S_BLOCKBYTES ? len : BLAKE2S_BLOCKBYTES;
  151. for (i = 0; i < 8; ++i) {
  152. v[i] = S->h[i];
  153. }
  154. do {
  155. for (i = 0; i < 16; ++i) {
  156. m[i] = load32(blocks + i * sizeof(m[i]));
  157. }
  158. /* blake2s_increment_counter */
  159. S->t[0] += increment;
  160. S->t[1] += (S->t[0] < increment);
  161. v[ 8] = blake2s_IV[0];
  162. v[ 9] = blake2s_IV[1];
  163. v[10] = blake2s_IV[2];
  164. v[11] = blake2s_IV[3];
  165. v[12] = S->t[0] ^ blake2s_IV[4];
  166. v[13] = S->t[1] ^ blake2s_IV[5];
  167. v[14] = S->f[0] ^ blake2s_IV[6];
  168. v[15] = S->f[1] ^ blake2s_IV[7];
  169. #define G(r,i,a,b,c,d) \
  170. do { \
  171. a = a + b + m[blake2s_sigma[r][2*i+0]]; \
  172. d = rotr32(d ^ a, 16); \
  173. c = c + d; \
  174. b = rotr32(b ^ c, 12); \
  175. a = a + b + m[blake2s_sigma[r][2*i+1]]; \
  176. d = rotr32(d ^ a, 8); \
  177. c = c + d; \
  178. b = rotr32(b ^ c, 7); \
  179. } while (0)
  180. #define ROUND(r) \
  181. do { \
  182. G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
  183. G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
  184. G(r,2,v[ 2],v[ 6],v[10],v[14]); \
  185. G(r,3,v[ 3],v[ 7],v[11],v[15]); \
  186. G(r,4,v[ 0],v[ 5],v[10],v[15]); \
  187. G(r,5,v[ 1],v[ 6],v[11],v[12]); \
  188. G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
  189. G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
  190. } while (0)
  191. #if defined(OPENSSL_SMALL_FOOTPRINT)
  192. /* almost 3x reduction on x86_64, 4.5x on ARMv8, 4x on ARMv4 */
  193. for (i = 0; i < 10; i++) {
  194. ROUND(i);
  195. }
  196. #else
  197. ROUND(0);
  198. ROUND(1);
  199. ROUND(2);
  200. ROUND(3);
  201. ROUND(4);
  202. ROUND(5);
  203. ROUND(6);
  204. ROUND(7);
  205. ROUND(8);
  206. ROUND(9);
  207. #endif
  208. for (i = 0; i < 8; ++i) {
  209. S->h[i] = v[i] ^= v[i + 8] ^ S->h[i];
  210. }
  211. #undef G
  212. #undef ROUND
  213. blocks += increment;
  214. len -= increment;
  215. } while (len);
  216. }
  217. /* Absorb the input data into the hash state. Always returns 1. */
  218. int ossl_blake2s_update(BLAKE2S_CTX *c, const void *data, size_t datalen)
  219. {
  220. const uint8_t *in = data;
  221. size_t fill;
  222. /*
  223. * Intuitively one would expect intermediate buffer, c->buf, to
  224. * store incomplete blocks. But in this case we are interested to
  225. * temporarily stash even complete blocks, because last one in the
  226. * stream has to be treated in special way, and at this point we
  227. * don't know if last block in *this* call is last one "ever". This
  228. * is the reason for why |datalen| is compared as >, and not >=.
  229. */
  230. fill = sizeof(c->buf) - c->buflen;
  231. if (datalen > fill) {
  232. if (c->buflen) {
  233. memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */
  234. blake2s_compress(c, c->buf, BLAKE2S_BLOCKBYTES);
  235. c->buflen = 0;
  236. in += fill;
  237. datalen -= fill;
  238. }
  239. if (datalen > BLAKE2S_BLOCKBYTES) {
  240. size_t stashlen = datalen % BLAKE2S_BLOCKBYTES;
  241. /*
  242. * If |datalen| is a multiple of the blocksize, stash
  243. * last complete block, it can be final one...
  244. */
  245. stashlen = stashlen ? stashlen : BLAKE2S_BLOCKBYTES;
  246. datalen -= stashlen;
  247. blake2s_compress(c, in, datalen);
  248. in += datalen;
  249. datalen = stashlen;
  250. }
  251. }
  252. assert(datalen <= BLAKE2S_BLOCKBYTES);
  253. memcpy(c->buf + c->buflen, in, datalen);
  254. c->buflen += datalen; /* Be lazy, do not compress */
  255. return 1;
  256. }
  257. /*
  258. * Calculate the final hash and save it in md.
  259. * Always returns 1.
  260. */
  261. int ossl_blake2s_final(unsigned char *md, BLAKE2S_CTX *c)
  262. {
  263. uint8_t outbuffer[BLAKE2S_OUTBYTES] = {0};
  264. uint8_t *target = outbuffer;
  265. int iter = (c->outlen + 3) / 4;
  266. int i;
  267. /* Avoid writing to the temporary buffer if possible */
  268. if ((c->outlen % sizeof(c->h[0])) == 0)
  269. target = md;
  270. blake2s_set_lastblock(c);
  271. /* Padding */
  272. memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen);
  273. blake2s_compress(c, c->buf, c->buflen);
  274. /* Output full hash to buffer */
  275. for (i = 0; i < iter; ++i)
  276. store32(target + sizeof(c->h[i]) * i, c->h[i]);
  277. if (target != md) {
  278. memcpy(md, target, c->outlen);
  279. OPENSSL_cleanse(target, sizeof(outbuffer));
  280. }
  281. OPENSSL_cleanse(c, sizeof(BLAKE2S_CTX));
  282. return 1;
  283. }