1
/* rmd160.c - RIPE-MD160
2
* Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
4
* This file is part of GnuPG.
6
* GnuPG is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* GnuPG is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License
17
* along with this program; if not, write to the Free Software
18
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
29
#include "cipher.h" /* for rmd160_hash_buffer */
30
#include "algorithms.h"
34
/*********************************
35
* RIPEMD-160 is not patented, see (as of 25.10.97)
36
* http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html
37
* Note that the code uses Little Endian byteorder, which is good for
38
* 386 etc, but we must add some conversion when used on a big endian box.
41
* Pseudo-code for RIPEMD-160
43
* RIPEMD-160 is an iterative hash function that operates on 32-bit words.
44
* The round function takes as input a 5-word chaining variable and a 16-word
45
* message block and maps this to a new chaining variable. All operations are
46
* defined on 32-bit words. Padding is identical to that of MD4.
49
* RIPEMD-160: definitions
52
* nonlinear functions at bit level: exor, mux, -, mux, -
54
* f(j, x, y, z) = x XOR y XOR z (0 <= j <= 15)
55
* f(j, x, y, z) = (x AND y) OR (NOT(x) AND z) (16 <= j <= 31)
56
* f(j, x, y, z) = (x OR NOT(y)) XOR z (32 <= j <= 47)
57
* f(j, x, y, z) = (x AND z) OR (y AND NOT(z)) (48 <= j <= 63)
58
* f(j, x, y, z) = x XOR (y OR NOT(z)) (64 <= j <= 79)
61
* added constants (hexadecimal)
63
* K(j) = 0x00000000 (0 <= j <= 15)
64
* K(j) = 0x5A827999 (16 <= j <= 31) int(2**30 x sqrt(2))
65
* K(j) = 0x6ED9EBA1 (32 <= j <= 47) int(2**30 x sqrt(3))
66
* K(j) = 0x8F1BBCDC (48 <= j <= 63) int(2**30 x sqrt(5))
67
* K(j) = 0xA953FD4E (64 <= j <= 79) int(2**30 x sqrt(7))
68
* K'(j) = 0x50A28BE6 (0 <= j <= 15) int(2**30 x cbrt(2))
69
* K'(j) = 0x5C4DD124 (16 <= j <= 31) int(2**30 x cbrt(3))
70
* K'(j) = 0x6D703EF3 (32 <= j <= 47) int(2**30 x cbrt(5))
71
* K'(j) = 0x7A6D76E9 (48 <= j <= 63) int(2**30 x cbrt(7))
72
* K'(j) = 0x00000000 (64 <= j <= 79)
75
* selection of message word
77
* r(j) = j (0 <= j <= 15)
78
* r(16..31) = 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8
79
* r(32..47) = 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12
80
* r(48..63) = 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2
81
* r(64..79) = 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
82
* r0(0..15) = 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12
83
* r0(16..31)= 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2
84
* r0(32..47)= 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13
85
* r0(48..63)= 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14
86
* r0(64..79)= 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
89
* amount for rotate left (rol)
91
* s(0..15) = 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8
92
* s(16..31) = 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12
93
* s(32..47) = 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5
94
* s(48..63) = 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12
95
* s(64..79) = 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
96
* s'(0..15) = 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6
97
* s'(16..31)= 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11
98
* s'(32..47)= 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5
99
* s'(48..63)= 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8
100
* s'(64..79)= 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
103
* initial value (hexadecimal)
105
* h0 = 0x67452301; h1 = 0xEFCDAB89; h2 = 0x98BADCFE; h3 = 0x10325476;
109
* RIPEMD-160: pseudo-code
111
* It is assumed that the message after padding consists of t 16-word blocks
112
* that will be denoted with X[i][j], with 0 <= i <= t-1 and 0 <= j <= 15.
113
* The symbol [+] denotes addition modulo 2**32 and rol_s denotes cyclic left
114
* shift (rotate) over s positions.
117
* for i := 0 to t-1 {
118
* A := h0; B := h1; C := h2; D = h3; E = h4;
119
* A' := h0; B' := h1; C' := h2; D' = h3; E' = h4;
121
* T := rol_s(j)(A [+] f(j, B, C, D) [+] X[i][r(j)] [+] K(j)) [+] E;
122
* A := E; E := D; D := rol_10(C); C := B; B := T;
123
* T := rol_s'(j)(A' [+] f(79-j, B', C', D') [+] X[i][r'(j)]
125
* A' := E'; E' := D'; D' := rol_10(C'); C' := B'; B' := T;
127
* T := h1 [+] C [+] D'; h1 := h2 [+] D [+] E'; h2 := h3 [+] E [+] A';
128
* h3 := h4 [+] A [+] B'; h4 := h0 [+] B [+] C'; h0 := T;
133
* "" 9c1185a5c5e9fc54612808977ee8f548b2258d31
134
* "a" 0bdc9d2d256b3ee9daae347be6f4dc835a467ffe
135
* "abc" 8eb208f7e05d987a9b044a8e98c6b087f15a0bfc
136
* "message digest" 5d0689ef49d2fae572b881b123a85ffa21595f36
137
* "a...z" f71c27109c692c1b56bbdceb5b9d2865b3708dbc
138
* "abcdbcde...nopq" 12a053384a9c0c88e405a06c27dcf49ada62eb2b
139
* "A...Za...z0...9" b0e20b6e3116640286ed3a87a5713079b21f5189
140
* 8 times "1234567890" 9b752e45573d4b39f4dbd3323cab82bf63326bfb
141
* 1 million times "a" 52783243c1697bdbe16d37f97f68f08325dc1528
145
burn_stack (int bytes)
149
memset (buf, 0, sizeof buf);
158
rmd160_init( RMD160_CONTEXT *hd )
172
* Transform the message X which consists of 16 32-bit-words
175
transform( RMD160_CONTEXT *hd, byte *data )
177
u32 a,b,c,d,e,aa,bb,cc,dd,ee,t;
178
#ifdef BIG_ENDIAN_HOST
182
for(i=0, p1=data, p2=(byte*)x; i < 16; i++, p2 += 4 ) {
193
/* this version is better because it is always aligned;
194
* The performance penalty on a 586-100 is about 6% which
195
* is acceptable - because the data is more local it might
196
* also be possible that this is faster on some machines.
197
* This function (when compiled with -02 on gcc 2.7.2)
198
* executes on a 586-100 (39.73 bogomips) at about 1900kb/sec;
199
* [measured with a 4MB data and "gpgm --print-md rmd160"] */
201
memcpy( x, data, 64 );
206
#define K0 0x00000000
207
#define K1 0x5A827999
208
#define K2 0x6ED9EBA1
209
#define K3 0x8F1BBCDC
210
#define K4 0xA953FD4E
211
#define KK0 0x50A28BE6
212
#define KK1 0x5C4DD124
213
#define KK2 0x6D703EF3
214
#define KK3 0x7A6D76E9
215
#define KK4 0x00000000
216
#define F0(x,y,z) ( (x) ^ (y) ^ (z) )
217
#define F1(x,y,z) ( ((x) & (y)) | (~(x) & (z)) )
218
#define F2(x,y,z) ( ((x) | ~(y)) ^ (z) )
219
#define F3(x,y,z) ( ((x) & (z)) | ((y) & ~(z)) )
220
#define F4(x,y,z) ( (x) ^ ((y) | ~(z)) )
221
#define R(a,b,c,d,e,f,k,r,s) do { t = a + f(b,c,d) + k + x[r]; \
232
R( a, b, c, d, e, F0, K0, 0, 11 );
233
R( e, a, b, c, d, F0, K0, 1, 14 );
234
R( d, e, a, b, c, F0, K0, 2, 15 );
235
R( c, d, e, a, b, F0, K0, 3, 12 );
236
R( b, c, d, e, a, F0, K0, 4, 5 );
237
R( a, b, c, d, e, F0, K0, 5, 8 );
238
R( e, a, b, c, d, F0, K0, 6, 7 );
239
R( d, e, a, b, c, F0, K0, 7, 9 );
240
R( c, d, e, a, b, F0, K0, 8, 11 );
241
R( b, c, d, e, a, F0, K0, 9, 13 );
242
R( a, b, c, d, e, F0, K0, 10, 14 );
243
R( e, a, b, c, d, F0, K0, 11, 15 );
244
R( d, e, a, b, c, F0, K0, 12, 6 );
245
R( c, d, e, a, b, F0, K0, 13, 7 );
246
R( b, c, d, e, a, F0, K0, 14, 9 );
247
R( a, b, c, d, e, F0, K0, 15, 8 );
248
R( e, a, b, c, d, F1, K1, 7, 7 );
249
R( d, e, a, b, c, F1, K1, 4, 6 );
250
R( c, d, e, a, b, F1, K1, 13, 8 );
251
R( b, c, d, e, a, F1, K1, 1, 13 );
252
R( a, b, c, d, e, F1, K1, 10, 11 );
253
R( e, a, b, c, d, F1, K1, 6, 9 );
254
R( d, e, a, b, c, F1, K1, 15, 7 );
255
R( c, d, e, a, b, F1, K1, 3, 15 );
256
R( b, c, d, e, a, F1, K1, 12, 7 );
257
R( a, b, c, d, e, F1, K1, 0, 12 );
258
R( e, a, b, c, d, F1, K1, 9, 15 );
259
R( d, e, a, b, c, F1, K1, 5, 9 );
260
R( c, d, e, a, b, F1, K1, 2, 11 );
261
R( b, c, d, e, a, F1, K1, 14, 7 );
262
R( a, b, c, d, e, F1, K1, 11, 13 );
263
R( e, a, b, c, d, F1, K1, 8, 12 );
264
R( d, e, a, b, c, F2, K2, 3, 11 );
265
R( c, d, e, a, b, F2, K2, 10, 13 );
266
R( b, c, d, e, a, F2, K2, 14, 6 );
267
R( a, b, c, d, e, F2, K2, 4, 7 );
268
R( e, a, b, c, d, F2, K2, 9, 14 );
269
R( d, e, a, b, c, F2, K2, 15, 9 );
270
R( c, d, e, a, b, F2, K2, 8, 13 );
271
R( b, c, d, e, a, F2, K2, 1, 15 );
272
R( a, b, c, d, e, F2, K2, 2, 14 );
273
R( e, a, b, c, d, F2, K2, 7, 8 );
274
R( d, e, a, b, c, F2, K2, 0, 13 );
275
R( c, d, e, a, b, F2, K2, 6, 6 );
276
R( b, c, d, e, a, F2, K2, 13, 5 );
277
R( a, b, c, d, e, F2, K2, 11, 12 );
278
R( e, a, b, c, d, F2, K2, 5, 7 );
279
R( d, e, a, b, c, F2, K2, 12, 5 );
280
R( c, d, e, a, b, F3, K3, 1, 11 );
281
R( b, c, d, e, a, F3, K3, 9, 12 );
282
R( a, b, c, d, e, F3, K3, 11, 14 );
283
R( e, a, b, c, d, F3, K3, 10, 15 );
284
R( d, e, a, b, c, F3, K3, 0, 14 );
285
R( c, d, e, a, b, F3, K3, 8, 15 );
286
R( b, c, d, e, a, F3, K3, 12, 9 );
287
R( a, b, c, d, e, F3, K3, 4, 8 );
288
R( e, a, b, c, d, F3, K3, 13, 9 );
289
R( d, e, a, b, c, F3, K3, 3, 14 );
290
R( c, d, e, a, b, F3, K3, 7, 5 );
291
R( b, c, d, e, a, F3, K3, 15, 6 );
292
R( a, b, c, d, e, F3, K3, 14, 8 );
293
R( e, a, b, c, d, F3, K3, 5, 6 );
294
R( d, e, a, b, c, F3, K3, 6, 5 );
295
R( c, d, e, a, b, F3, K3, 2, 12 );
296
R( b, c, d, e, a, F4, K4, 4, 9 );
297
R( a, b, c, d, e, F4, K4, 0, 15 );
298
R( e, a, b, c, d, F4, K4, 5, 5 );
299
R( d, e, a, b, c, F4, K4, 9, 11 );
300
R( c, d, e, a, b, F4, K4, 7, 6 );
301
R( b, c, d, e, a, F4, K4, 12, 8 );
302
R( a, b, c, d, e, F4, K4, 2, 13 );
303
R( e, a, b, c, d, F4, K4, 10, 12 );
304
R( d, e, a, b, c, F4, K4, 14, 5 );
305
R( c, d, e, a, b, F4, K4, 1, 12 );
306
R( b, c, d, e, a, F4, K4, 3, 13 );
307
R( a, b, c, d, e, F4, K4, 8, 14 );
308
R( e, a, b, c, d, F4, K4, 11, 11 );
309
R( d, e, a, b, c, F4, K4, 6, 8 );
310
R( c, d, e, a, b, F4, K4, 15, 5 );
311
R( b, c, d, e, a, F4, K4, 13, 6 );
313
aa = a; bb = b; cc = c; dd = d; ee = e;
321
R( a, b, c, d, e, F4, KK0, 5, 8);
322
R( e, a, b, c, d, F4, KK0, 14, 9);
323
R( d, e, a, b, c, F4, KK0, 7, 9);
324
R( c, d, e, a, b, F4, KK0, 0, 11);
325
R( b, c, d, e, a, F4, KK0, 9, 13);
326
R( a, b, c, d, e, F4, KK0, 2, 15);
327
R( e, a, b, c, d, F4, KK0, 11, 15);
328
R( d, e, a, b, c, F4, KK0, 4, 5);
329
R( c, d, e, a, b, F4, KK0, 13, 7);
330
R( b, c, d, e, a, F4, KK0, 6, 7);
331
R( a, b, c, d, e, F4, KK0, 15, 8);
332
R( e, a, b, c, d, F4, KK0, 8, 11);
333
R( d, e, a, b, c, F4, KK0, 1, 14);
334
R( c, d, e, a, b, F4, KK0, 10, 14);
335
R( b, c, d, e, a, F4, KK0, 3, 12);
336
R( a, b, c, d, e, F4, KK0, 12, 6);
337
R( e, a, b, c, d, F3, KK1, 6, 9);
338
R( d, e, a, b, c, F3, KK1, 11, 13);
339
R( c, d, e, a, b, F3, KK1, 3, 15);
340
R( b, c, d, e, a, F3, KK1, 7, 7);
341
R( a, b, c, d, e, F3, KK1, 0, 12);
342
R( e, a, b, c, d, F3, KK1, 13, 8);
343
R( d, e, a, b, c, F3, KK1, 5, 9);
344
R( c, d, e, a, b, F3, KK1, 10, 11);
345
R( b, c, d, e, a, F3, KK1, 14, 7);
346
R( a, b, c, d, e, F3, KK1, 15, 7);
347
R( e, a, b, c, d, F3, KK1, 8, 12);
348
R( d, e, a, b, c, F3, KK1, 12, 7);
349
R( c, d, e, a, b, F3, KK1, 4, 6);
350
R( b, c, d, e, a, F3, KK1, 9, 15);
351
R( a, b, c, d, e, F3, KK1, 1, 13);
352
R( e, a, b, c, d, F3, KK1, 2, 11);
353
R( d, e, a, b, c, F2, KK2, 15, 9);
354
R( c, d, e, a, b, F2, KK2, 5, 7);
355
R( b, c, d, e, a, F2, KK2, 1, 15);
356
R( a, b, c, d, e, F2, KK2, 3, 11);
357
R( e, a, b, c, d, F2, KK2, 7, 8);
358
R( d, e, a, b, c, F2, KK2, 14, 6);
359
R( c, d, e, a, b, F2, KK2, 6, 6);
360
R( b, c, d, e, a, F2, KK2, 9, 14);
361
R( a, b, c, d, e, F2, KK2, 11, 12);
362
R( e, a, b, c, d, F2, KK2, 8, 13);
363
R( d, e, a, b, c, F2, KK2, 12, 5);
364
R( c, d, e, a, b, F2, KK2, 2, 14);
365
R( b, c, d, e, a, F2, KK2, 10, 13);
366
R( a, b, c, d, e, F2, KK2, 0, 13);
367
R( e, a, b, c, d, F2, KK2, 4, 7);
368
R( d, e, a, b, c, F2, KK2, 13, 5);
369
R( c, d, e, a, b, F1, KK3, 8, 15);
370
R( b, c, d, e, a, F1, KK3, 6, 5);
371
R( a, b, c, d, e, F1, KK3, 4, 8);
372
R( e, a, b, c, d, F1, KK3, 1, 11);
373
R( d, e, a, b, c, F1, KK3, 3, 14);
374
R( c, d, e, a, b, F1, KK3, 11, 14);
375
R( b, c, d, e, a, F1, KK3, 15, 6);
376
R( a, b, c, d, e, F1, KK3, 0, 14);
377
R( e, a, b, c, d, F1, KK3, 5, 6);
378
R( d, e, a, b, c, F1, KK3, 12, 9);
379
R( c, d, e, a, b, F1, KK3, 2, 12);
380
R( b, c, d, e, a, F1, KK3, 13, 9);
381
R( a, b, c, d, e, F1, KK3, 9, 12);
382
R( e, a, b, c, d, F1, KK3, 7, 5);
383
R( d, e, a, b, c, F1, KK3, 10, 15);
384
R( c, d, e, a, b, F1, KK3, 14, 8);
385
R( b, c, d, e, a, F0, KK4, 12, 8);
386
R( a, b, c, d, e, F0, KK4, 15, 5);
387
R( e, a, b, c, d, F0, KK4, 10, 12);
388
R( d, e, a, b, c, F0, KK4, 4, 9);
389
R( c, d, e, a, b, F0, KK4, 1, 12);
390
R( b, c, d, e, a, F0, KK4, 5, 5);
391
R( a, b, c, d, e, F0, KK4, 8, 14);
392
R( e, a, b, c, d, F0, KK4, 7, 6);
393
R( d, e, a, b, c, F0, KK4, 6, 8);
394
R( c, d, e, a, b, F0, KK4, 2, 13);
395
R( b, c, d, e, a, F0, KK4, 13, 6);
396
R( a, b, c, d, e, F0, KK4, 14, 5);
397
R( e, a, b, c, d, F0, KK4, 0, 15);
398
R( d, e, a, b, c, F0, KK4, 3, 13);
399
R( c, d, e, a, b, F0, KK4, 9, 11);
400
R( b, c, d, e, a, F0, KK4, 11, 11);
404
hd->h1 = hd->h2 + e + dd;
405
hd->h2 = hd->h3 + a + ee;
406
hd->h3 = hd->h4 + b + aa;
407
hd->h4 = hd->h0 + c + bb;
412
/* Update the message digest with the contents
413
* of INBUF with length INLEN.
416
rmd160_write( RMD160_CONTEXT *hd, byte *inbuf, size_t inlen)
418
if( hd->count == 64 ) { /* flush the buffer */
419
transform( hd, hd->buf );
420
burn_stack (108+5*sizeof(void*));
427
for( ; inlen && hd->count < 64; inlen-- )
428
hd->buf[hd->count++] = *inbuf++;
429
rmd160_write( hd, NULL, 0 );
434
while( inlen >= 64 ) {
435
transform( hd, inbuf );
441
burn_stack (108+5*sizeof(void*));
442
for( ; inlen && hd->count < 64; inlen-- )
443
hd->buf[hd->count++] = *inbuf++;
447
* Apply the rmd160 transform function on the buffer which must have
448
* a length 64 bytes. Do not use this function together with the
449
* other functions, use rmd160_init to initialize internal variables.
450
* Returns: 16 bytes in buffer with the mixed contentes of buffer.
453
rmd160_mixblock( RMD160_CONTEXT *hd, char *buffer )
456
transform( hd, buffer );
457
#define X(a) do { *(u32*)p = hd->h##a ; p += 4; } while(0)
467
/* The routine terminates the computation
471
rmd160_final( RMD160_CONTEXT *hd )
476
rmd160_write(hd, NULL, 0); /* flush */;
479
/* multiply by 64 to make a byte count */
484
if( (lsb += hd->count) < t )
486
/* multiply by 8 to make a bit count */
492
if( hd->count < 56 ) { /* enough room */
493
hd->buf[hd->count++] = 0x80; /* pad */
494
while( hd->count < 56 )
495
hd->buf[hd->count++] = 0; /* pad */
497
else { /* need one extra block */
498
hd->buf[hd->count++] = 0x80; /* pad character */
499
while( hd->count < 64 )
500
hd->buf[hd->count++] = 0;
501
rmd160_write(hd, NULL, 0); /* flush */;
502
memset(hd->buf, 0, 56 ); /* fill next block with zeroes */
504
/* append the 64 bit count */
506
hd->buf[57] = lsb >> 8;
507
hd->buf[58] = lsb >> 16;
508
hd->buf[59] = lsb >> 24;
510
hd->buf[61] = msb >> 8;
511
hd->buf[62] = msb >> 16;
512
hd->buf[63] = msb >> 24;
513
transform( hd, hd->buf );
514
burn_stack (108+5*sizeof(void*));
517
#ifdef BIG_ENDIAN_HOST
518
#define X(a) do { *p++ = hd->h##a ; *p++ = hd->h##a >> 8; \
519
*p++ = hd->h##a >> 16; *p++ = hd->h##a >> 24; } while(0)
520
#else /* little endian */
521
#define X(a) do { *(u32*)p = hd->h##a ; p += 4; } while(0)
532
rmd160_read( RMD160_CONTEXT *hd )
540
* Shortcut functions which puts the hash value of the supplied buffer
541
* into outbuf which must have a size of 20 bytes.
544
rmd160_hash_buffer( char *outbuf, const char *buffer, size_t length )
549
rmd160_write( &hd, (byte*)buffer, length );
551
memcpy( outbuf, hd.buf, 20 );
556
* Return some information about the algorithm. We need algo here to
557
* distinguish different flavors of the algorithm.
558
* Returns: A pointer to string describing the algorithm or NULL if
559
* the ALGO is invalid.
562
rmd160_get_info( int algo, size_t *contextsize,
563
byte **r_asnoid, int *r_asnlen, int *r_mdlen,
564
void (**r_init)( void *c ),
565
void (**r_write)( void *c, byte *buf, size_t nbytes ),
566
void (**r_final)( void *c ),
567
byte *(**r_read)( void *c )
570
static byte asn[15] = /* Object ID is 1.3.36.3.2.1 */
571
{ 0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2b, 0x24, 0x03,
572
0x02, 0x01, 0x05, 0x00, 0x04, 0x14 };
577
*contextsize = sizeof(RMD160_CONTEXT);
579
*r_asnlen = DIM(asn);
581
*(void (**)(RMD160_CONTEXT *))r_init = rmd160_init;
582
*(void (**)(RMD160_CONTEXT *, byte*, size_t))r_write = rmd160_write;
583
*(void (**)(RMD160_CONTEXT *))r_final = rmd160_final;
584
*(byte *(**)(RMD160_CONTEXT *))r_read = rmd160_read;
added
removed
cipher/rmd160.c
