[u/mdw/catacomb] / rmd320.c

/* -*-c-*-
 *
 * $Id: rmd320.c,v 1.1 2000/07/09 21:30:31 mdw Exp $
 *
 * The RIPEMD-320 message digest function
 *
 * (c) 1998 Straylight/Edgeware
 */

/*----- Licensing notice --------------------------------------------------* 
 *
 * This file is part of Catacomb.
 *
 * Catacomb is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Library General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 * 
 * Catacomb is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Library General Public License for more details.
 * 
 * You should have received a copy of the GNU Library General Public
 * License along with Catacomb; if not, write to the Free
 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 * MA 02111-1307, USA.
 */

/*----- Revision history --------------------------------------------------*
 *
 * $Log: rmd320.c,v $
 * Revision 1.1  2000/07/09 21:30:31  mdw
 * New RIPEMD variants.
 *
 */

/*----- Header files ------------------------------------------------------*/

#include <mLib/bits.h>

#include "ghash.h"
#include "ghash-def.h"
#include "hash.h"
#include "rmd320.h"

/*----- Main code ---------------------------------------------------------*/

/* --- @rmd320_compress@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context block
 *		@const void *sbuf@ = pointer to buffer of appropriate size
 *
 * Returns:	---
 *
 * Use:		RIPEMD-320 compression function.
 */

void rmd320_compress(rmd320_ctx *ctx, const void *sbuf)
{
  uint32 a, b, c, d, e;
  uint32 A, B, C, D, E;
  uint32 buf[16];

  /* --- Fetch the chaining variables --- */

  a = ctx->a;
  b = ctx->b;
  c = ctx->c;
  d = ctx->d;
  e = ctx->e;

  A = ctx->A;
  B = ctx->B;
  C = ctx->C;
  D = ctx->D;
  E = ctx->E;

  /* --- Fetch the buffer contents --- */

  {
    int i;
    const octet *p;

    for (i = 0, p = sbuf; i < 16; i++, p += 4)
      buf[i] = LOAD32_L(p);
  }

  /* --- Definitions for round functions --- */

#define F(x, y, z) ((x) ^ (y) ^ (z))
#define G(x, y, z) (((x) & (y)) | (~(x) & (z)))
#define H(x, y, z) (((x) | ~(y)) ^ (z))
#define I(x, y, z) (((x) & (z)) | ((y) & ~(z)))
#define J(x, y, z) ((x) ^ ((y) | ~(z)))

#define T(v, w, x, y, z, i, r, f, k) do {				\
  uint32 _t = v + f(w, x, y) + buf[i] + k;				\
  v = ROL32(_t, r) + z; x = ROL32(x, 10);				\
} while (0)

#define F1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, F, 0x00000000)
#define G1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, G, 0x5a827999)
#define H1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, H, 0x6ed9eba1)
#define I1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, I, 0x8f1bbcdc)
#define J1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, J, 0xa953fd4e)

