2001-07-13 16:06:14 -04:00
|
|
|
/* $NetBSD: rmd160.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $ */
|
|
|
|
/* $RoughId: rmd160.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */
|
|
|
|
/* $Id$ */
|
|
|
|
|
|
|
|
/********************************************************************\
|
|
|
|
*
|
|
|
|
* FILE: rmd160.c
|
|
|
|
*
|
|
|
|
* CONTENTS: A sample C-implementation of the RIPEMD-160
|
|
|
|
* hash-function.
|
|
|
|
* TARGET: any computer with an ANSI C compiler
|
|
|
|
*
|
|
|
|
* AUTHOR: Antoon Bosselaers, ESAT-COSIC
|
|
|
|
* (Arranged for libc by Todd C. Miller)
|
|
|
|
* DATE: 1 March 1996
|
|
|
|
* VERSION: 1.0
|
|
|
|
*
|
|
|
|
* Copyright (c) Katholieke Universiteit Leuven
|
|
|
|
* 1996, All Rights Reserved
|
|
|
|
*
|
|
|
|
\********************************************************************/
|
|
|
|
|
|
|
|
#include "rmd160.h"
|
|
|
|
|
|
|
|
#ifndef lint
|
|
|
|
/* __RCSID("$NetBSD: rmd160.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $"); */
|
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
/* header files */
|
|
|
|
|
|
|
|
#ifdef HAVE_SYS_ENDIAN_H_
|
|
|
|
#include <sys/endian.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef HAVE_MACHINE_ENDIAN_H_
|
|
|
|
#include <machine/endian.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* #include "namespace.h" */
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#ifndef _DIAGASSERT
|
|
|
|
#define _DIAGASSERT(cond) assert(cond)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/********************************************************************/
|
|
|
|
|
|
|
|
/* macro definitions */
|
|
|
|
|
|
|
|
/* collect four bytes into one word: */
|
|
|
|
#define BYTES_TO_DWORD(strptr) \
|
|
|
|
(((uint32_t) *((strptr)+3) << 24) | \
|
|
|
|
((uint32_t) *((strptr)+2) << 16) | \
|
|
|
|
((uint32_t) *((strptr)+1) << 8) | \
|
|
|
|
((uint32_t) *(strptr)))
|
|
|
|
|
|
|
|
/* ROL(x, n) cyclically rotates x over n bits to the left */
|
|
|
|
/* x must be of an unsigned 32 bits type and 0 <= n < 32. */
|
|
|
|
#define ROL(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
|
|
|
|
|
|
|
/* the three basic functions F(), G() and H() */
|
|
|
|
#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)))
|
|
|
|
|
|
|
|
/* the eight basic operations FF() through III() */
|
|
|
|
#define FF(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += F((b), (c), (d)) + (x); \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define GG(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += G((b), (c), (d)) + (x) + 0x5a827999U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define HH(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += H((b), (c), (d)) + (x) + 0x6ed9eba1U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define II(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcU; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define JJ(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += J((b), (c), (d)) + (x) + 0xa953fd4eU; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define FFF(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += F((b), (c), (d)) + (x); \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define GGG(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += G((b), (c), (d)) + (x) + 0x7a6d76e9U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define HHH(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += H((b), (c), (d)) + (x) + 0x6d703ef3U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define III(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += I((b), (c), (d)) + (x) + 0x5c4dd124U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
#define JJJ(a, b, c, d, e, x, s) { \
|
|
|
|
(a) += J((b), (c), (d)) + (x) + 0x50a28be6U; \
|
|
|
|
(a) = ROL((a), (s)) + (e); \
|
|
|
|
(c) = ROL((c), 10); \
|
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************/
|
|
|
|
|
2014-07-15 10:59:20 -04:00
|
|
|
int
|
2001-07-13 16:06:14 -04:00
|
|
|
RMD160_Init(RMD160_CTX *context)
|
|
|
|
{
|
|
|
|
|
|
|
|
_DIAGASSERT(context != NULL);
|
|
|
|
|
|
|
|
/* ripemd-160 initialization constants */
|
|
|
|
context->state[0] = 0x67452301U;
|
|
|
|
context->state[1] = 0xefcdab89U;
|
|
|
|
context->state[2] = 0x98badcfeU;
|
|
|
|
context->state[3] = 0x10325476U;
|
|
|
|
context->state[4] = 0xc3d2e1f0U;
|
|
|
|
context->length[0] = context->length[1] = 0;
|
|
|
|
context->buflen = 0;
|
2014-07-15 10:59:20 -04:00
|
|
|
return 1;
|
2001-07-13 16:06:14 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************/
|
|
|
|
|
|
|
|
void
|
|
|
|
RMD160_Transform(uint32_t state[5], const uint32_t block[16])
|
|
|
|
{
|
|
|
|
uint32_t aa, bb, cc, dd, ee;
|
|
|
|
uint32_t aaa, bbb, ccc, ddd, eee;
|
|
|
|
|
|
|
|
_DIAGASSERT(state != NULL);
|
|
|
|
_DIAGASSERT(block != NULL);
|
|
|
|
|
|
|
|
aa = aaa = state[0];
|
|
|
|
bb = bbb = state[1];
|
|
|
|
cc = ccc = state[2];
|
|
|
|
dd = ddd = state[3];
|
|
|
|
ee = eee = state[4];
|
|
|
|
|
|
|
|
/* round 1 */
|
|
|
|
FF(aa, bb, cc, dd, ee, block[ 0], 11);
|
|
|
|
FF(ee, aa, bb, cc, dd, block[ 1], 14);
|
|
|
|
FF(dd, ee, aa, bb, cc, block[ 2], 15);
|
|
|
|
FF(cc, dd, ee, aa, bb, block[ 3], 12);
|
|
|
|
FF(bb, cc, dd, ee, aa, block[ 4], 5);
|
|
|
|
FF(aa, bb, cc, dd, ee, block[ 5], 8);
|
|
|
|
FF(ee, aa, bb, cc, dd, block[ 6], 7);
|
|
|
|
FF(dd, ee, aa, bb, cc, block[ 7], 9);
|
|
|
|
FF(cc, dd, ee, aa, bb, block[ 8], 11);
|
|
|
|
FF(bb, cc, dd, ee, aa, block[ 9], 13);
|
|
|
|
FF(aa, bb, cc, dd, ee, block[10], 14);
|
|
|
|
FF(ee, aa, bb, cc, dd, block[11], 15);
|
|
|
|
FF(dd, ee, aa, bb, cc, block[12], 6);
|
|
|
|
FF(cc, dd, ee, aa, bb, block[13], 7);
|
|
|
|
FF(bb, cc, dd, ee, aa, block[14], 9);
|
|
|
|
FF(aa, bb, cc, dd, ee, block[15], 8);
|
|
|
|
|
|
|
|
/* round 2 */
|
|
|
|
GG(ee, aa, bb, cc, dd, block[ 7], 7);
|
|
|
|
GG(dd, ee, aa, bb, cc, block[ 4], 6);
|
|
|
|
GG(cc, dd, ee, aa, bb, block[13], 8);
|
|
|
|
GG(bb, cc, dd, ee, aa, block[ 1], 13);
|
|
|
|
GG(aa, bb, cc, dd, ee, block[10], 11);
|
|
|
|
GG(ee, aa, bb, cc, dd, block[ 6], 9);
|
|
|
|
GG(dd, ee, aa, bb, cc, block[15], 7);
|
|
|
|
GG(cc, dd, ee, aa, bb, block[ 3], 15);
|
|
|
|
GG(bb, cc, dd, ee, aa, block[12], 7);
|
|
|
|
GG(aa, bb, cc, dd, ee, block[ 0], 12);
|
|
|
|
GG(ee, aa, bb, cc, dd, block[ 9], 15);
|
|
|
|
GG(dd, ee, aa, bb, cc, block[ 5], 9);
|
|
|
|
GG(cc, dd, ee, aa, bb, block[ 2], 11);
|
|
|
|
GG(bb, cc, dd, ee, aa, block[14], 7);
|
|
|
|
GG(aa, bb, cc, dd, ee, block[11], 13);
|
|
|
|
GG(ee, aa, bb, cc, dd, block[ 8], 12);
|
|
|
|
|
|
|
|
/* round 3 */
|
|
|
|
HH(dd, ee, aa, bb, cc, block[ 3], 11);
|
|
|
|
HH(cc, dd, ee, aa, bb, block[10], 13);
|
|
|
|
HH(bb, cc, dd, ee, aa, block[14], 6);
|
|
|
|
HH(aa, bb, cc, dd, ee, block[ 4], 7);
|
|
|
|
HH(ee, aa, bb, cc, dd, block[ 9], 14);
|
|
|
|
HH(dd, ee, aa, bb, cc, block[15], 9);
|
|
|
|
HH(cc, dd, ee, aa, bb, block[ 8], 13);
|
|
|
|
HH(bb, cc, dd, ee, aa, block[ 1], 15);
|
|
|
|
HH(aa, bb, cc, dd, ee, block[ 2], 14);
|
|
|
|
HH(ee, aa, bb, cc, dd, block[ 7], 8);
|
|
|
|
HH(dd, ee, aa, bb, cc, block[ 0], 13);
|
|
|
|
HH(cc, dd, ee, aa, bb, block[ 6], 6);
|
|
|
|
HH(bb, cc, dd, ee, aa, block[13], 5);
|
|
|
|
HH(aa, bb, cc, dd, ee, block[11], 12);
|
|
|
|
HH(ee, aa, bb, cc, dd, block[ 5], 7);
|
|
|
|
HH(dd, ee, aa, bb, cc, block[12], 5);
|
|
|
|
|
|
|
|
/* round 4 */
|
|
|
|
II(cc, dd, ee, aa, bb, block[ 1], 11);
|
|
|
|
II(bb, cc, dd, ee, aa, block[ 9], 12);
|
|
|
|
II(aa, bb, cc, dd, ee, block[11], 14);
|
|
|
|
II(ee, aa, bb, cc, dd, block[10], 15);
|
|
|
|
II(dd, ee, aa, bb, cc, block[ 0], 14);
|
|
|
|
II(cc, dd, ee, aa, bb, block[ 8], 15);
|
|
|
|
II(bb, cc, dd, ee, aa, block[12], 9);
|
|
|
|
II(aa, bb, cc, dd, ee, block[ 4], 8);
|
|
|
|
II(ee, aa, bb, cc, dd, block[13], 9);
|
|
|
|
II(dd, ee, aa, bb, cc, block[ 3], 14);
|
|
|
|
II(cc, dd, ee, aa, bb, block[ 7], 5);
|
|
|
|
II(bb, cc, dd, ee, aa, block[15], 6);
|
|
|
|
II(aa, bb, cc, dd, ee, block[14], 8);
|
|
|
|
II(ee, aa, bb, cc, dd, block[ 5], 6);
|
|
|
|
II(dd, ee, aa, bb, cc, block[ 6], 5);
|
|
|
|
II(cc, dd, ee, aa, bb, block[ 2], 12);
|
|
|
|
|
|
|
|
/* round 5 */
|
|
|
|
JJ(bb, cc, dd, ee, aa, block[ 4], 9);
|
|
|
|
JJ(aa, bb, cc, dd, ee, block[ 0], 15);
|
|
|
|
JJ(ee, aa, bb, cc, dd, block[ 5], 5);
|
|
|
|
JJ(dd, ee, aa, bb, cc, block[ 9], 11);
|
|
|
|
JJ(cc, dd, ee, aa, bb, block[ 7], 6);
|
|
|
|
JJ(bb, cc, dd, ee, aa, block[12], 8);
|
|
|
|
JJ(aa, bb, cc, dd, ee, block[ 2], 13);
|
|
|
|
JJ(ee, aa, bb, cc, dd, block[10], 12);
|
|
|
|
JJ(dd, ee, aa, bb, cc, block[14], 5);
|
|
|
|
JJ(cc, dd, ee, aa, bb, block[ 1], 12);
|
|
|
|
JJ(bb, cc, dd, ee, aa, block[ 3], 13);
|
|
|
|
JJ(aa, bb, cc, dd, ee, block[ 8], 14);
|
|
|
|
JJ(ee, aa, bb, cc, dd, block[11], 11);
|
|
|
|
JJ(dd, ee, aa, bb, cc, block[ 6], 8);
|
|
|
|
JJ(cc, dd, ee, aa, bb, block[15], 5);
|
|
|
|
JJ(bb, cc, dd, ee, aa, block[13], 6);
|
|
|
|
|
|
|
|
/* parallel round 1 */
|
|
|
|
JJJ(aaa, bbb, ccc, ddd, eee, block[ 5], 8);
|
|
|
|
JJJ(eee, aaa, bbb, ccc, ddd, block[14], 9);
|
|
|
|
JJJ(ddd, eee, aaa, bbb, ccc, block[ 7], 9);
|
|
|
|
JJJ(ccc, ddd, eee, aaa, bbb, block[ 0], 11);
|
|
|
|
JJJ(bbb, ccc, ddd, eee, aaa, block[ 9], 13);
|
|
|
|
JJJ(aaa, bbb, ccc, ddd, eee, block[ 2], 15);
|
|
|
|
JJJ(eee, aaa, bbb, ccc, ddd, block[11], 15);
|
|
|
|
JJJ(ddd, eee, aaa, bbb, ccc, block[ 4], 5);
|
|
|
|
JJJ(ccc, ddd, eee, aaa, bbb, block[13], 7);
|
|
|
|
JJJ(bbb, ccc, ddd, eee, aaa, block[ 6], 7);
|
|
|
|
JJJ(aaa, bbb, ccc, ddd, eee, block[15], 8);
|
|
|
|
JJJ(eee, aaa, bbb, ccc, ddd, block[ 8], 11);
|
|
|
|
JJJ(ddd, eee, aaa, bbb, ccc, block[ 1], 14);
|
|
|
|
JJJ(ccc, ddd, eee, aaa, bbb, block[10], 14);
|
|
|
|
JJJ(bbb, ccc, ddd, eee, aaa, block[ 3], 12);
|
|
|
|
JJJ(aaa, bbb, ccc, ddd, eee, block[12], 6);
|
|
|
|
|
|
|
|
/* parallel round 2 */
|
|
|
|
III(eee, aaa, bbb, ccc, ddd, block[ 6], 9);
|
|
|
|
III(ddd, eee, aaa, bbb, ccc, block[11], 13);
|
|
|
|
III(ccc, ddd, eee, aaa, bbb, block[ 3], 15);
|
|
|
|
III(bbb, ccc, ddd, eee, aaa, block[ 7], 7);
|
|
|
|
III(aaa, bbb, ccc, ddd, eee, block[ 0], 12);
|
|
|
|
III(eee, aaa, bbb, ccc, ddd, block[13], 8);
|
|
|
|
III(ddd, eee, aaa, bbb, ccc, block[ 5], 9);
|
|
|
|
III(ccc, ddd, eee, aaa, bbb, block[10], 11);
|
|
|
|
III(bbb, ccc, ddd, eee, aaa, block[14], 7);
|
|
|
|
III(aaa, bbb, ccc, ddd, eee, block[15], 7);
|
|
|
|
III(eee, aaa, bbb, ccc, ddd, block[ 8], 12);
|
|
|
|
III(ddd, eee, aaa, bbb, ccc, block[12], 7);
|
|
|
|
III(ccc, ddd, eee, aaa, bbb, block[ 4], 6);
|
|
|
|
III(bbb, ccc, ddd, eee, aaa, block[ 9], 15);
|
|
|
|
III(aaa, bbb, ccc, ddd, eee, block[ 1], 13);
|
|
|
|
III(eee, aaa, bbb, ccc, ddd, block[ 2], 11);
|
|
|
|
|
|
|
|
/* parallel round 3 */
|
|
|
|
HHH(ddd, eee, aaa, bbb, ccc, block[15], 9);
|
|
|
|
HHH(ccc, ddd, eee, aaa, bbb, block[ 5], 7);
|
|
|
|
HHH(bbb, ccc, ddd, eee, aaa, block[ 1], 15);
|
|
|
|
HHH(aaa, bbb, ccc, ddd, eee, block[ 3], 11);
|
|
|
|
HHH(eee, aaa, bbb, ccc, ddd, block[ 7], 8);
|
|
|
|
HHH(ddd, eee, aaa, bbb, ccc, block[14], 6);
|
|
|
|
HHH(ccc, ddd, eee, aaa, bbb, block[ 6], 6);
|
|
|
|
HHH(bbb, ccc, ddd, eee, aaa, block[ 9], 14);
|
|
|
|
HHH(aaa, bbb, ccc, ddd, eee, block[11], 12);
|
|
|
|
HHH(eee, aaa, bbb, ccc, ddd, block[ 8], 13);
|
|
|
|
HHH(ddd, eee, aaa, bbb, ccc, block[12], 5);
|
|
|
|
HHH(ccc, ddd, eee, aaa, bbb, block[ 2], 14);
|
|
|
|
HHH(bbb, ccc, ddd, eee, aaa, block[10], 13);
|
|
|
|
HHH(aaa, bbb, ccc, ddd, eee, block[ 0], 13);
|
|
|
|
HHH(eee, aaa, bbb, ccc, ddd, block[ 4], 7);
|
|
|
|
HHH(ddd, eee, aaa, bbb, ccc, block[13], 5);
|
|
|
|
|
|
|
|
/* parallel round 4 */
|
|
|
|
GGG(ccc, ddd, eee, aaa, bbb, block[ 8], 15);
|
|
|
|
GGG(bbb, ccc, ddd, eee, aaa, block[ 6], 5);
|
|
|
|
GGG(aaa, bbb, ccc, ddd, eee, block[ 4], 8);
|
|
|
|
GGG(eee, aaa, bbb, ccc, ddd, block[ 1], 11);
|
|
|
|
GGG(ddd, eee, aaa, bbb, ccc, block[ 3], 14);
|
|
|
|
GGG(ccc, ddd, eee, aaa, bbb, block[11], 14);
|
|
|
|
GGG(bbb, ccc, ddd, eee, aaa, block[15], 6);
|
|
|
|
GGG(aaa, bbb, ccc, ddd, eee, block[ 0], 14);
|
|
|
|
GGG(eee, aaa, bbb, ccc, ddd, block[ 5], 6);
|
|
|
|
GGG(ddd, eee, aaa, bbb, ccc, block[12], 9);
|
|
|
|
GGG(ccc, ddd, eee, aaa, bbb, block[ 2], 12);
|
|
|
|
GGG(bbb, ccc, ddd, eee, aaa, block[13], 9);
|
|
|
|
GGG(aaa, bbb, ccc, ddd, eee, block[ 9], 12);
|
|
|
|
GGG(eee, aaa, bbb, ccc, ddd, block[ 7], 5);
|
|
|
|
GGG(ddd, eee, aaa, bbb, ccc, block[10], 15);
|
|
|
|
GGG(ccc, ddd, eee, aaa, bbb, block[14], 8);
|
|
|
|
|
|
|
|
/* parallel round 5 */
|
|
|
|
FFF(bbb, ccc, ddd, eee, aaa, block[12] , 8);
|
|
|
|
FFF(aaa, bbb, ccc, ddd, eee, block[15] , 5);
|
|
|
|
FFF(eee, aaa, bbb, ccc, ddd, block[10] , 12);
|
|
|
|
FFF(ddd, eee, aaa, bbb, ccc, block[ 4] , 9);
|
|
|
|
FFF(ccc, ddd, eee, aaa, bbb, block[ 1] , 12);
|
|
|
|
FFF(bbb, ccc, ddd, eee, aaa, block[ 5] , 5);
|
|
|
|
FFF(aaa, bbb, ccc, ddd, eee, block[ 8] , 14);
|
|
|
|
FFF(eee, aaa, bbb, ccc, ddd, block[ 7] , 6);
|
|
|
|
FFF(ddd, eee, aaa, bbb, ccc, block[ 6] , 8);
|
|
|
|
FFF(ccc, ddd, eee, aaa, bbb, block[ 2] , 13);
|
|
|
|
FFF(bbb, ccc, ddd, eee, aaa, block[13] , 6);
|
|
|
|
FFF(aaa, bbb, ccc, ddd, eee, block[14] , 5);
|
|
|
|
FFF(eee, aaa, bbb, ccc, ddd, block[ 0] , 15);
|
|
|
|
FFF(ddd, eee, aaa, bbb, ccc, block[ 3] , 13);
|
|
|
|
FFF(ccc, ddd, eee, aaa, bbb, block[ 9] , 11);
|
|
|
|
FFF(bbb, ccc, ddd, eee, aaa, block[11] , 11);
|
|
|
|
|
|
|
|
/* combine results */
|
|
|
|
ddd += cc + state[1]; /* final result for state[0] */
|
|
|
|
state[1] = state[2] + dd + eee;
|
|
|
|
state[2] = state[3] + ee + aaa;
|
|
|
|
state[3] = state[4] + aa + bbb;
|
|
|
|
state[4] = state[0] + bb + ccc;
|
|
|
|
state[0] = ddd;
|
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************/
|
|
|
|
|
|
|
|
void
|
|
|
|
RMD160_Update(RMD160_CTX *context, const uint8_t *data, size_t nbytes)
|
|
|
|
{
|
|
|
|
uint32_t X[16];
|
|
|
|
uint32_t ofs = 0;
|
|
|
|
uint32_t i;
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
|
|
uint32_t j;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
_DIAGASSERT(context != NULL);
|
|
|
|
_DIAGASSERT(data != NULL);
|
|
|
|
|
|
|
|
/* update length[] */
|
2012-05-06 21:27:59 -04:00
|
|
|
#if SIZEOF_SIZE_T * CHAR_BIT > 32
|
|
|
|
context->length[1] += (uint32_t)((context->length[0] + nbytes) >> 32);
|
|
|
|
#else
|
2001-07-13 16:06:14 -04:00
|
|
|
if (context->length[0] + nbytes < context->length[0])
|
|
|
|
context->length[1]++; /* overflow to msb of length */
|
2012-05-06 21:27:59 -04:00
|
|
|
#endif
|
|
|
|
context->length[0] += (uint32_t)nbytes;
|
2001-07-13 16:06:14 -04:00
|
|
|
|
|
|
|
(void)memset(X, 0, sizeof(X));
|
|
|
|
|
|
|
|
if ( context->buflen + nbytes < 64 )
|
|
|
|
{
|
|
|
|
(void)memcpy(context->bbuffer + context->buflen, data, nbytes);
|
2012-05-06 21:27:59 -04:00
|
|
|
context->buflen += (uint32_t)nbytes;
|
2001-07-13 16:06:14 -04:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* process first block */
|
|
|
|
ofs = 64 - context->buflen;
|
|
|
|
(void)memcpy(context->bbuffer + context->buflen, data, ofs);
|
|
|
|
#ifndef WORDS_BIGENDIAN
|
|
|
|
(void)memcpy(X, context->bbuffer, sizeof(X));
|
|
|
|
#else
|
|
|
|
for (j=0; j < 16; j++)
|
|
|
|
X[j] = BYTES_TO_DWORD(context->bbuffer + (4 * j));
|
|
|
|
#endif
|
|
|
|
RMD160_Transform(context->state, X);
|
|
|
|
nbytes -= ofs;
|
|
|
|
|
|
|
|
/* process remaining complete blocks */
|
|
|
|
for (i = 0; i < (nbytes >> 6); i++) {
|
|
|
|
#ifndef WORDS_BIGENDIAN
|
|
|
|
(void)memcpy(X, data + (64 * i) + ofs, sizeof(X));
|
|
|
|
#else
|
|
|
|
for (j=0; j < 16; j++)
|
|
|
|
X[j] = BYTES_TO_DWORD(data + (64 * i) + (4 * j) + ofs);
|
|
|
|
#endif
|
|
|
|
RMD160_Transform(context->state, X);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put last bytes from data into context's buffer
|
|
|
|
*/
|
2012-05-06 21:27:59 -04:00
|
|
|
context->buflen = (uint32_t)nbytes & 63;
|
2001-07-13 16:06:14 -04:00
|
|
|
memcpy(context->bbuffer, data + (64 * i) + ofs, context->buflen);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************/
|
|
|
|
|
2014-07-15 10:59:20 -04:00
|
|
|
int
|
* ext/digest/digest.[ch]: Since the argument order of
hash_final_func_t was inconsistent with others, change it and
rename to hash_finish_func_t to avoid confusion.
* ext/digest/digest.[ch]: Remove and eliminate the use of
hash_end_func_t. Implement hexdigest conversion in the base
class.
* ext/digest/md5/md5.c, ext/digest/md5/md5.h,
ext/digest/md5/md5init.c, ext/digest/md5/md5ossl.c,
ext/digest/md5/md5ossl.h: Remove MD5_End() and change
MD5_Final() to MD5_Finish().
* ext/digest/rmd160/depend, ext/digest/rmd160/extconf.rb,
ext/digest/rmd160/rmd160.c, ext/digest/rmd160/rmd160.h,
ext/digest/rmd160/rmd160hl.c, ext/digest/rmd160/rmd160init.c,
ext/digest/rmd160/rmd160ossl.c, ext/digest/rmd160/rmd160ossl.h:
Remove unused functions RMD160_End(), RMD160_File(),
RMD160_Data() and change RMD160_Final() to RMD160_Finish().
* ext/digest/sha1/extconf.rb, ext/digest/sha1/sha1.c,
ext/digest/sha1/sha1.h, ext/digest/sha1/sha1hl.c,
ext/digest/sha1/sha1init.c, ext/digest/sha1/sha1ossl.c,
ext/digest/sha1/sha1ossl.h: Likewise.
* ext/digest/sha2/extconf.rb, ext/digest/sha2/sha2.c,
ext/digest/sha2/sha2.h, ext/digest/sha2/sha2hl.c,
ext/digest/sha2/sha2init.c: Likewise.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@11086 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2006-10-05 07:09:42 -04:00
|
|
|
RMD160_Finish(RMD160_CTX *context, uint8_t digest[20])
|
2001-07-13 16:06:14 -04:00
|
|
|
{
|
|
|
|
uint32_t i;
|
|
|
|
uint32_t X[16];
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
|
|
uint32_t j;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
_DIAGASSERT(digest != NULL);
|
|
|
|
_DIAGASSERT(context != NULL);
|
|
|
|
|
|
|
|
/* append the bit m_n == 1 */
|
|
|
|
context->bbuffer[context->buflen] = (uint8_t)'\200';
|
|
|
|
|
|
|
|
(void)memset(context->bbuffer + context->buflen + 1, 0,
|
|
|
|
63 - context->buflen);
|
|
|
|
#ifndef WORDS_BIGENDIAN
|
|
|
|
(void)memcpy(X, context->bbuffer, sizeof(X));
|
|
|
|
#else
|
|
|
|
for (j=0; j < 16; j++)
|
|
|
|
X[j] = BYTES_TO_DWORD(context->bbuffer + (4 * j));
|
|
|
|
#endif
|
|
|
|
if ((context->buflen) > 55) {
|
|
|
|
/* length goes to next block */
|
|
|
|
RMD160_Transform(context->state, X);
|
|
|
|
(void)memset(X, 0, sizeof(X));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* append length in bits */
|
|
|
|
X[14] = context->length[0] << 3;
|
|
|
|
X[15] = (context->length[0] >> 29) |
|
|
|
|
(context->length[1] << 3);
|
|
|
|
RMD160_Transform(context->state, X);
|
|
|
|
|
|
|
|
if (digest != NULL) {
|
|
|
|
for (i = 0; i < 20; i += 4) {
|
|
|
|
/* extracts the 8 least significant bits. */
|
|
|
|
digest[i] = context->state[i>>2];
|
|
|
|
digest[i + 1] = (context->state[i>>2] >> 8);
|
|
|
|
digest[i + 2] = (context->state[i>>2] >> 16);
|
|
|
|
digest[i + 3] = (context->state[i>>2] >> 24);
|
|
|
|
}
|
|
|
|
}
|
2014-07-15 10:59:20 -04:00
|
|
|
return 1;
|
2001-07-13 16:06:14 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/************************ end of file rmd160.c **********************/
|