/src/libtomcrypt/src/hashes/whirl/whirl.c

Source (jump to first uncovered line)
/* LibTomCrypt, modular cryptographic library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */

/**
   @file whirl.c
   LTC_WHIRLPOOL (using their new sbox) hash function by Tom St Denis
*/

#include "tomcrypt_private.h"

#ifdef LTC_WHIRLPOOL

const struct ltc_hash_descriptor whirlpool_desc =
{
    "whirlpool",
    11,
    64,
    64,

   /* OID */
   { 1, 0, 10118, 3, 0, 55 },
   6,

    &whirlpool_init,
    &whirlpool_process,
    &whirlpool_done,
    &whirlpool_test,
    NULL
};

/* the sboxes */
#define LTC_WHIRLTAB_C
#include "whirltab.c"

/* get a_{i,j} */
#define GB(a,i,j) ((a[(i) & 7] >> (8 * (j))) & 255)

/* shortcut macro to perform three functions at once */
#define theta_pi_gamma(a, i)             \
   (SB0(GB(a, i-0, 7)) ^                 \
    SB1(GB(a, i-1, 6)) ^                 \
    SB2(GB(a, i-2, 5)) ^                 \
    SB3(GB(a, i-3, 4)) ^                 \
    SB4(GB(a, i-4, 3)) ^                 \
    SB5(GB(a, i-5, 2)) ^                 \
    SB6(GB(a, i-6, 1)) ^                 \
    SB7(GB(a, i-7, 0)))

#ifdef LTC_CLEAN_STACK
static int ss_whirlpool_compress(hash_state *md, const unsigned char *buf)
#else
static int s_whirlpool_compress(hash_state *md, const unsigned char *buf)
#endif
{
   ulong64 K[2][8], T[3][8];
   int x, y;

   /* load the block/state */
   for (x = 0; x < 8; x++) {
      K[0][x] = md->whirlpool.state[x];

      LOAD64H(T[0][x], buf + (8 * x));
      T[2][x]  = T[0][x];
      T[0][x] ^= K[0][x];
   }

   /* do rounds 1..10 */
   for (x = 0; x < 10; x += 2) {
       /* odd round */
       /* apply main transform to K[0] into K[1] */
       for (y = 0; y < 8; y++) {
           K[1][y] = theta_pi_gamma(K[0], y);
       }
       /* xor the constant */
       K[1][0] ^= cont[x];

       /* apply main transform to T[0] into T[1] */
       for (y = 0; y < 8; y++) {
           T[1][y] = theta_pi_gamma(T[0], y) ^ K[1][y];
       }

       /* even round */
       /* apply main transform to K[1] into K[0] */
       for (y = 0; y < 8; y++) {
           K[0][y] = theta_pi_gamma(K[1], y);
       }
       /* xor the constant */
       K[0][0] ^= cont[x+1];

       /* apply main transform to T[1] into T[0] */
       for (y = 0; y < 8; y++) {
           T[0][y] = theta_pi_gamma(T[1], y) ^ K[0][y];
       }
   }

   /* store state */
   for (x = 0; x < 8; x++) {
      md->whirlpool.state[x] ^= T[0][x] ^ T[2][x];
   }

   return CRYPT_OK;
}


#ifdef LTC_CLEAN_STACK
static int s_whirlpool_compress(hash_state *md, const unsigned char *buf)
{
   int err;
   err = ss_whirlpool_compress(md, buf);
   burn_stack((5 * 8 * sizeof(ulong64)) + (2 * sizeof(int)));
   return err;
}
#endif


/**
   Initialize the hash state
   @param md   The hash state you wish to initialize
   @return CRYPT_OK if successful
*/
int whirlpool_init(hash_state * md)
{
   LTC_ARGCHK(md != NULL);
   zeromem(&md->whirlpool, sizeof(md->whirlpool));
   return CRYPT_OK;
}