#define F2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, J, 0x50a28be6)
#define G2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, I, 0x5c4dd124)
#define H2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, H, 0x6d703ef3)
#define I2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, G, 0x7a6d76e9)
#define J2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, F, 0x00000000)

  /* --- We must do both lines together --- */

  F1(a, b, c, d, e,  0, 11);
  F1(e, a, b, c, d,  1, 14);
  F1(d, e, a, b, c,  2, 15);
  F1(c, d, e, a, b,  3, 12);
  F1(b, c, d, e, a,  4,  5);
  F1(a, b, c, d, e,  5,  8);
  F1(e, a, b, c, d,  6,  7);
  F1(d, e, a, b, c,  7,  9);
  F1(c, d, e, a, b,  8, 11);
  F1(b, c, d, e, a,  9, 13);
  F1(a, b, c, d, e, 10, 14);
  F1(e, a, b, c, d, 11, 15);
  F1(d, e, a, b, c, 12,  6);
  F1(c, d, e, a, b, 13,  7);
  F1(b, c, d, e, a, 14,  9);
  F1(a, b, c, d, e, 15,  8);
                  
  F2(A, B, C, D, E,  5,	 8);
  F2(E, A, B, C, D, 14,	 9);
  F2(D, E, A, B, C,  7,	 9);
  F2(C, D, E, A, B,  0,	11);
  F2(B, C, D, E, A,  9,	13);
  F2(A, B, C, D, E,  2,	15);
  F2(E, A, B, C, D, 11,	15);
  F2(D, E, A, B, C,  4,	 5);
  F2(C, D, E, A, B, 13,	 7);
  F2(B, C, D, E, A,  6,	 7);
  F2(A, B, C, D, E, 15,	 8);
  F2(E, A, B, C, D,  8,	11);
  F2(D, E, A, B, C,  1,	14);
  F2(C, D, E, A, B, 10,	14);
  F2(B, C, D, E, A,  3,	12);
  F2(A, B, C, D, E, 12,	 6);

  G1(e, A, b, c, d,  7,	 7);
  G1(d, e, A, b, c,  4,	 6);
  G1(c, d, e, A, b, 13,	 8);
  G1(b, c, d, e, A,  1,	13);
  G1(A, b, c, d, e, 10,	11);
  G1(e, A, b, c, d,  6,	 9);
  G1(d, e, A, b, c, 15,	 7);
  G1(c, d, e, A, b,  3,	15);
  G1(b, c, d, e, A, 12,	 7);
  G1(A, b, c, d, e,  0,	12);
  G1(e, A, b, c, d,  9,	15);
  G1(d, e, A, b, c,  5,	 9);
  G1(c, d, e, A, b,  2,	11);
  G1(b, c, d, e, A, 14,	 7);
  G1(A, b, c, d, e, 11,	13);
  G1(e, A, b, c, d,  8,	12);
                  
  G2(E, a, B, C, D,  6,	 9);
  G2(D, E, a, B, C, 11,	13);
  G2(C, D, E, a, B,  3,	15);
  G2(B, C, D, E, a,  7,	 7);
  G2(a, B, C, D, E,  0,	12);
  G2(E, a, B, C, D, 13,	 8);
  G2(D, E, a, B, C,  5,	 9);
  G2(C, D, E, a, B, 10,	11);
  G2(B, C, D, E, a, 14,	 7);
  G2(a, B, C, D, E, 15,	 7);
  G2(E, a, B, C, D,  8,	12);
  G2(D, E, a, B, C, 12,	 7);
  G2(C, D, E, a, B,  4,	 6);
  G2(B, C, D, E, a,  9,	15);
  G2(a, B, C, D, E,  1,	13);
  G2(E, a, B, C, D,  2,	11);
                  
  H1(d, e, A, B, c,  3,	11);
  H1(c, d, e, A, B, 10,	13);
  H1(B, c, d, e, A, 14,	 6);
  H1(A, B, c, d, e,  4,	 7);
  H1(e, A, B, c, d,  9,	14);
  H1(d, e, A, B, c, 15,	 9);
  H1(c, d, e, A, B,  8,	13);
  H1(B, c, d, e, A,  1,	15);
  H1(A, B, c, d, e,  2,	14);
  H1(e, A, B, c, d,  7,	 8);
  H1(d, e, A, B, c,  0,	13);
  H1(c, d, e, A, B,  6,	 6);
  H1(B, c, d, e, A, 13,	 5);
  H1(A, B, c, d, e, 11,	12);
  H1(e, A, B, c, d,  5,	 7);
  H1(d, e, A, B, c, 12,	 5);
                  
  H2(D, E, a, b, C, 15,	 9);
  H2(C, D, E, a, b,  5,	 7);
  H2(b, C, D, E, a,  1,	15);
  H2(a, b, C, D, E,  3,	11);
  H2(E, a, b, C, D,  7,	 8);
  H2(D, E, a, b, C, 14,	 6);
  H2(C, D, E, a, b,  6,	 6);
  H2(b, C, D, E, a,  9,	14);
  H2(a, b, C, D, E, 11,	12);
  H2(E, a, b, C, D,  8,	13);
  H2(D, E, a, b, C, 12,	 5);
  H2(C, D, E, a, b,  2,	14);
  H2(b, C, D, E, a, 10,	13);
  H2(a, b, C, D, E,  0,	13);
  H2(E, a, b, C, D,  4,	 7);
  H2(D, E, a, b, C, 13,	 5);
                  
  I1(C, d, e, A, B,  1,	11);
  I1(B, C, d, e, A,  9,	12);
  I1(A, B, C, d, e, 11,	14);
  I1(e, A, B, C, d, 10,	15);
  I1(d, e, A, B, C,  0,	14);
  I1(C, d, e, A, B,  8,	15);
  I1(B, C, d, e, A, 12,	 9);
  I1(A, B, C, d, e,  4,	 8);
  I1(e, A, B, C, d, 13,	 9);
  I1(d, e, A, B, C,  3,	14);
  I1(C, d, e, A, B,  7,	 5);
  I1(B, C, d, e, A, 15,	 6);
  I1(A, B, C, d, e, 14,	 8);
  I1(e, A, B, C, d,  5,	 6);
  I1(d, e, A, B, C,  6,	 5);
  I1(C, d, e, A, B,  2,	12);
                  
  I2(c, D, E, a, b,  8,	15);
  I2(b, c, D, E, a,  6,	 5);
  I2(a, b, c, D, E,  4,	 8);
  I2(E, a, b, c, D,  1,	11);
  I2(D, E, a, b, c,  3,	14);
  I2(c, D, E, a, b, 11,	14);
  I2(b, c, D, E, a, 15,	 6);
  I2(a, b, c, D, E,  0,	14);
  I2(E, a, b, c, D,  5,	 6);
  I2(D, E, a, b, c, 12,	 9);
  I2(c, D, E, a, b,  2,	12);
  I2(b, c, D, E, a, 13,	 9);
  I2(a, b, c, D, E,  9,	12);
  I2(E, a, b, c, D,  7,	 5);
  I2(D, E, a, b, c, 10,	15);
  I2(c, D, E, a, b, 14,	 8);

  J1(B, C, D, e, A,  4,	 9);
  J1(A, B, C, D, e,  0,	15);
  J1(e, A, B, C, D,  5,	 5);
  J1(D, e, A, B, C,  9,	11);
  J1(C, D, e, A, B,  7,	 6);
  J1(B, C, D, e, A, 12,	 8);
  J1(A, B, C, D, e,  2,	13);
  J1(e, A, B, C, D, 10,	12);
  J1(D, e, A, B, C, 14,	 5);
  J1(C, D, e, A, B,  1,	12);
  J1(B, C, D, e, A,  3,	13);
  J1(A, B, C, D, e,  8,	14);
  J1(e, A, B, C, D, 11,	11);
  J1(D, e, A, B, C,  6,	 8);
  J1(C, D, e, A, B, 15,	 5);
  J1(B, C, D, e, A, 13,	 6);

  J2(b, c, d, E, a, 12,	 8);
  J2(a, b, c, d, E, 15,	 5);
  J2(E, a, b, c, d, 10,	12);
  J2(d, E, a, b, c,  4,	 9);
  J2(c, d, E, a, b,  1,	12);
  J2(b, c, d, E, a,  5,	 5);
  J2(a, b, c, d, E,  8,	14);
  J2(E, a, b, c, d,  7,	 6);
  J2(d, E, a, b, c,  6,	 8);
  J2(c, d, E, a, b,  2,	13);
  J2(b, c, d, E, a, 13,	 6);
  J2(a, b, c, d, E, 14,	 5);
  J2(E, a, b, c, d,  0,	15);
  J2(d, E, a, b, c,  3,	13);
  J2(c, d, E, a, b,  9,	11);
  J2(b, c, d, E, a, 11,	11);

  /* --- Write out the result --- */

  ctx->a += A;
  ctx->b += B;
  ctx->c += C;
  ctx->d += D;
  ctx->e += E;
  ctx->A += a;
  ctx->B += b;
  ctx->C += c;
  ctx->D += d;
  ctx->E += e;
}

