ripemd160.c
Go to the documentation of this file.
1 /**
2  * @file ripemd160.c
3  * @brief RIPEMD-160 hash function
4  *
5  * @section License
6  *
7  * SPDX-License-Identifier: GPL-2.0-or-later
8  *
9  * Copyright (C) 2010-2025 Oryx Embedded SARL. All rights reserved.
10  *
11  * This file is part of CycloneCRYPTO Open.
12  *
13  * This program is free software; you can redistribute it and/or
14  * modify it under the terms of the GNU General Public License
15  * as published by the Free Software Foundation; either version 2
16  * of the License, or (at your option) any later version.
17  *
18  * This program is distributed in the hope that it will be useful,
19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21  * GNU General Public License for more details.
22  *
23  * You should have received a copy of the GNU General Public License
24  * along with this program; if not, write to the Free Software Foundation,
25  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
26  *
27  * @author Oryx Embedded SARL (www.oryx-embedded.com)
28  * @version 2.5.0
29  **/
30 
31 //Switch to the appropriate trace level
32 #define TRACE_LEVEL CRYPTO_TRACE_LEVEL
33 
34 //Dependencies
35 #include "core/crypto.h"
36 #include "hash/ripemd160.h"
37 
38 //Check crypto library configuration
39 #if (RIPEMD160_SUPPORT == ENABLED)
40 
41 //RIPEMD-160 auxiliary functions
42 #define F(x, y, z) ((x) ^ (y) ^ (z))
43 #define G(x, y, z) (((x) & (y)) | (~(x) & (z)))
44 #define H(x, y, z) (((x) | ~(y)) ^ (z))
45 #define I(x, y, z) (((x) & (z)) | ((y) & ~(z)))
46 #define J(x, y, z) ((x) ^ ((y) | ~(z)))
47 
48 #define FF(a, b, c, d, e, x, s) a += F(b, c, d) + (x), a = ROL32(a, s) + (e), c = ROL32(c, 10)
49 #define GG(a, b, c, d, e, x, s) a += G(b, c, d) + (x) + 0x5A827999, a = ROL32(a, s) + (e), c = ROL32(c, 10)
50 #define HH(a, b, c, d, e, x, s) a += H(b, c, d) + (x) + 0x6ED9EBA1, a = ROL32(a, s) + (e), c = ROL32(c, 10)
51 #define II(a, b, c, d, e, x, s) a += I(b, c, d) + (x) + 0x8F1BBCDC, a = ROL32(a, s) + (e), c = ROL32(c, 10)
52 #define JJ(a, b, c, d, e, x, s) a += J(b, c, d) + (x) + 0xA953FD4E, a = ROL32(a, s) + (e), c = ROL32(c, 10)
53 
54 #define FFF(a, b, c, d, e, x, s) a += F(b, c, d) + (x), a = ROL32(a, s) + (e), c = ROL32(c, 10)
55 #define GGG(a, b, c, d, e, x, s) a += G(b, c, d) + (x) + 0x7A6D76E9, a = ROL32(a, s) + (e), c = ROL32(c, 10)
56 #define HHH(a, b, c, d, e, x, s) a += H(b, c, d) + (x) + 0x6D703EF3, a = ROL32(a, s) + (e), c = ROL32(c, 10)
57 #define III(a, b, c, d, e, x, s) a += I(b, c, d) + (x) + 0x5C4DD124, a = ROL32(a, s) + (e), c = ROL32(c, 10)
58 #define JJJ(a, b, c, d, e, x, s) a += J(b, c, d) + (x) + 0x50A28BE6, a = ROL32(a, s) + (e), c = ROL32(c, 10)
59 
60 //RIPEMD-160 padding
61 static const uint8_t padding[64] =
62 {
63  0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
64  0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
65  0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
66  0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
67 };
68 
69 //RIPEMD-160 object identifier (1.3.36.3.2.1)
70 const uint8_t RIPEMD160_OID[5] = {0x2B, 0x24, 0x03, 0x02, 0x01};
71 
72 //Common interface for hash algorithms
73 const HashAlgo ripemd160HashAlgo =
74 {
75  "RIPEMD-160",
76  RIPEMD160_OID,
77  sizeof(RIPEMD160_OID),
78  sizeof(Ripemd160Context),
79  RIPEMD160_BLOCK_SIZE,
80  RIPEMD160_DIGEST_SIZE,
81  RIPEMD160_MIN_PAD_SIZE,
82  FALSE,
83  (HashAlgoCompute) ripemd160Compute,
84  (HashAlgoInit) ripemd160Init,
85  (HashAlgoUpdate) ripemd160Update,
86  (HashAlgoFinal) ripemd160Final,
87  NULL
88 };
89 
90 
91 /**
92  * @brief Digest a message using RIPEMD-160
93  * @param[in] data Pointer to the message being hashed
94  * @param[in] length Length of the message
95  * @param[out] digest Pointer to the calculated digest
96  * @return Error code
97  **/
98 
99 error_t ripemd160Compute(const void *data, size_t length, uint8_t *digest)
100 {
101 #if (CRYPTO_STATIC_MEM_SUPPORT == DISABLED)
102  Ripemd160Context *context;
103 #else
104  Ripemd160Context context[1];
105 #endif
106 
107  //Check parameters
108  if(data == NULL && length != 0)
109  return ERROR_INVALID_PARAMETER;
110 
111  if(digest == NULL)
112  return ERROR_INVALID_PARAMETER;
113 
114 #if (CRYPTO_STATIC_MEM_SUPPORT == DISABLED)
115  //Allocate a memory buffer to hold the RIPEMD-160 context
116  context = cryptoAllocMem(sizeof(Ripemd160Context));
117  //Failed to allocate memory?
118  if(context == NULL)
119  return ERROR_OUT_OF_MEMORY;
120 #endif
121 
122  //Initialize the RIPEMD-160 context
123  ripemd160Init(context);
124  //Digest the message
125  ripemd160Update(context, data, length);
126  //Finalize the RIPEMD-160 message digest
127  ripemd160Final(context, digest);
128 
129 #if (CRYPTO_STATIC_MEM_SUPPORT == DISABLED)
130  //Free previously allocated memory
131  cryptoFreeMem(context);
132 #endif
133 
134  //Successful operation
135  return NO_ERROR;
136 }
137 
138 
139 /**
140  * @brief Initialize RIPEMD-160 message digest context
141  * @param[in] context Pointer to the RIPEMD-160 context to initialize
142  **/
143 
144 void ripemd160Init(Ripemd160Context *context)
145 {
146  //Set initial hash value
147  context->h[0] = 0x67452301;
148  context->h[1] = 0xEFCDAB89;
149  context->h[2] = 0x98BADCFE;
150  context->h[3] = 0x10325476;
151  context->h[4] = 0xC3D2E1F0;
152 
153  //Number of bytes in the buffer
154  context->size = 0;
155  //Total length of the message
156  context->totalSize = 0;
157 }
158 
159 
160 /**
161  * @brief Update the RIPEMD-160 context with a portion of the message being hashed
162  * @param[in] context Pointer to the RIPEMD-160 context
163  * @param[in] data Pointer to the buffer being hashed
164  * @param[in] length Length of the buffer
165  **/
166 
167 void ripemd160Update(Ripemd160Context *context, const void *data, size_t length)
168 {
169  size_t n;
170 
171  //Process the incoming data
172  while(length > 0)
173  {
174  //The buffer can hold at most 64 bytes
175  n = MIN(length, 64 - context->size);
176 
177  //Copy the data to the buffer
178  osMemcpy(context->buffer + context->size, data, n);
179 
180  //Update the RIPEMD-160 context
181  context->size += n;
182  context->totalSize += n;
183  //Advance the data pointer
184  data = (uint8_t *) data + n;
185  //Remaining bytes to process
186  length -= n;
187 
188  //Process message in 16-word blocks
189  if(context->size == 64)
190  {
191  //Transform the 16-word block
192  ripemd160ProcessBlock(context);
193  //Empty the buffer
194  context->size = 0;
195  }
196  }
197 }
198 
199 
200 /**
201  * @brief Finish the RIPEMD-160 message digest
202  * @param[in] context Pointer to the RIPEMD-160 context
203  * @param[out] digest Calculated digest
204  **/
205 
206 void ripemd160Final(Ripemd160Context *context, uint8_t *digest)
207 {
208  uint_t i;
209  size_t paddingSize;
210  uint64_t totalSize;
211 
212  //Length of the original message (before padding)
213  totalSize = context->totalSize * 8;
214 
215  //Pad the message so that its length is congruent to 56 modulo 64
216  if(context->size < 56)
217  {
218  paddingSize = 56 - context->size;
219  }
220  else
221  {
222  paddingSize = 64 + 56 - context->size;
223  }
224 
225  //Append padding
226  ripemd160Update(context, padding, paddingSize);
227 
228  //Append the length of the original message
229  for(i = 0; i < 8; i++)
230  {
231  context->buffer[56 + i] = totalSize & 0xFF;
232  totalSize >>= 8;
233  }
234 
235  //Calculate the message digest
236  ripemd160ProcessBlock(context);
237 
238  //Copy the resulting digest
239  for(i = 0; i < (RIPEMD160_DIGEST_SIZE / 4); i++)
240  {
241  STORE32LE(context->h[i], digest + i * 4);
242  }
243 }
244 
245 
246 /**
247  * @brief Process message in 16-word blocks
248  * @param[in] context Pointer to the RIPEMD-160 context
249  **/
250 
251 void ripemd160ProcessBlock(Ripemd160Context *context)
252 {
253  uint_t i;
254 
255  //Initialize the working registers
256  uint32_t aa= context->h[0];
257  uint32_t bb = context->h[1];
258  uint32_t cc = context->h[2];
259  uint32_t dd = context->h[3];
260  uint32_t ee = context->h[4];
261  uint32_t aaa = context->h[0];
262  uint32_t bbb = context->h[1];
263  uint32_t ccc = context->h[2];
264  uint32_t ddd = context->h[3];
265  uint32_t eee = context->h[4];
266 
267  //Process message in 16-word blocks
268  uint32_t *x = context->x;
269 
270  //Convert from little-endian byte order to host byte order
271  for(i = 0; i < 16; i++)
272  {
273  x[i] = LOAD32LE(context->buffer + i * 4);
274  }
275 
276  //Round 1
277  FF(aa, bb, cc, dd, ee, x[0], 11);
278  FF(ee, aa, bb, cc, dd, x[1], 14);
279  FF(dd, ee, aa, bb, cc, x[2], 15);
280  FF(cc, dd, ee, aa, bb, x[3], 12);
281  FF(bb, cc, dd, ee, aa, x[4], 5);
282  FF(aa, bb, cc, dd, ee, x[5], 8);
283  FF(ee, aa, bb, cc, dd, x[6], 7);
284  FF(dd, ee, aa, bb, cc, x[7], 9);
285  FF(cc, dd, ee, aa, bb, x[8], 11);
286  FF(bb, cc, dd, ee, aa, x[9], 13);
287  FF(aa, bb, cc, dd, ee, x[10], 14);
288  FF(ee, aa, bb, cc, dd, x[11], 15);
289  FF(dd, ee, aa, bb, cc, x[12], 6);
290  FF(cc, dd, ee, aa, bb, x[13], 7);
291  FF(bb, cc, dd, ee, aa, x[14], 9);
292  FF(aa, bb, cc, dd, ee, x[15], 8);
293 
294  //Round 2
295  GG(ee, aa, bb, cc, dd, x[7], 7);
296  GG(dd, ee, aa, bb, cc, x[4], 6);
297  GG(cc, dd, ee, aa, bb, x[13], 8);
298  GG(bb, cc, dd, ee, aa, x[1], 13);
299  GG(aa, bb, cc, dd, ee, x[10], 11);
300  GG(ee, aa, bb, cc, dd, x[6], 9);
301  GG(dd, ee, aa, bb, cc, x[15], 7);
302  GG(cc, dd, ee, aa, bb, x[3], 15);
303  GG(bb, cc, dd, ee, aa, x[12], 7);
304  GG(aa, bb, cc, dd, ee, x[0], 12);
305  GG(ee, aa, bb, cc, dd, x[9], 15);
306  GG(dd, ee, aa, bb, cc, x[5], 9);
307  GG(cc, dd, ee, aa, bb, x[2], 11);
308  GG(bb, cc, dd, ee, aa, x[14], 7);
309  GG(aa, bb, cc, dd, ee, x[11], 13);
310  GG(ee, aa, bb, cc, dd, x[8], 12);
311 
312  //Round 3
313  HH(dd, ee, aa, bb, cc, x[3], 11);
314  HH(cc, dd, ee, aa, bb, x[10], 13);
315  HH(bb, cc, dd, ee, aa, x[14], 6);
316  HH(aa, bb, cc, dd, ee, x[4], 7);
317  HH(ee, aa, bb, cc, dd, x[9], 14);
318  HH(dd, ee, aa, bb, cc, x[15], 9);
319  HH(cc, dd, ee, aa, bb, x[8], 13);
320  HH(bb, cc, dd, ee, aa, x[1], 15);
321  HH(aa, bb, cc, dd, ee, x[2], 14);
322  HH(ee, aa, bb, cc, dd, x[7], 8);
323  HH(dd, ee, aa, bb, cc, x[0], 13);
324  HH(cc, dd, ee, aa, bb, x[6], 6);
325  HH(bb, cc, dd, ee, aa, x[13], 5);
326  HH(aa, bb, cc, dd, ee, x[11], 12);
327  HH(ee, aa, bb, cc, dd, x[5], 7);
328  HH(dd, ee, aa, bb, cc, x[12], 5);
329 
330  //Round 4
331  II(cc, dd, ee, aa, bb, x[1], 11);
332  II(bb, cc, dd, ee, aa, x[9], 12);
333  II(aa, bb, cc, dd, ee, x[11], 14);
334  II(ee, aa, bb, cc, dd, x[10], 15);
335  II(dd, ee, aa, bb, cc, x[0], 14);
336  II(cc, dd, ee, aa, bb, x[8], 15);
337  II(bb, cc, dd, ee, aa, x[12], 9);
338  II(aa, bb, cc, dd, ee, x[4], 8);
339  II(ee, aa, bb, cc, dd, x[13], 9);
340  II(dd, ee, aa, bb, cc, x[3], 14);
341  II(cc, dd, ee, aa, bb, x[7], 5);
342  II(bb, cc, dd, ee, aa, x[15], 6);
343  II(aa, bb, cc, dd, ee, x[14], 8);
344  II(ee, aa, bb, cc, dd, x[5], 6);
345  II(dd, ee, aa, bb, cc, x[6], 5);
346  II(cc, dd, ee, aa, bb, x[2], 12);
347 
348  //Round 5
349  JJ(bb, cc, dd, ee, aa, x[4], 9);
350  JJ(aa, bb, cc, dd, ee, x[0], 15);
351  JJ(ee, aa, bb, cc, dd, x[5], 5);
352  JJ(dd, ee, aa, bb, cc, x[9], 11);
353  JJ(cc, dd, ee, aa, bb, x[7], 6);
354  JJ(bb, cc, dd, ee, aa, x[12], 8);
355  JJ(aa, bb, cc, dd, ee, x[2], 13);
356  JJ(ee, aa, bb, cc, dd, x[10], 12);
357  JJ(dd, ee, aa, bb, cc, x[14], 5);
358  JJ(cc, dd, ee, aa, bb, x[1], 12);
359  JJ(bb, cc, dd, ee, aa, x[3], 13);
360  JJ(aa, bb, cc, dd, ee, x[8], 14);
361  JJ(ee, aa, bb, cc, dd, x[11], 11);
362  JJ(dd, ee, aa, bb, cc, x[6], 8);
363  JJ(cc, dd, ee, aa, bb, x[15], 5);
364  JJ(bb, cc, dd, ee, aa, x[13], 6);
365 
366  //Parallel round 1
367  JJJ(aaa, bbb, ccc, ddd, eee, x[5], 8);
368  JJJ(eee, aaa, bbb, ccc, ddd, x[14], 9);
369  JJJ(ddd, eee, aaa, bbb, ccc, x[7], 9);
370  JJJ(ccc, ddd, eee, aaa, bbb, x[0], 11);
371  JJJ(bbb, ccc, ddd, eee, aaa, x[9], 13);
372  JJJ(aaa, bbb, ccc, ddd, eee, x[2], 15);
373  JJJ(eee, aaa, bbb, ccc, ddd, x[11], 15);
374  JJJ(ddd, eee, aaa, bbb, ccc, x[4], 5);
375  JJJ(ccc, ddd, eee, aaa, bbb, x[13], 7);
376  JJJ(bbb, ccc, ddd, eee, aaa, x[6], 7);
377  JJJ(aaa, bbb, ccc, ddd, eee, x[15], 8);
378  JJJ(eee, aaa, bbb, ccc, ddd, x[8], 11);
379  JJJ(ddd, eee, aaa, bbb, ccc, x[1], 14);
380  JJJ(ccc, ddd, eee, aaa, bbb, x[10], 14);
381  JJJ(bbb, ccc, ddd, eee, aaa, x[3], 12);
382  JJJ(aaa, bbb, ccc, ddd, eee, x[12], 6);
383 
384  //Parallel round 2
385  III(eee, aaa, bbb, ccc, ddd, x[6], 9);
386  III(ddd, eee, aaa, bbb, ccc, x[11], 13);
387  III(ccc, ddd, eee, aaa, bbb, x[3], 15);
388  III(bbb, ccc, ddd, eee, aaa, x[7], 7);
389  III(aaa, bbb, ccc, ddd, eee, x[0], 12);
390  III(eee, aaa, bbb, ccc, ddd, x[13], 8);
391  III(ddd, eee, aaa, bbb, ccc, x[5], 9);
392  III(ccc, ddd, eee, aaa, bbb, x[10], 11);
393  III(bbb, ccc, ddd, eee, aaa, x[14], 7);
394  III(aaa, bbb, ccc, ddd, eee, x[15], 7);
395  III(eee, aaa, bbb, ccc, ddd, x[8], 12);
396  III(ddd, eee, aaa, bbb, ccc, x[12], 7);
397  III(ccc, ddd, eee, aaa, bbb, x[4], 6);
398  III(bbb, ccc, ddd, eee, aaa, x[9], 15);
399  III(aaa, bbb, ccc, ddd, eee, x[1], 13);
400  III(eee, aaa, bbb, ccc, ddd, x[2], 11);
401 
402  //Parallel round 3
403  HHH(ddd, eee, aaa, bbb, ccc, x[15], 9);
404  HHH(ccc, ddd, eee, aaa, bbb, x[5], 7);
405  HHH(bbb, ccc, ddd, eee, aaa, x[1], 15);
406  HHH(aaa, bbb, ccc, ddd, eee, x[3], 11);
407  HHH(eee, aaa, bbb, ccc, ddd, x[7], 8);
408  HHH(ddd, eee, aaa, bbb, ccc, x[14], 6);
409  HHH(ccc, ddd, eee, aaa, bbb, x[6], 6);
410  HHH(bbb, ccc, ddd, eee, aaa, x[9], 14);
411  HHH(aaa, bbb, ccc, ddd, eee, x[11], 12);
412  HHH(eee, aaa, bbb, ccc, ddd, x[8], 13);
413  HHH(ddd, eee, aaa, bbb, ccc, x[12], 5);
414  HHH(ccc, ddd, eee, aaa, bbb, x[2], 14);
415  HHH(bbb, ccc, ddd, eee, aaa, x[10], 13);
416  HHH(aaa, bbb, ccc, ddd, eee, x[0], 13);
417  HHH(eee, aaa, bbb, ccc, ddd, x[4], 7);
418  HHH(ddd, eee, aaa, bbb, ccc, x[13], 5);
419 
420  //Parallel round 4
421  GGG(ccc, ddd, eee, aaa, bbb, x[8], 15);
422  GGG(bbb, ccc, ddd, eee, aaa, x[6], 5);
423  GGG(aaa, bbb, ccc, ddd, eee, x[4], 8);
424  GGG(eee, aaa, bbb, ccc, ddd, x[1], 11);
425  GGG(ddd, eee, aaa, bbb, ccc, x[3], 14);
426  GGG(ccc, ddd, eee, aaa, bbb, x[11], 14);
427  GGG(bbb, ccc, ddd, eee, aaa, x[15], 6);
428  GGG(aaa, bbb, ccc, ddd, eee, x[0], 14);
429  GGG(eee, aaa, bbb, ccc, ddd, x[5], 6);
430  GGG(ddd, eee, aaa, bbb, ccc, x[12], 9);
431  GGG(ccc, ddd, eee, aaa, bbb, x[2], 12);
432  GGG(bbb, ccc, ddd, eee, aaa, x[13], 9);
433  GGG(aaa, bbb, ccc, ddd, eee, x[9], 12);
434  GGG(eee, aaa, bbb, ccc, ddd, x[7], 5);
435  GGG(ddd, eee, aaa, bbb, ccc, x[10], 15);
436  GGG(ccc, ddd, eee, aaa, bbb, x[14], 8);
437 
438  //Parallel round 5
439  FFF(bbb, ccc, ddd, eee, aaa, x[12], 8);
440  FFF(aaa, bbb, ccc, ddd, eee, x[15], 5);
441  FFF(eee, aaa, bbb, ccc, ddd, x[10], 12);
442  FFF(ddd, eee, aaa, bbb, ccc, x[4], 9);
443  FFF(ccc, ddd, eee, aaa, bbb, x[1], 12);
444  FFF(bbb, ccc, ddd, eee, aaa, x[5], 5);
445  FFF(aaa, bbb, ccc, ddd, eee, x[8], 14);
446  FFF(eee, aaa, bbb, ccc, ddd, x[7], 6);
447  FFF(ddd, eee, aaa, bbb, ccc, x[6], 8);
448  FFF(ccc, ddd, eee, aaa, bbb, x[2], 13);
449  FFF(bbb, ccc, ddd, eee, aaa, x[13], 6);
450  FFF(aaa, bbb, ccc, ddd, eee, x[14], 5);
451  FFF(eee, aaa, bbb, ccc, ddd, x[0], 15);
452  FFF(ddd, eee, aaa, bbb, ccc, x[3], 13);
453  FFF(ccc, ddd, eee, aaa, bbb, x[9], 11);
454  FFF(bbb, ccc, ddd, eee, aaa, x[11], 11);
455 
456  //Combine results
457  ddd = context->h[1] + cc + ddd;
458  context->h[1] = context->h[2] + dd + eee;
459  context->h[2] = context->h[3] + ee + aaa;
460  context->h[3] = context->h[4] + aa + bbb;
461  context->h[4] = context->h[0] + bb + ccc;
462  context->h[0] = ddd;
463 }
464 
465 #endif
ripemd160ProcessBlock
void ripemd160ProcessBlock(Ripemd160Context *context)
Process message in 16-word blocks.
Definition: ripemd160.c:251
HashAlgoInit
void(* HashAlgoInit)(void *context)
Definition: crypto.h:1027
Ripemd160Context::totalSize
uint64_t totalSize
Definition: ripemd160.h:65
x
uint8_t x
Definition: lldp_ext_med.h:211
GGG
#define GGG(a, b, c, d, e, x, s)
Definition: ripemd160.c:55
data
uint8_t data[]
Definition: ethernet.h:222
STORE32LE
#define STORE32LE(a, p)
Definition: cpu_endian.h:279
aa
uint8_t aa
Definition: dns_common.h:187
ERROR_OUT_OF_MEMORY
@ ERROR_OUT_OF_MEMORY
Definition: error.h:63
ripemd160Update
void ripemd160Update(Ripemd160Context *context, const void *data, size_t length)
Update the RIPEMD-160 context with a portion of the message being hashed.
Definition: ripemd160.c:167
ripemd160Final
void ripemd160Final(Ripemd160Context *context, uint8_t *digest)
Finish the RIPEMD-160 message digest.
Definition: ripemd160.c:206
HashAlgoUpdate
void(* HashAlgoUpdate)(void *context, const void *data, size_t length)
Definition: crypto.h:1029
RIPEMD160_MIN_PAD_SIZE
#define RIPEMD160_MIN_PAD_SIZE
Definition: ripemd160.h:42
FALSE
#define FALSE
Definition: os_port.h:46
FF
#define FF(a, b, c, d, e, x, s)
Definition: ripemd160.c:48
ERROR_INVALID_PARAMETER
@ ERROR_INVALID_PARAMETER
Invalid parameter.
Definition: error.h:47
osMemcpy
#define osMemcpy(dest, src, length)
Definition: os_port.h:144
III
#define III(a, b, c, d, e, x, s)
Definition: ripemd160.c:57
error_t
error_t
Error codes.
Definition: error.h:43
RIPEMD160_DIGEST_SIZE
#define RIPEMD160_DIGEST_SIZE
Definition: ripemd160.h:40
GG
#define GG(a, b, c, d, e, x, s)
Definition: ripemd160.c:49
crypto.h
General definitions for cryptographic algorithms.
Ripemd160Context
RIPEMD-160 algorithm context.
Definition: ripemd160.h:57
Ripemd160Context::buffer
uint8_t buffer[64]
Definition: ripemd160.h:62
ripemd160Init
void ripemd160Init(Ripemd160Context *context)
Initialize RIPEMD-160 message digest context.
Definition: ripemd160.c:144
length
uint8_t length
Definition: tcp.h:375
MIN
#define MIN(a, b)
Definition: os_port.h:63
HHH
#define HHH(a, b, c, d, e, x, s)
Definition: ripemd160.c:56
ripemd160HashAlgo
const HashAlgo ripemd160HashAlgo
Definition: ripemd160.c:73
HashAlgoFinal
void(* HashAlgoFinal)(void *context, uint8_t *digest)
Definition: crypto.h:1031
ripemd160.h
RIPEMD-160 hash function.
II
#define II(a, b, c, d, e, x, s)
Definition: ripemd160.c:51
JJ
#define JJ(a, b, c, d, e, x, s)
Definition: ripemd160.c:52
n
uint8_t n
Definition: dhcpv6_common.h:416
cryptoFreeMem
#define cryptoFreeMem(p)
Definition: crypto.h:826
RIPEMD160_OID
const uint8_t RIPEMD160_OID[5]
Definition: ripemd160.c:70
JJJ
#define JJJ(a, b, c, d, e, x, s)
Definition: ripemd160.c:58
RIPEMD160_BLOCK_SIZE
#define RIPEMD160_BLOCK_SIZE
Definition: ripemd160.h:38
Ripemd160Context::h
uint32_t h[5]
Definition: ripemd160.h:58
FFF
#define FFF(a, b, c, d, e, x, s)
Definition: ripemd160.c:54
cryptoAllocMem
#define cryptoAllocMem(size)
Definition: crypto.h:821
HH
#define HH(a, b, c, d, e, x, s)
Definition: ripemd160.c:50
HashAlgo
Common interface for hash algorithms.
Definition: crypto.h:1082
ripemd160Compute
error_t ripemd160Compute(const void *data, size_t length, uint8_t *digest)
Digest a message using RIPEMD-160.
Definition: ripemd160.c:99
LOAD32LE
#define LOAD32LE(p)
Definition: cpu_endian.h:203
uint_t
unsigned int uint_t
Definition: compiler_port.h:57
HashAlgoCompute
error_t(* HashAlgoCompute)(const void *data, size_t length, uint8_t *digest)
Definition: crypto.h:1024
NO_ERROR
@ NO_ERROR
Success.
Definition: error.h:44
Ripemd160Context::x
uint32_t x[16]
Definition: ripemd160.h:61