2 * GOST R 34.11-2012 core functions.
4 * Copyright (c) 2013 Cryptocom LTD.
5 * This file is distributed under the same license as OpenSSL.
7 * Author: Alexey Degtyarev <alexey@renatasystems.org>
11 #include "gosthash2012.h"
13 #if defined(_WIN32) || defined(_WINDOWS)
14 # define INLINE __inline
16 # define INLINE inline
20 (((x & 0xFF00000000000000ULL) >> 56) | \
21 ((x & 0x00FF000000000000ULL) >> 40) | \
22 ((x & 0x0000FF0000000000ULL) >> 24) | \
23 ((x & 0x000000FF00000000ULL) >> 8) | \
24 ((x & 0x00000000FF000000ULL) << 8) | \
25 ((x & 0x0000000000FF0000ULL) << 24) | \
26 ((x & 0x000000000000FF00ULL) << 40) | \
27 ((x & 0x00000000000000FFULL) << 56))
30 * Initialize gost2012 hash context structure
32 void init_gost2012_hash_ctx(gost2012_hash_ctx * CTX,
33 const unsigned int digest_size)
35 memset(CTX, 0, sizeof(gost2012_hash_ctx));
37 CTX->digest_size = digest_size;
38 if (digest_size == 256)
39 memset(&CTX->h, 0x01, sizeof(uint512_u));
41 memset(&CTX->h, 0x00, sizeof(uint512_u));
44 static INLINE void pad(gost2012_hash_ctx * CTX)
46 unsigned char buf[64];
48 if (CTX->bufsize > 63)
51 memset(&buf, 0x00, sizeof buf);
52 memcpy(&buf, CTX->buffer, CTX->bufsize);
54 buf[CTX->bufsize] = 0x01;
55 memcpy(CTX->buffer, &buf, sizeof buf);
58 static INLINE void add512(const union uint512_u *x,
59 const union uint512_u *y, union uint512_u *r)
61 #ifndef __GOST3411_BIG_ENDIAN__
63 unsigned long long tmp;
67 for (i = 0; i < 8; i++)
69 /* Detecting integer overflow condition for three numbers
70 * in a portable way is tricky a little. */
72 /* Step 1: numbers cause overflow */
73 tmp = x->QWORD[i] + y->QWORD[i];
75 /* Compare with any of two summands, no need to check both */
76 if (tmp < x->QWORD[i])
81 /* Step 2: carry bit causes overflow */
84 if (CF > 0 && tmp == 0)
92 const unsigned char *xp, *yp;
97 xp = (const unsigned char *)&x[0];
98 yp = (const unsigned char *)&y[0];
99 rp = (unsigned char *)&r[0];
102 for (i = 0; i < 64; i++) {
103 buf = xp[i] + yp[i] + (buf >> 8);
104 rp[i] = (unsigned char)buf & 0xFF;
109 static void g(union uint512_u *h, const union uint512_u *N,
110 const unsigned char *m)
112 #ifdef __GOST3411_HAS_SSE2__
113 __m128i xmm0, xmm2, xmm4, xmm6; /* XMMR0-quadruple */
114 __m128i xmm1, xmm3, xmm5, xmm7; /* XMMR1-quadruple */
117 LOAD(N, xmm0, xmm2, xmm4, xmm6);
118 XLPS128M(h, xmm0, xmm2, xmm4, xmm6);
120 LOAD(m, xmm1, xmm3, xmm5, xmm7);
121 XLPS128R(xmm0, xmm2, xmm4, xmm6, xmm1, xmm3, xmm5, xmm7);
123 for (i = 0; i < 11; i++)
124 ROUND128(i, xmm0, xmm2, xmm4, xmm6, xmm1, xmm3, xmm5, xmm7);
126 XLPS128M((&C[11]), xmm0, xmm2, xmm4, xmm6);
127 X128R(xmm0, xmm2, xmm4, xmm6, xmm1, xmm3, xmm5, xmm7);
129 X128M(h, xmm0, xmm2, xmm4, xmm6);
130 X128M(m, xmm0, xmm2, xmm4, xmm6);
132 UNLOAD(h, xmm0, xmm2, xmm4, xmm6);
134 /* Restore the Floating-point status on the CPU */
137 union uint512_u Ki, data;
144 XLPS((&Ki), ((const union uint512_u *)&m[0]), (&data));
146 for (i = 0; i < 11; i++)
147 ROUND(i, (&Ki), (&data));
149 XLPS((&Ki), (&C[11]), (&Ki));
150 X((&Ki), (&data), (&data));
153 X((&data), h, (&data));
154 X((&data), ((const union uint512_u *)&m[0]), h);
158 static INLINE void stage2(gost2012_hash_ctx * CTX, const unsigned char *data)
160 g(&(CTX->h), &(CTX->N), data);
162 add512(&(CTX->N), &buffer512, &(CTX->N));
163 add512(&(CTX->Sigma), (const union uint512_u *)data, &(CTX->Sigma));
166 static INLINE void stage3(gost2012_hash_ctx * CTX)
168 ALIGN(16) union uint512_u buf;
170 memset(&buf, 0x00, sizeof buf);
171 memcpy(&buf, &(CTX->buffer), CTX->bufsize);
172 memcpy(&(CTX->buffer), &buf, sizeof(uint512_u));
174 memset(&buf, 0x00, sizeof buf);
175 #ifndef __GOST3411_BIG_ENDIAN__
176 buf.QWORD[0] = CTX->bufsize << 3;
178 buf.QWORD[0] = BSWAP64(CTX->bufsize << 3);
183 g(&(CTX->h), &(CTX->N), (const unsigned char *)&(CTX->buffer));
185 add512(&(CTX->N), &buf, &(CTX->N));
186 add512(&(CTX->Sigma), (const union uint512_u *)&CTX->buffer[0],
189 g(&(CTX->h), &buffer0, (const unsigned char *)&(CTX->N));
191 g(&(CTX->h), &buffer0, (const unsigned char *)&(CTX->Sigma));
192 memcpy(&(CTX->hash), &(CTX->h), sizeof(uint512_u));
196 * Hash block of arbitrary length
199 void gost2012_hash_block(gost2012_hash_ctx * CTX,
200 const unsigned char *data, size_t len)
204 while (len > 63 && CTX->bufsize == 0) {
212 chunksize = 64 - CTX->bufsize;
216 memcpy(&CTX->buffer[CTX->bufsize], data, chunksize);
218 CTX->bufsize += chunksize;
222 if (CTX->bufsize == 64) {
223 stage2(CTX, CTX->buffer);
231 * Compute hash value from current state of ctx
232 * state of hash ctx becomes invalid and cannot be used for further
235 void gost2012_finish_hash(gost2012_hash_ctx * CTX, unsigned char *digest)
241 if (CTX->digest_size == 256)
242 memcpy(digest, &(CTX->hash.QWORD[4]), 32);
244 memcpy(digest, &(CTX->hash.QWORD[0]), 64);