/* --- @rmd320_init@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context block to initialize
 *
 * Returns:	---
 *
 * Use:		Initializes a context block ready for hashing.
 */

void rmd320_init(rmd320_ctx *ctx)
{
  ctx->a = 0x67452301;
  ctx->b = 0xefcdab89;
  ctx->c = 0x98badcfe;
  ctx->d = 0x10325476;
  ctx->e = 0xc3d2e1f0;
  ctx->A = 0x76543210;
  ctx->B = 0xfedcba98;
  ctx->C = 0x89abcdef;
  ctx->D = 0x01234567;
  ctx->E = 0x3c2d1e0f;
  ctx->off = 0;
  ctx->nl = ctx->nh = 0;
}

/* --- @rmd320_set@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context block
 *		@const void *buf@ = pointer to state buffer
 *		@unsigned long count@ = current count of bytes processed
 *
 * Returns:	---
 *
 * Use:		Initializes a context block from a given state.  This is
 *		useful in cases where the initial hash state is meant to be
 *		secret, e.g., for NMAC and HMAC support.
 */

void rmd320_set(rmd320_ctx *ctx, const void *buf, unsigned long count)
{
  const octet *p = buf;
  ctx->a = LOAD32_L(p +  0);
  ctx->b = LOAD32_L(p +  4);
  ctx->c = LOAD32_L(p +  8);
  ctx->d = LOAD32_L(p + 12);
  ctx->e = LOAD32_L(p + 16);
  ctx->A = LOAD32_L(p + 20);
  ctx->B = LOAD32_L(p + 24);
  ctx->C = LOAD32_L(p + 28);
  ctx->D = LOAD32_L(p + 32);
  ctx->E = LOAD32_L(p + 36);
  ctx->off = 0;
  ctx->nl = U32(count);
  ctx->nh = U32(((count & ~MASK32) >> 16) >> 16);
}