/**
   Process a block of memory though the hash
   @param md     The hash state
   @param in     The data to hash
   @param inlen  The length of the data (octets)
   @return CRYPT_OK if successful
*/
HASH_PROCESS(whirlpool_process, s_whirlpool_compress, whirlpool, 64)

/**
   Terminate the hash to get the digest
   @param md  The hash state
   @param out [out] The destination of the hash (64 bytes)
   @return CRYPT_OK if successful
*/
int whirlpool_done(hash_state * md, unsigned char *out)
{
    int i;

    LTC_ARGCHK(md  != NULL);
    LTC_ARGCHK(out != NULL);

    if (md->whirlpool.curlen >= sizeof(md->whirlpool.buf)) {
       return CRYPT_INVALID_ARG;
    }

    /* increase the length of the message */
    md->whirlpool.length += md->whirlpool.curlen * 8;

    /* append the '1' bit */
    md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0x80;

    /* if the length is currently above 32 bytes we append zeros
     * then compress.  Then we can fall back to padding zeros and length
     * encoding like normal.
     */
    if (md->whirlpool.curlen > 32) {
        while (md->whirlpool.curlen < 64) {
            md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
        }
        s_whirlpool_compress(md, md->whirlpool.buf);
        md->whirlpool.curlen = 0;
    }

    /* pad upto 56 bytes of zeroes (should be 32 but we only support 64-bit lengths)  */
    while (md->whirlpool.curlen < 56) {
        md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
    }

    /* store length */
    STORE64H(md->whirlpool.length, md->whirlpool.buf+56);
    s_whirlpool_compress(md, md->whirlpool.buf);

    /* copy output */
    for (i = 0; i < 8; i++) {
        STORE64H(md->whirlpool.state[i], out+(8*i));
    }
#ifdef LTC_CLEAN_STACK
    zeromem(md, sizeof(*md));
#endif
    return CRYPT_OK;
}

