]> git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/blake2/blake2s.c
Move blake2_loclh to blake2 directory
[thirdparty/openssl.git] / crypto / blake2 / blake2s.c
1 /*
2 * Copyright 2012, Samuel Neves <sneves@dei.uc.pt>.
3 * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.
4 *
5 * Licensed under the OpenSSL licenses, (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
8 * https://www.openssl.org/source/license.html
9 * or in the file LICENSE in the source distribution.
10 */
11
12 /*
13 * Derived from the BLAKE2 reference implementation written by Samuel Neves.
14 * More information about the BLAKE2 hash function and its implementations
15 * can be found at https://blake2.net.
16 */
17
18 #include <string.h>
19 #include <openssl/crypto.h>
20 #include "e_os.h"
21
22 #include "blake2_locl.h"
23 #include "blake2_impl.h"
24
25 static const uint32_t blake2s_IV[8] =
26 {
27 0x6A09E667U, 0xBB67AE85U, 0x3C6EF372U, 0xA54FF53AU,
28 0x510E527FU, 0x9B05688CU, 0x1F83D9ABU, 0x5BE0CD19U
29 };
30
31 static const uint8_t blake2s_sigma[10][16] =
32 {
33 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
34 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
35 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
36 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
37 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
38 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
39 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
40 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
41 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
42 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
43 };
44
45 /* Set that it's the last block we'll compress */
46 static ossl_inline void blake2s_set_lastblock(BLAKE2S_CTX *S)
47 {
48 S->f[0] = -1;
49 }
50
51 /* Increment the data hashed counter. */
52 static ossl_inline void blake2s_increment_counter(BLAKE2S_CTX *S,
53 const uint32_t inc)
54 {
55 S->t[0] += inc;
56 S->t[1] += (S->t[0] < inc);
57 }
58
59 /* Initialize the hashing state. */
60 static ossl_inline void blake2s_init0(BLAKE2S_CTX *S)
61 {
62 int i;
63
64 memset(S, 0, sizeof(BLAKE2S_CTX));
65 for(i = 0; i < 8; ++i) {
66 S->h[i] = blake2s_IV[i];
67 }
68 }
69
70 /* init2 xors IV with input parameter block */
71 static void blake2s_init_param(BLAKE2S_CTX *S, const BLAKE2S_PARAM *P)
72 {
73 const uint8_t *p = (const uint8_t *)(P);
74 size_t i;
75
76 /* The param struct is carefully hand packed, and should be 32 bytes on
77 * every platform. */
78 OPENSSL_assert(sizeof(BLAKE2S_PARAM) == 32);
79 blake2s_init0(S);
80 /* IV XOR ParamBlock */
81 for(i = 0; i < 8; ++i) {
82 S->h[i] ^= load32(&p[i*4]);
83 }
84 }
85
86 /* Initialize the hashing context. Always returns 1. */
87 int BLAKE2s_Init(BLAKE2S_CTX *c)
88 {
89 BLAKE2S_PARAM P[1];
90
91 P->digest_length = BLAKE2S_DIGEST_LENGTH;
92 P->key_length = 0;
93 P->fanout = 1;
94 P->depth = 1;
95 store32(P->leaf_length, 0);
96 store48(P->node_offset, 0);
97 P->node_depth = 0;
98 P->inner_length = 0;
99 memset(P->salt, 0, sizeof(P->salt));
100 memset(P->personal, 0, sizeof(P->personal));
101 blake2s_init_param(c, P);
102 return 1;
103 }
104
105 /* Permute the state while xoring in the block of data. */
106 static void blake2s_compress(BLAKE2S_CTX *S,
107 const uint8_t block[BLAKE2S_BLOCKBYTES])
108 {
109 uint32_t m[16];
110 uint32_t v[16];
111 size_t i;
112
113 for(i = 0; i < 16; ++i) {
114 m[i] = load32(block + i * sizeof(m[i]));
115 }
116
117 for(i = 0; i < 8; ++i) {
118 v[i] = S->h[i];
119 }
120
121 v[ 8] = blake2s_IV[0];
122 v[ 9] = blake2s_IV[1];
123 v[10] = blake2s_IV[2];
124 v[11] = blake2s_IV[3];
125 v[12] = S->t[0] ^ blake2s_IV[4];
126 v[13] = S->t[1] ^ blake2s_IV[5];
127 v[14] = S->f[0] ^ blake2s_IV[6];
128 v[15] = S->f[1] ^ blake2s_IV[7];
129 #define G(r,i,a,b,c,d) \
130 do { \
131 a = a + b + m[blake2s_sigma[r][2*i+0]]; \
132 d = rotr32(d ^ a, 16); \
133 c = c + d; \
134 b = rotr32(b ^ c, 12); \
135 a = a + b + m[blake2s_sigma[r][2*i+1]]; \
136 d = rotr32(d ^ a, 8); \
137 c = c + d; \
138 b = rotr32(b ^ c, 7); \
139 } while(0)
140 #define ROUND(r) \
141 do { \
142 G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
143 G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
144 G(r,2,v[ 2],v[ 6],v[10],v[14]); \
145 G(r,3,v[ 3],v[ 7],v[11],v[15]); \
146 G(r,4,v[ 0],v[ 5],v[10],v[15]); \
147 G(r,5,v[ 1],v[ 6],v[11],v[12]); \
148 G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
149 G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
150 } while(0)
151 ROUND(0);
152 ROUND(1);
153 ROUND(2);
154 ROUND(3);
155 ROUND(4);
156 ROUND(5);
157 ROUND(6);
158 ROUND(7);
159 ROUND(8);
160 ROUND(9);
161
162 for(i = 0; i < 8; ++i) {
163 S->h[i] = S->h[i] ^ v[i] ^ v[i + 8];
164 }
165
166 #undef G
167 #undef ROUND
168 }
169
170 /* Absorb the input data into the hash state. Always returns 1. */
171 int BLAKE2s_Update(BLAKE2S_CTX *c, const void *data, size_t datalen)
172 {
173 const uint8_t *in = data;
174 size_t fill;
175
176 while(datalen > 0) {
177 fill = sizeof(c->buf) - c->buflen;
178 /* Must be >, not >=, so that last block can be hashed differently */
179 if(datalen > fill) {
180 memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */
181 blake2s_increment_counter(c, BLAKE2S_BLOCKBYTES);
182 blake2s_compress(c, c->buf); /* Compress */
183 c->buflen = 0;
184 in += fill;
185 datalen -= fill;
186 } else { /* datalen <= fill */
187 memcpy(c->buf + c->buflen, in, datalen);
188 c->buflen += datalen; /* Be lazy, do not compress */
189 return 1;
190 }
191 }
192
193 return 1;
194 }
195
196 /*
197 * Calculate the final hash and save it in md.
198 * Always returns 1.
199 */
200 int BLAKE2s_Final(unsigned char *md, BLAKE2S_CTX *c)
201 {
202 int i;
203
204 blake2s_increment_counter(c, (uint32_t)c->buflen);
205 blake2s_set_lastblock(c);
206 /* Padding */
207 memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen);
208 blake2s_compress(c, c->buf);
209
210 /* Output full hash to temp buffer */
211 for(i = 0; i < 8; ++i) {
212 store32(md + sizeof(c->h[i]) * i, c->h[i]);
213 }
214
215 OPENSSL_cleanse(c, sizeof(BLAKE2S_CTX));
216 return 1;
217 }