/* --- @rmd320_hash@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context block
 *		@const void *buf@ = buffer of data to hash
 *		@size_t sz@ = size of buffer to hash
 *
 * Returns:	---
 *
 * Use:		Hashes a buffer of data.  The buffer may be of any size and
 *		alignment.
 */

void rmd320_hash(rmd320_ctx *ctx, const void *buf, size_t sz)
{
  HASH_BUFFER(RMD320, rmd320, ctx, buf, sz);
}

/* --- @rmd320_done@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context block
 *		@void *hash@ = pointer to output buffer
 *
 * Returns:	---
 *
 * Use:		Returns the hash of the data read so far.
 */

void rmd320_done(rmd320_ctx *ctx, void *hash)
{
  octet *p = hash;
  HASH_MD5STRENGTH(RMD320, rmd320, ctx);
  STORE32_L(p +  0, ctx->a);
  STORE32_L(p +  4, ctx->b);
  STORE32_L(p +  8, ctx->c);
  STORE32_L(p + 12, ctx->d);
  STORE32_L(p + 16, ctx->e);
  STORE32_L(p + 20, ctx->A);
  STORE32_L(p + 24, ctx->B);
  STORE32_L(p + 28, ctx->C);
  STORE32_L(p + 32, ctx->D);
  STORE32_L(p + 36, ctx->E);
}

/* --- @rmd320_state@ --- *
 *
 * Arguments:	@rmd320_ctx *ctx@ = pointer to context
 *		@void *state@ = pointer to buffer for current state
 *
 * Returns:	Number of bytes written to the hash function so far.
 *
 * Use:		Returns the current state of the hash function such that
 *		it can be passed to @rmd320_set@.
 */

unsigned long rmd320_state(rmd320_ctx *ctx, void *state)
{
  octet *p = state;
  STORE32_L(p +  0, ctx->a);
  STORE32_L(p +  4, ctx->b);
  STORE32_L(p +  8, ctx->c);
  STORE32_L(p + 12, ctx->d);
  STORE32_L(p + 16, ctx->e);
  STORE32_L(p + 20, ctx->A);
  STORE32_L(p + 24, ctx->B);
  STORE32_L(p + 28, ctx->C);
  STORE32_L(p + 32, ctx->D);
  STORE32_L(p + 36, ctx->E);
  return (ctx->nl | ((ctx->nh << 16) << 16));
}

/* --- Generic interface --- */

GHASH_DEF(RMD320, rmd320)

/* --- Test code --- */

HASH_TEST(RMD320, rmd320)