/**
  Self-test the hash
  @return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
*/
int  whirlpool_test(void)
{
 #ifndef LTC_TEST
    return CRYPT_NOP;
 #else
  static const struct {
      int len;
      unsigned char msg[128], hash[64];
  } tests[] = {

  /* NULL Message */
{
  0,
  { 0x00 },
  { 0x19, 0xFA, 0x61, 0xD7, 0x55, 0x22, 0xA4, 0x66, 0x9B, 0x44, 0xE3, 0x9C, 0x1D, 0x2E, 0x17, 0x26,
    0xC5, 0x30, 0x23, 0x21, 0x30, 0xD4, 0x07, 0xF8, 0x9A, 0xFE, 0xE0, 0x96, 0x49, 0x97, 0xF7, 0xA7,
    0x3E, 0x83, 0xBE, 0x69, 0x8B, 0x28, 0x8F, 0xEB, 0xCF, 0x88, 0xE3, 0xE0, 0x3C, 0x4F, 0x07, 0x57,
    0xEA, 0x89, 0x64, 0xE5, 0x9B, 0x63, 0xD9, 0x37, 0x08, 0xB1, 0x38, 0xCC, 0x42, 0xA6, 0x6E, 0xB3 }
},


   /* 448-bits of 0 bits */
{

  56,
  { 0x00 },
  { 0x0B, 0x3F, 0x53, 0x78, 0xEB, 0xED, 0x2B, 0xF4, 0xD7, 0xBE, 0x3C, 0xFD, 0x81, 0x8C, 0x1B, 0x03,
    0xB6, 0xBB, 0x03, 0xD3, 0x46, 0x94, 0x8B, 0x04, 0xF4, 0xF4, 0x0C, 0x72, 0x6F, 0x07, 0x58, 0x70,
    0x2A, 0x0F, 0x1E, 0x22, 0x58, 0x80, 0xE3, 0x8D, 0xD5, 0xF6, 0xED, 0x6D, 0xE9, 0xB1, 0xE9, 0x61,
    0xE4, 0x9F, 0xC1, 0x31, 0x8D, 0x7C, 0xB7, 0x48, 0x22, 0xF3, 0xD0, 0xE2, 0xE9, 0xA7, 0xE7, 0xB0 }
},

   /* 520-bits of 0 bits */
{
  65,
  { 0x00 },
  { 0x85, 0xE1, 0x24, 0xC4, 0x41, 0x5B, 0xCF, 0x43, 0x19, 0x54, 0x3E, 0x3A, 0x63, 0xFF, 0x57, 0x1D,
    0x09, 0x35, 0x4C, 0xEE, 0xBE, 0xE1, 0xE3, 0x25, 0x30, 0x8C, 0x90, 0x69, 0xF4, 0x3E, 0x2A, 0xE4,
    0xD0, 0xE5, 0x1D, 0x4E, 0xB1, 0xE8, 0x64, 0x28, 0x70, 0x19, 0x4E, 0x95, 0x30, 0xD8, 0xD8, 0xAF,
    0x65, 0x89, 0xD1, 0xBF, 0x69, 0x49, 0xDD, 0xF9, 0x0A, 0x7F, 0x12, 0x08, 0x62, 0x37, 0x95, 0xB9 }
},

   /* 512-bits, leading set */
{
  64,
  { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  { 0x10, 0x3E, 0x00, 0x55, 0xA9, 0xB0, 0x90, 0xE1, 0x1C, 0x8F, 0xDD, 0xEB, 0xBA, 0x06, 0xC0, 0x5A,
    0xCE, 0x8B, 0x64, 0xB8, 0x96, 0x12, 0x8F, 0x6E, 0xED, 0x30, 0x71, 0xFC, 0xF3, 0xDC, 0x16, 0x94,
    0x67, 0x78, 0xE0, 0x72, 0x23, 0x23, 0x3F, 0xD1, 0x80, 0xFC, 0x40, 0xCC, 0xDB, 0x84, 0x30, 0xA6,
    0x40, 0xE3, 0x76, 0x34, 0x27, 0x1E, 0x65, 0x5C, 0xA1, 0x67, 0x4E, 0xBF, 0xF5, 0x07, 0xF8, 0xCB }
},

   /* 512-bits, leading set of second byte */
{
  64,
  { 0x00, 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  { 0x35, 0x7B, 0x42, 0xEA, 0x79, 0xBC, 0x97, 0x86, 0x97, 0x5A, 0x3C, 0x44, 0x70, 0xAA, 0xB2, 0x3E,
    0x62, 0x29, 0x79, 0x7B, 0xAD, 0xBD, 0x54, 0x36, 0x5B, 0x54, 0x96, 0xE5, 0x5D, 0x9D, 0xD7, 0x9F,
    0xE9, 0x62, 0x4F, 0xB4, 0x22, 0x66, 0x93, 0x0A, 0x62, 0x8E, 0xD4, 0xDB, 0x08, 0xF9, 0xDD, 0x35,
    0xEF, 0x1B, 0xE1, 0x04, 0x53, 0xFC, 0x18, 0xF4, 0x2C, 0x7F, 0x5E, 0x1F, 0x9B, 0xAE, 0x55, 0xE0 }
},

   /* 512-bits, leading set of last byte */
{
  64,
  { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80 },
  { 0x8B, 0x39, 0x04, 0xDD, 0x19, 0x81, 0x41, 0x26, 0xFD, 0x02, 0x74, 0xAB, 0x49, 0xC5, 0x97, 0xF6,
    0xD7, 0x75, 0x33, 0x52, 0xA2, 0xDD, 0x91, 0xFD, 0x8F, 0x9F, 0x54, 0x05, 0x4C, 0x54, 0xBF, 0x0F,
    0x06, 0xDB, 0x4F, 0xF7, 0x08, 0xA3, 0xA2, 0x8B, 0xC3, 0x7A, 0x92, 0x1E, 0xEE, 0x11, 0xED, 0x7B,
    0x6A, 0x53, 0x79, 0x32, 0xCC, 0x5E, 0x94, 0xEE, 0x1E, 0xA6, 0x57, 0x60, 0x7E, 0x36, 0xC9, 0xF7 }
},

};

  int i;
  unsigned char tmp[64];
  hash_state md;

  for (i = 0; i < (int)(sizeof(tests)/sizeof(tests[0])); i++) {
      whirlpool_init(&md);
      whirlpool_process(&md, (unsigned char *)tests[i].msg, tests[i].len);
      whirlpool_done(&md, tmp);
      if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "WHIRLPOOL", i)) {
         return CRYPT_FAIL_TESTVECTOR;
      }
  }
  return CRYPT_OK;
 #endif
}


