3 * Whirlpool hash function
5 * (c) 2005 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of Catacomb.
12 * Catacomb is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU Library General Public License as
14 * published by the Free Software Foundation; either version 2 of the
15 * License, or (at your option) any later version.
17 * Catacomb is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU Library General Public License for more details.
22 * You should have received a copy of the GNU Library General Public
23 * License along with Catacomb; if not, write to the Free
24 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
28 /*----- Header files ------------------------------------------------------*/
30 #include <mLib/bits.h>
33 #include "ghash-def.h"
35 #include "whirlpool.h"
37 #if defined(HAVE_UINT64)
41 /*----- Static variables --------------------------------------------------*/
43 extern const kludge64 whirlpool_c[10];
46 extern const kludge64 whirlpool_t[8][256];
48 extern const uint32 whirlpool_u[4][256], whirlpool_v[4][256];
51 /*----- Main code ---------------------------------------------------------*/
53 #define DUMP(k, v) do { \
56 for (i = 0; i < 8; i++) \
57 printf(" %08x %08x : %08x %08x\n", \
58 HI64(k[i]), LO64(k[i]), \
59 HI64(v[i]), LO64(v[i])); \
62 #define OFFSET(i, n) (((i) + 16 - (n)) % 8)
68 (LO64(x) >> ((j) * 8)) : \
69 (HI64(x) >> ((j) * 8 - 32)))
71 #define TT(v, i, j) whirlpool_t[j][BYTE(v[OFFSET(i, j)], j)]
73 #define XROW(vv, v, i) do { \
74 XOR64(vv[i], vv[i], TT(v, i, 1)); \
75 XOR64(vv[i], vv[i], TT(v, i, 2)); \
76 XOR64(vv[i], vv[i], TT(v, i, 3)); \
77 XOR64(vv[i], vv[i], TT(v, i, 4)); \
78 XOR64(vv[i], vv[i], TT(v, i, 5)); \
79 XOR64(vv[i], vv[i], TT(v, i, 6)); \
80 XOR64(vv[i], vv[i], TT(v, i, 7)); \
83 #define ROWZ(vv, v, i) do { \
84 vv[i] = TT(v, i, 0); \
88 #define ROWK(vv, v, i, k) do { \
90 XOR64(vv[i], vv[i], TT(v, i, 0)); \
96 #define BYTE(x, j) U8((x) >> (((j) & 3) * 8))
98 #define UUL(v, i, j) whirlpool_u[j & 3][BYTE(v[OFFSET(i, j)].lo, j)]
99 #define VVL(v, i, j) whirlpool_v[j & 3][BYTE(v[OFFSET(i, j)].lo, j)]
100 #define UUH(v, i, j) whirlpool_u[j & 3][BYTE(v[OFFSET(i, j)].hi, j)]
101 #define VVH(v, i, j) whirlpool_v[j & 3][BYTE(v[OFFSET(i, j)].hi, j)]
103 #define XROW(vv, v, i) do { \
104 vv[i].lo ^= UUL(v, i, 1); vv[i].hi ^= VVL(v, i, 1); \
105 vv[i].lo ^= UUL(v, i, 2); vv[i].hi ^= VVL(v, i, 2); \
106 vv[i].lo ^= UUL(v, i, 3); vv[i].hi ^= VVL(v, i, 3); \
107 vv[i].lo ^= VVH(v, i, 4); vv[i].hi ^= UUH(v, i, 4); \
108 vv[i].lo ^= VVH(v, i, 5); vv[i].hi ^= UUH(v, i, 5); \
109 vv[i].lo ^= VVH(v, i, 6); vv[i].hi ^= UUH(v, i, 6); \
110 vv[i].lo ^= VVH(v, i, 7); vv[i].hi ^= UUH(v, i, 7); \
113 #define ROWZ(vv, v, i) do { \
114 vv[i].lo = UUL(v, i, 0); vv[i].hi = VVL(v, i, 0); \
118 #define ROWK(vv, v, i, k) do { \
120 vv[i].lo ^= UUL(v, i, 0); vv[i].hi ^= VVL(v, i, 0); \
126 #define RHO(vv, v, kk, k) do { \
127 ROWK(kk, k, 0, *c++); ROWK(vv, v, 0, kk[0]); \
128 ROWZ(kk, k, 1); ROWK(vv, v, 1, kk[1]); \
129 ROWZ(kk, k, 2); ROWK(vv, v, 2, kk[2]); \
130 ROWZ(kk, k, 3); ROWK(vv, v, 3, kk[3]); \
131 ROWZ(kk, k, 4); ROWK(vv, v, 4, kk[4]); \
132 ROWZ(kk, k, 5); ROWK(vv, v, 5, kk[5]); \
133 ROWZ(kk, k, 6); ROWK(vv, v, 6, kk[6]); \
134 ROWZ(kk, k, 7); ROWK(vv, v, 7, kk[7]); \
137 void whirlpool_compress(whirlpool_ctx *ctx, const void *sbuf)
139 kludge64 m[8], k[8], kk[8], v[8], vv[8];
140 const kludge64 *c = whirlpool_c;
141 const octet *s = sbuf;
144 for (i = 0; i < 8; i++) {
145 LOAD64_L_(m[i], &s[i * 8]);
146 XOR64(v[i], m[i], ctx->s[i]);
149 RHO(vv, v, kk, ctx->s);
160 for (i = 0; i < 8; i++) {
161 XOR64(ctx->s[i], ctx->s[i], m[i]);
162 XOR64(ctx->s[i], ctx->s[i], v[i]);
166 /* --- @whirlpool_init@, @whirlpool256_init@ --- *
168 * Arguments: @whirlpool_ctx *ctx@ = pointer to context block to initialize
172 * Use: Initializes a context block ready for hashing.
175 void whirlpool_init(whirlpool_ctx *ctx)
179 for (i = 0; i < 8; i++)
180 SET64(ctx->s[i], 0, 0);
182 ctx->nh = ctx->nl = 0;
185 /* --- @whirlpool_set@, @whirlpool256_set@ --- *
187 * Arguments: @whirlpool_ctx *ctx@ = pointer to context block
188 * @const void *buf@ = pointer to state buffer
189 * @unsigned long count@ = current count of bytes processed
193 * Use: Initializes a context block from a given state. This is
194 * useful in cases where the initial hash state is meant to be
195 * secret, e.g., for NMAC and HMAC support.
198 void whirlpool_set(whirlpool_ctx *ctx, const void *buf, unsigned long count)
200 const octet *p = buf;
203 for (i = 0; i < 8; i++) {
204 LOAD64_L_(ctx->s[i], p);
208 ctx->nl = U32(count);
209 ctx->nh = U32(((count & ~MASK32) >> 16) >> 16);
212 /* --- @whirlpool_hash@, @whirlpool256_hash@ --- *
214 * Arguments: @whirlpool_ctx *ctx@ = pointer to context block
215 * @const void *buf@ = buffer of data to hash
216 * @size_t sz@ = size of buffer to hash
220 * Use: Hashes a buffer of data. The buffer may be of any size and
224 void whirlpool_hash(whirlpool_ctx *ctx, const void *buf, size_t sz)
226 HASH_BUFFER(WHIRLPOOL, whirlpool, ctx, buf, sz);
229 /* --- @whirlpool_done@, @whirlpool256_done@ --- *
231 * Arguments: @whirlpool_ctx *ctx@ = pointer to context block
232 * @void *hash@ = pointer to output buffer
236 * Use: Returns the hash of the data read so far.
239 static void final(whirlpool_ctx *ctx)
241 HASH_PAD(WHIRLPOOL, whirlpool, ctx, 0x80, 0, 32);
242 memset(ctx->buf + WHIRLPOOL_BUFSZ - 32, 0, 24);
243 STORE32(ctx->buf + WHIRLPOOL_BUFSZ - 8, (ctx->nl >> 29) | (ctx->nh << 3));
244 STORE32(ctx->buf + WHIRLPOOL_BUFSZ - 4, ctx->nl << 3);
245 whirlpool_compress(ctx, ctx->buf);
248 void whirlpool_done(whirlpool_ctx *ctx, void *hash)
254 for (i = 0; i < 8; i++) {
255 STORE64_L_(p, ctx->s[i]);
260 void whirlpool256_done(whirlpool256_ctx *ctx, void *hash)
266 for (i = 0; i < 4; i++) {
267 STORE64_L_(p, ctx->s[i]);
272 /* --- @whirlpool_state@, @whirlpool256_state@ --- *
274 * Arguments: @whirlpool_ctx *ctx@ = pointer to context
275 * @void *state@ = pointer to buffer for current state
277 * Returns: Number of bytes written to the hash function so far.
279 * Use: Returns the current state of the hash function such that
280 * it can be passed to @whirlpool_set@.
283 unsigned long whirlpool_state(whirlpool_ctx *ctx, void *state)
288 for (i = 0; i < 8; i++) {
289 STORE64_L_(p, ctx->s[i]);
292 return (ctx->nl | ((ctx->nh << 16) << 16));
295 /* --- Generic interface --- */
297 GHASH_DEF(WHIRLPOOL, whirlpool)
299 /* --- Test code --- */
301 HASH_TEST(WHIRLPOOL, whirlpool)
303 /*----- That's all, folks -------------------------------------------------*/