/*----- That's all, folks -------------------------------------------------*/
Commit	Line	Data
1c64c8e2	1	/* --c--
	2	*
	3	* $Id: rmd320.c,v 1.1 2000/07/09 21:30:31 mdw Exp $
	4	*
	5	* The RIPEMD-320 message digest function
	6	*
	7	* (c) 1998 Straylight/Edgeware
	8	*/
	9
	10	/----- Licensing notice --------------------------------------------------
	11	*
	12	* This file is part of Catacomb.
	13	*
	14	* Catacomb is free software; you can redistribute it and/or modify
	15	* it under the terms of the GNU Library General Public License as
	16	* published by the Free Software Foundation; either version 2 of the
	17	* License, or (at your option) any later version.
	18	*
	19	* Catacomb is distributed in the hope that it will be useful,
	20	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	21	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	22	* GNU Library General Public License for more details.
	23	*
	24	* You should have received a copy of the GNU Library General Public
	25	* License along with Catacomb; if not, write to the Free
	26	* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
	27	* MA 02111-1307, USA.
	28	*/
	29
	30	/----- Revision history --------------------------------------------------
	31	*
	32	* $Log: rmd320.c,v $
	33	* Revision 1.1 2000/07/09 21:30:31 mdw
	34	* New RIPEMD variants.
	35	*
	36	*/
	37
	38	/----- Header files ------------------------------------------------------/
	39
	40	#include <mLib/bits.h>
	41
	42	#include "ghash.h"
	43	#include "ghash-def.h"
	44	#include "hash.h"
	45	#include "rmd320.h"
	46
	47	/----- Main code ---------------------------------------------------------/
	48
	49	/* --- @rmd320_compress@ --- *
	50	*
	51	* Arguments: @rmd320_ctx *ctx@ = pointer to context block
	52	* @const void *sbuf@ = pointer to buffer of appropriate size
	53	*
	54	* Returns: ---
	55	*
	56	* Use: RIPEMD-320 compression function.
	57	*/
	58
	59	void rmd320_compress(rmd320_ctx ctx, const void sbuf)
	60	{
	61	uint32 a, b, c, d, e;
	62	uint32 A, B, C, D, E;
	63	uint32 buf[16];
	64
65	/* --- Fetch the chaining variables --- */
66
67	a = ctx->a;
68	b = ctx->b;
69	c = ctx->c;
70	d = ctx->d;
71	e = ctx->e;
72
73	A = ctx->A;
74	B = ctx->B;
75	C = ctx->C;
76	D = ctx->D;
77	E = ctx->E;
78
79	/* --- Fetch the buffer contents --- */
80
81	{
82	int i;
83	const octet *p;
84
85	for (i = 0, p = sbuf; i < 16; i++, p += 4)
86	buf[i] = LOAD32_L(p);
87	}
88
89	/* --- Definitions for round functions --- */
90
91	#define F(x, y, z) ((x) ^ (y) ^ (z))
92	#define G(x, y, z) (((x) & (y)) \| (~(x) & (z)))
93	#define H(x, y, z) (((x) \| ~(y)) ^ (z))
94	#define I(x, y, z) (((x) & (z)) \| ((y) & ~(z)))
95	#define J(x, y, z) ((x) ^ ((y) \| ~(z)))
96
97	#define T(v, w, x, y, z, i, r, f, k) do { \
98	uint32 _t = v + f(w, x, y) + buf[i] + k; \
99	v = ROL32(_t, r) + z; x = ROL32(x, 10); \
100	} while (0)
101
102	#define F1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, F, 0x00000000)
103	#define G1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, G, 0x5a827999)
104	#define H1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, H, 0x6ed9eba1)
105	#define I1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, I, 0x8f1bbcdc)
106	#define J1(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, J, 0xa953fd4e)
107
108	#define F2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, J, 0x50a28be6)
109	#define G2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, I, 0x5c4dd124)
110	#define H2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, H, 0x6d703ef3)
111	#define I2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, G, 0x7a6d76e9)
112	#define J2(v, w, x, y, z, i, r) T(v, w, x, y, z, i, r, F, 0x00000000)
113
114	/* --- We must do both lines together --- */
115
116	F1(a, b, c, d, e, 0, 11);
117	F1(e, a, b, c, d, 1, 14);
118	F1(d, e, a, b, c, 2, 15);
119	F1(c, d, e, a, b, 3, 12);
120	F1(b, c, d, e, a, 4, 5);
121	F1(a, b, c, d, e, 5, 8);
122	F1(e, a, b, c, d, 6, 7);
123	F1(d, e, a, b, c, 7, 9);
124	F1(c, d, e, a, b, 8, 11);
125	F1(b, c, d, e, a, 9, 13);
126	F1(a, b, c, d, e, 10, 14);
127	F1(e, a, b, c, d, 11, 15);
128	F1(d, e, a, b, c, 12, 6);
129	F1(c, d, e, a, b, 13, 7);
130	F1(b, c, d, e, a, 14, 9);
131	F1(a, b, c, d, e, 15, 8);
132
133	F2(A, B, C, D, E, 5, 8);
134	F2(E, A, B, C, D, 14, 9);
135	F2(D, E, A, B, C, 7, 9);
136	F2(C, D, E, A, B, 0, 11);
137	F2(B, C, D, E, A, 9, 13);
138	F2(A, B, C, D, E, 2, 15);
139	F2(E, A, B, C, D, 11, 15);
140	F2(D, E, A, B, C, 4, 5);
141	F2(C, D, E, A, B, 13, 7);
142	F2(B, C, D, E, A, 6, 7);
143	F2(A, B, C, D, E, 15, 8);
144	F2(E, A, B, C, D, 8, 11);
145	F2(D, E, A, B, C, 1, 14);
146	F2(C, D, E, A, B, 10, 14);
147	F2(B, C, D, E, A, 3, 12);
148	F2(A, B, C, D, E, 12, 6);
149
150	G1(e, A, b, c, d, 7, 7);
151	G1(d, e, A, b, c, 4, 6);
152	G1(c, d, e, A, b, 13, 8);
153	G1(b, c, d, e, A, 1, 13);
154	G1(A, b, c, d, e, 10, 11);
155	G1(e, A, b, c, d, 6, 9);
156	G1(d, e, A, b, c, 15, 7);
157	G1(c, d, e, A, b, 3, 15);
158	G1(b, c, d, e, A, 12, 7);
159	G1(A, b, c, d, e, 0, 12);
160	G1(e, A, b, c, d, 9, 15);
161	G1(d, e, A, b, c, 5, 9);
162	G1(c, d, e, A, b, 2, 11);
163	G1(b, c, d, e, A, 14, 7);
164	G1(A, b, c, d, e, 11, 13);
165	G1(e, A, b, c, d, 8, 12);
166
167	G2(E, a, B, C, D, 6, 9);
168	G2(D, E, a, B, C, 11, 13);
169	G2(C, D, E, a, B, 3, 15);
170	G2(B, C, D, E, a, 7, 7);
171	G2(a, B, C, D, E, 0, 12);
172	G2(E, a, B, C, D, 13, 8);
173	G2(D, E, a, B, C, 5, 9);
174	G2(C, D, E, a, B, 10, 11);
175	G2(B, C, D, E, a, 14, 7);
176	G2(a, B, C, D, E, 15, 7);
177	G2(E, a, B, C, D, 8, 12);
178	G2(D, E, a, B, C, 12, 7);
179	G2(C, D, E, a, B, 4, 6);
180	G2(B, C, D, E, a, 9, 15);
181	G2(a, B, C, D, E, 1, 13);
182	G2(E, a, B, C, D, 2, 11);
183
184	H1(d, e, A, B, c, 3, 11);
185	H1(c, d, e, A, B, 10, 13);
186	H1(B, c, d, e, A, 14, 6);
187	H1(A, B, c, d, e, 4, 7);
188	H1(e, A, B, c, d, 9, 14);
189	H1(d, e, A, B, c, 15, 9);
190	H1(c, d, e, A, B, 8, 13);
191	H1(B, c, d, e, A, 1, 15);
192	H1(A, B, c, d, e, 2, 14);
193	H1(e, A, B, c, d, 7, 8);
194	H1(d, e, A, B, c, 0, 13);
195	H1(c, d, e, A, B, 6, 6);
196	H1(B, c, d, e, A, 13, 5);
197	H1(A, B, c, d, e, 11, 12);
198	H1(e, A, B, c, d, 5, 7);
199	H1(d, e, A, B, c, 12, 5);
200
201	H2(D, E, a, b, C, 15, 9);
202	H2(C, D, E, a, b, 5, 7);
203	H2(b, C, D, E, a, 1, 15);
204	H2(a, b, C, D, E, 3, 11);
205	H2(E, a, b, C, D, 7, 8);
206	H2(D, E, a, b, C, 14, 6);
207	H2(C, D, E, a, b, 6, 6);
208	H2(b, C, D, E, a, 9, 14);
209	H2(a, b, C, D, E, 11, 12);
210	H2(E, a, b, C, D, 8, 13);
211	H2(D, E, a, b, C, 12, 5);
212	H2(C, D, E, a, b, 2, 14);
213	H2(b, C, D, E, a, 10, 13);
214	H2(a, b, C, D, E, 0, 13);
215	H2(E, a, b, C, D, 4, 7);
216	H2(D, E, a, b, C, 13, 5);
217
218	I1(C, d, e, A, B, 1, 11);
219	I1(B, C, d, e, A, 9, 12);
220	I1(A, B, C, d, e, 11, 14);
221	I1(e, A, B, C, d, 10, 15);
222	I1(d, e, A, B, C, 0, 14);
223	I1(C, d, e, A, B, 8, 15);
224	I1(B, C, d, e, A, 12, 9);
225	I1(A, B, C, d, e, 4, 8);
226	I1(e, A, B, C, d, 13, 9);
227	I1(d, e, A, B, C, 3, 14);
228	I1(C, d, e, A, B, 7, 5);
229	I1(B, C, d, e, A, 15, 6);
230	I1(A, B, C, d, e, 14, 8);
231	I1(e, A, B, C, d, 5, 6);
232	I1(d, e, A, B, C, 6, 5);
233	I1(C, d, e, A, B, 2, 12);
234
235	I2(c, D, E, a, b, 8, 15);
236	I2(b, c, D, E, a, 6, 5);
237	I2(a, b, c, D, E, 4, 8);
238	I2(E, a, b, c, D, 1, 11);
239	I2(D, E, a, b, c, 3, 14);
240	I2(c, D, E, a, b, 11, 14);
241	I2(b, c, D, E, a, 15, 6);
242	I2(a, b, c, D, E, 0, 14);
243	I2(E, a, b, c, D, 5, 6);
244	I2(D, E, a, b, c, 12, 9);
245	I2(c, D, E, a, b, 2, 12);
246	I2(b, c, D, E, a, 13, 9);
247	I2(a, b, c, D, E, 9, 12);
248	I2(E, a, b, c, D, 7, 5);
249	I2(D, E, a, b, c, 10, 15);
250	I2(c, D, E, a, b, 14, 8);
251
252	J1(B, C, D, e, A, 4, 9);
253	J1(A, B, C, D, e, 0, 15);
254	J1(e, A, B, C, D, 5, 5);
255	J1(D, e, A, B, C, 9, 11);
256	J1(C, D, e, A, B, 7, 6);
257	J1(B, C, D, e, A, 12, 8);
258	J1(A, B, C, D, e, 2, 13);
259	J1(e, A, B, C, D, 10, 12);
260	J1(D, e, A, B, C, 14, 5);
261	J1(C, D, e, A, B, 1, 12);
262	J1(B, C, D, e, A, 3, 13);
263	J1(A, B, C, D, e, 8, 14);
264	J1(e, A, B, C, D, 11, 11);
265	J1(D, e, A, B, C, 6, 8);
266	J1(C, D, e, A, B, 15, 5);
267	J1(B, C, D, e, A, 13, 6);
268
269	J2(b, c, d, E, a, 12, 8);
270	J2(a, b, c, d, E, 15, 5);
271	J2(E, a, b, c, d, 10, 12);
272	J2(d, E, a, b, c, 4, 9);
273	J2(c, d, E, a, b, 1, 12);
274	J2(b, c, d, E, a, 5, 5);
275	J2(a, b, c, d, E, 8, 14);
276	J2(E, a, b, c, d, 7, 6);
277	J2(d, E, a, b, c, 6, 8);
278	J2(c, d, E, a, b, 2, 13);
279	J2(b, c, d, E, a, 13, 6);
280	J2(a, b, c, d, E, 14, 5);
281	J2(E, a, b, c, d, 0, 15);
282	J2(d, E, a, b, c, 3, 13);
283	J2(c, d, E, a, b, 9, 11);
284	J2(b, c, d, E, a, 11, 11);
285
286	/* --- Write out the result --- */
287
288	ctx->a += A;
289	ctx->b += B;
290	ctx->c += C;
291	ctx->d += D;
292	ctx->e += E;
293	ctx->A += a;
294	ctx->B += b;
295	ctx->C += c;
296	ctx->D += d;
297	ctx->E += e;
298	}
299
300	/* --- @rmd320_init@ --- *
301	*
302	* Arguments: @rmd320_ctx *ctx@ = pointer to context block to initialize
303	*
304	* Returns: ---
305	*
306	* Use: Initializes a context block ready for hashing.
307	*/
308
309	void rmd320_init(rmd320_ctx *ctx)
310	{
311	ctx->a = 0x67452301;
312	ctx->b = 0xefcdab89;
313	ctx->c = 0x98badcfe;
314	ctx->d = 0x10325476;
315	ctx->e = 0xc3d2e1f0;
316	ctx->A = 0x76543210;
317	ctx->B = 0xfedcba98;
318	ctx->C = 0x89abcdef;
319	ctx->D = 0x01234567;
320	ctx->E = 0x3c2d1e0f;
321	ctx->off = 0;
322	ctx->nl = ctx->nh = 0;
323	}
324
325	/* --- @rmd320_set@ --- *
326	*
327	* Arguments: @rmd320_ctx *ctx@ = pointer to context block
328	* @const void *buf@ = pointer to state buffer
329	* @unsigned long count@ = current count of bytes processed
330	*
331	* Returns: ---
332	*
333	* Use: Initializes a context block from a given state. This is
334	* useful in cases where the initial hash state is meant to be
335	* secret, e.g., for NMAC and HMAC support.
336	*/
337
338	void rmd320_set(rmd320_ctx ctx, const void buf, unsigned long count)
339	{
340	const octet *p = buf;
341	ctx->a = LOAD32_L(p + 0);
342	ctx->b = LOAD32_L(p + 4);
343	ctx->c = LOAD32_L(p + 8);
344	ctx->d = LOAD32_L(p + 12);
345	ctx->e = LOAD32_L(p + 16);
346	ctx->A = LOAD32_L(p + 20);
347	ctx->B = LOAD32_L(p + 24);
348	ctx->C = LOAD32_L(p + 28);
349	ctx->D = LOAD32_L(p + 32);
350	ctx->E = LOAD32_L(p + 36);
351	ctx->off = 0;
352	ctx->nl = U32(count);
353	ctx->nh = U32(((count & ~MASK32) >> 16) >> 16);
354	}
355
356	/* --- @rmd320_hash@ --- *
357	*
358	* Arguments: @rmd320_ctx *ctx@ = pointer to context block
359	* @const void *buf@ = buffer of data to hash
360	* @size_t sz@ = size of buffer to hash
361	*
362	* Returns: ---
363	*
364	* Use: Hashes a buffer of data. The buffer may be of any size and
365	* alignment.
366	*/
367
368	void rmd320_hash(rmd320_ctx ctx, const void buf, size_t sz)
369	{
370	HASH_BUFFER(RMD320, rmd320, ctx, buf, sz);
371	}
372
373	/* --- @rmd320_done@ --- *
374	*
375	* Arguments: @rmd320_ctx *ctx@ = pointer to context block
376	* @void *hash@ = pointer to output buffer
377	*
378	* Returns: ---
379	*
380	* Use: Returns the hash of the data read so far.
381	*/
382
383	void rmd320_done(rmd320_ctx ctx, void hash)
384	{
385	octet *p = hash;
386	HASH_MD5STRENGTH(RMD320, rmd320, ctx);
387	STORE32_L(p + 0, ctx->a);
388	STORE32_L(p + 4, ctx->b);
389	STORE32_L(p + 8, ctx->c);
390	STORE32_L(p + 12, ctx->d);
391	STORE32_L(p + 16, ctx->e);
392	STORE32_L(p + 20, ctx->A);
393	STORE32_L(p + 24, ctx->B);
394	STORE32_L(p + 28, ctx->C);
395	STORE32_L(p + 32, ctx->D);
396	STORE32_L(p + 36, ctx->E);
397	}
398
399	/* --- @rmd320_state@ --- *
400	*
401	* Arguments: @rmd320_ctx *ctx@ = pointer to context
402	* @void *state@ = pointer to buffer for current state
403	*
404	* Returns: Number of bytes written to the hash function so far.
405	*
406	* Use: Returns the current state of the hash function such that
407	* it can be passed to @rmd320_set@.
408	*/
409
410	unsigned long rmd320_state(rmd320_ctx ctx, void state)
411	{
412	octet *p = state;
413	STORE32_L(p + 0, ctx->a);
414	STORE32_L(p + 4, ctx->b);
415	STORE32_L(p + 8, ctx->c);
416	STORE32_L(p + 12, ctx->d);
417	STORE32_L(p + 16, ctx->e);
418	STORE32_L(p + 20, ctx->A);
419	STORE32_L(p + 24, ctx->B);
420	STORE32_L(p + 28, ctx->C);
421	STORE32_L(p + 32, ctx->D);
422	STORE32_L(p + 36, ctx->E);
423	return (ctx->nl \| ((ctx->nh << 16) << 16));
424	}
425
426	/* --- Generic interface --- */
427
428	GHASH_DEF(RMD320, rmd320)
429
430	/* --- Test code --- */
431
432	HASH_TEST(RMD320, rmd320)
433
434	/----- That's all, folks -------------------------------------------------/