#endif


Coverage Report

Created: 2024-11-21 07:03

Line	Count	Source (jump to first uncovered line)
1		/* LibTomCrypt, modular cryptographic library -- Tom St Denis */
2		/* SPDX-License-Identifier: Unlicense */
3
4		/**
5		@file whirl.c
6		LTC_WHIRLPOOL (using their new sbox) hash function by Tom St Denis
7		*/
8
9		#include "tomcrypt_private.h"
10
11		#ifdef LTC_WHIRLPOOL
12
13		const struct ltc_hash_descriptor whirlpool_desc =
14		{
15		"whirlpool",
16		11,
17		64,
18		64,
19
20		/* OID */
21		{ 1, 0, 10118, 3, 0, 55 },
22		6,
23
24		&whirlpool_init,
25		&whirlpool_process,
26		&whirlpool_done,
27		&whirlpool_test,
28		NULL
29		};
30
31		/* the sboxes */
32		#define LTC_WHIRLTAB_C
33		#include "whirltab.c"
34
35		/* get a_{i,j} */
36		#define GB(a,i,j) ((a[(i) & 7] >> (8 * (j))) & 255)
37
38		/* shortcut macro to perform three functions at once */
39		#define theta_pi_gamma(a, i) \
40	12.4M	(SB0(GB(a, i-0, 7)) ^ \
41	12.4M	SB1(GB(a, i-1, 6)) ^ \
42	12.4M	SB2(GB(a, i-2, 5)) ^ \
43	12.4M	SB3(GB(a, i-3, 4)) ^ \
44	12.4M	SB4(GB(a, i-4, 3)) ^ \
45	12.4M	SB5(GB(a, i-5, 2)) ^ \
46	12.4M	SB6(GB(a, i-6, 1)) ^ \
47	12.4M	SB7(GB(a, i-7, 0)))
48
49		#ifdef LTC_CLEAN_STACK
50		static int ss_whirlpool_compress(hash_state md, const unsigned char buf)
51		#else
52		static int s_whirlpool_compress(hash_state md, const unsigned char buf)
53		#endif
54	78.1k	{
55	78.1k	ulong64 K[2][8], T[3][8];
56	78.1k	int x, y;
57
58		/* load the block/state */
59	702k	for (x = 0; x < 8; x++) {
60	624k	K[0][x] = md->whirlpool.state[x];
61
62	624k	LOAD64H(T[0][x], buf + (8 * x));
63	624k	T[2][x] = T[0][x];
64	624k	T[0][x] ^= K[0][x];
65	624k	}
66
67		/* do rounds 1..10 */
68	468k	for (x = 0; x < 10; x += 2) {
69		/* odd round */
70		/* apply main transform to K[0] into K[1] */
71	3.51M	for (y = 0; y < 8; y++) {
72	3.12M	K[1][y] = theta_pi_gamma(K[0], y);
73	3.12M	}
74		/* xor the constant */
75	390k	K[1][0] ^= cont[x];
76
77		/* apply main transform to T[0] into T[1] */
78	3.51M	for (y = 0; y < 8; y++) {
79	3.12M	T[1][y] = theta_pi_gamma(T[0], y) ^ K[1][y];
80	3.12M	}
81
82		/* even round */
83		/* apply main transform to K[1] into K[0] */
84	3.51M	for (y = 0; y < 8; y++) {
85	3.12M	K[0][y] = theta_pi_gamma(K[1], y);
86	3.12M	}
87		/* xor the constant */
88	390k	K[0][0] ^= cont[x+1];
89
90		/* apply main transform to T[1] into T[0] */
91	3.51M	for (y = 0; y < 8; y++) {
92	3.12M	T[0][y] = theta_pi_gamma(T[1], y) ^ K[0][y];
93	3.12M	}
94	390k	}
95
96		/* store state */
97	702k	for (x = 0; x < 8; x++) {
98	624k	md->whirlpool.state[x] ^= T[0][x] ^ T[2][x];
99	624k	}
100
101	78.1k	return CRYPT_OK;
102	78.1k	}
103
104
105		#ifdef LTC_CLEAN_STACK
106		static int s_whirlpool_compress(hash_state md, const unsigned char buf)
107		{
108		int err;
109		err = ss_whirlpool_compress(md, buf);
110		burn_stack((5 * 8 * sizeof(ulong64)) + (2 * sizeof(int)));
111		return err;
112		}
113		#endif
114
115
116		/**
117		Initialize the hash state
118		@param md The hash state you wish to initialize
119		@return CRYPT_OK if successful
120		*/
121		int whirlpool_init(hash_state * md)
122	3.07k	{
123	3.07k	LTC_ARGCHK(md != NULL);
124	3.07k	zeromem(&md->whirlpool, sizeof(md->whirlpool));
125	3.07k	return CRYPT_OK;
126	3.07k	}
127
128		/**
129		Process a block of memory though the hash
130		@param md The hash state
131		@param in The data to hash
132		@param inlen The length of the data (octets)
133		@return CRYPT_OK if successful
134		*/
135		HASH_PROCESS(whirlpool_process, s_whirlpool_compress, whirlpool, 64)
136
137		/**
138		Terminate the hash to get the digest
139		@param md The hash state
140		@param out [out] The destination of the hash (64 bytes)
141		@return CRYPT_OK if successful
142		*/
143		int whirlpool_done(hash_state * md, unsigned char *out)
144	3.07k	{
145	3.07k	int i;
146
147	3.07k	LTC_ARGCHK(md != NULL);
148	3.07k	LTC_ARGCHK(out != NULL);
149
150	3.07k	if (md->whirlpool.curlen >= sizeof(md->whirlpool.buf)) {
151	0	return CRYPT_INVALID_ARG;
152	0	}
153
154		/* increase the length of the message */
155	3.07k	md->whirlpool.length += md->whirlpool.curlen * 8;
156
157		/* append the '1' bit */
158	3.07k	md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0x80;
159
160		/* if the length is currently above 32 bytes we append zeros
161		* then compress. Then we can fall back to padding zeros and length
162		* encoding like normal.
163		*/
164	3.07k	if (md->whirlpool.curlen > 32) {
165	10.0k	while (md->whirlpool.curlen < 64) {
166	9.23k	md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
167	9.23k	}
168	770	s_whirlpool_compress(md, md->whirlpool.buf);
169	770	md->whirlpool.curlen = 0;
170	770	}
171
172		/* pad upto 56 bytes of zeroes (should be 32 but we only support 64-bit lengths) */
173	163k	while (md->whirlpool.curlen < 56) {
174	160k	md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
175	160k	}
176
177		/* store length */
178	3.07k	STORE64H(md->whirlpool.length, md->whirlpool.buf+56);
179	3.07k	s_whirlpool_compress(md, md->whirlpool.buf);
180
181		/* copy output */
182	27.6k	for (i = 0; i < 8; i++) {
183	24.5k	STORE64H(md->whirlpool.state[i], out+(8*i));
184	24.5k	}
185		#ifdef LTC_CLEAN_STACK
186		zeromem(md, sizeof(*md));
187		#endif
188	3.07k	return CRYPT_OK;
189	3.07k	}
190
191		/**
192		Self-test the hash
193		@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
194		*/
195		int whirlpool_test(void)
196	0	{
197		#ifndef LTC_TEST
198		return CRYPT_NOP;
199		#else
200	0	static const struct {
201	0	int len;
202	0	unsigned char msg[128], hash[64];
203	0	} tests[] = {
204
205		/* NULL Message */
206	0	{
207	0	0,
208	0	{ 0x00 },
209	0	{ 0x19, 0xFA, 0x61, 0xD7, 0x55, 0x22, 0xA4, 0x66, 0x9B, 0x44, 0xE3, 0x9C, 0x1D, 0x2E, 0x17, 0x26,
210	0	0xC5, 0x30, 0x23, 0x21, 0x30, 0xD4, 0x07, 0xF8, 0x9A, 0xFE, 0xE0, 0x96, 0x49, 0x97, 0xF7, 0xA7,
211	0	0x3E, 0x83, 0xBE, 0x69, 0x8B, 0x28, 0x8F, 0xEB, 0xCF, 0x88, 0xE3, 0xE0, 0x3C, 0x4F, 0x07, 0x57,
212	0	0xEA, 0x89, 0x64, 0xE5, 0x9B, 0x63, 0xD9, 0x37, 0x08, 0xB1, 0x38, 0xCC, 0x42, 0xA6, 0x6E, 0xB3 }
213	0	},
214
215
216		/* 448-bits of 0 bits */
217	0	{
218
219	0	56,
220	0	{ 0x00 },
221	0	{ 0x0B, 0x3F, 0x53, 0x78, 0xEB, 0xED, 0x2B, 0xF4, 0xD7, 0xBE, 0x3C, 0xFD, 0x81, 0x8C, 0x1B, 0x03,
222	0	0xB6, 0xBB, 0x03, 0xD3, 0x46, 0x94, 0x8B, 0x04, 0xF4, 0xF4, 0x0C, 0x72, 0x6F, 0x07, 0x58, 0x70,
223	0	0x2A, 0x0F, 0x1E, 0x22, 0x58, 0x80, 0xE3, 0x8D, 0xD5, 0xF6, 0xED, 0x6D, 0xE9, 0xB1, 0xE9, 0x61,
224	0	0xE4, 0x9F, 0xC1, 0x31, 0x8D, 0x7C, 0xB7, 0x48, 0x22, 0xF3, 0xD0, 0xE2, 0xE9, 0xA7, 0xE7, 0xB0 }
225	0	},
226
227		/* 520-bits of 0 bits */
228	0	{
229	0	65,
230	0	{ 0x00 },
231	0	{ 0x85, 0xE1, 0x24, 0xC4, 0x41, 0x5B, 0xCF, 0x43, 0x19, 0x54, 0x3E, 0x3A, 0x63, 0xFF, 0x57, 0x1D,
232	0	0x09, 0x35, 0x4C, 0xEE, 0xBE, 0xE1, 0xE3, 0x25, 0x30, 0x8C, 0x90, 0x69, 0xF4, 0x3E, 0x2A, 0xE4,
233	0	0xD0, 0xE5, 0x1D, 0x4E, 0xB1, 0xE8, 0x64, 0x28, 0x70, 0x19, 0x4E, 0x95, 0x30, 0xD8, 0xD8, 0xAF,
234	0	0x65, 0x89, 0xD1, 0xBF, 0x69, 0x49, 0xDD, 0xF9, 0x0A, 0x7F, 0x12, 0x08, 0x62, 0x37, 0x95, 0xB9 }
235	0	},
236
237		/* 512-bits, leading set */
238	0	{
239	0	64,
240	0	{ 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
241	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
242	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
243	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
244	0	{ 0x10, 0x3E, 0x00, 0x55, 0xA9, 0xB0, 0x90, 0xE1, 0x1C, 0x8F, 0xDD, 0xEB, 0xBA, 0x06, 0xC0, 0x5A,
245	0	0xCE, 0x8B, 0x64, 0xB8, 0x96, 0x12, 0x8F, 0x6E, 0xED, 0x30, 0x71, 0xFC, 0xF3, 0xDC, 0x16, 0x94,
246	0	0x67, 0x78, 0xE0, 0x72, 0x23, 0x23, 0x3F, 0xD1, 0x80, 0xFC, 0x40, 0xCC, 0xDB, 0x84, 0x30, 0xA6,
247	0	0x40, 0xE3, 0x76, 0x34, 0x27, 0x1E, 0x65, 0x5C, 0xA1, 0x67, 0x4E, 0xBF, 0xF5, 0x07, 0xF8, 0xCB }
248	0	},
249
250		/* 512-bits, leading set of second byte */
251	0	{
252	0	64,
253	0	{ 0x00, 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
254	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
255	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
256	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
257	0	{ 0x35, 0x7B, 0x42, 0xEA, 0x79, 0xBC, 0x97, 0x86, 0x97, 0x5A, 0x3C, 0x44, 0x70, 0xAA, 0xB2, 0x3E,
258	0	0x62, 0x29, 0x79, 0x7B, 0xAD, 0xBD, 0x54, 0x36, 0x5B, 0x54, 0x96, 0xE5, 0x5D, 0x9D, 0xD7, 0x9F,
259	0	0xE9, 0x62, 0x4F, 0xB4, 0x22, 0x66, 0x93, 0x0A, 0x62, 0x8E, 0xD4, 0xDB, 0x08, 0xF9, 0xDD, 0x35,
260	0	0xEF, 0x1B, 0xE1, 0x04, 0x53, 0xFC, 0x18, 0xF4, 0x2C, 0x7F, 0x5E, 0x1F, 0x9B, 0xAE, 0x55, 0xE0 }
261	0	},
262
263		/* 512-bits, leading set of last byte */
264	0	{
265	0	64,
266	0	{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
267	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
268	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
269	0	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80 },
270	0	{ 0x8B, 0x39, 0x04, 0xDD, 0x19, 0x81, 0x41, 0x26, 0xFD, 0x02, 0x74, 0xAB, 0x49, 0xC5, 0x97, 0xF6,
271	0	0xD7, 0x75, 0x33, 0x52, 0xA2, 0xDD, 0x91, 0xFD, 0x8F, 0x9F, 0x54, 0x05, 0x4C, 0x54, 0xBF, 0x0F,
272	0	0x06, 0xDB, 0x4F, 0xF7, 0x08, 0xA3, 0xA2, 0x8B, 0xC3, 0x7A, 0x92, 0x1E, 0xEE, 0x11, 0xED, 0x7B,
273	0	0x6A, 0x53, 0x79, 0x32, 0xCC, 0x5E, 0x94, 0xEE, 0x1E, 0xA6, 0x57, 0x60, 0x7E, 0x36, 0xC9, 0xF7 }
274	0	},
275
276	0	};
277
278	0	int i;
279	0	unsigned char tmp[64];
280	0	hash_state md;
281
282	0	for (i = 0; i < (int)(sizeof(tests)/sizeof(tests[0])); i++) {
283	0	whirlpool_init(&md);
284	0	whirlpool_process(&md, (unsigned char *)tests[i].msg, tests[i].len);
285	0	whirlpool_done(&md, tmp);
286	0	if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "WHIRLPOOL", i)) {
287	0	return CRYPT_FAIL_TESTVECTOR;
288	0	}
289	0	}
290	0	return CRYPT_OK;
291	0	#endif
292	0	}
293
294
295		#endif
296