ripemd160.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. /*
  2. * RIPE MD-160 implementation
  3. *
  4. * Copyright The Mbed TLS Contributors
  5. * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
  6. */
  7. /*
  8. * The RIPEMD-160 algorithm was designed by RIPE in 1996
  9. * http://homes.esat.kuleuven.be/~bosselae/mbedtls_ripemd160.html
  10. * http://ehash.iaik.tugraz.at/wiki/RIPEMD-160
  11. */
  12. #include "common.h"
  13. #if defined(MBEDTLS_RIPEMD160_C)
  14. #include "mbedtls/ripemd160.h"
  15. #include "mbedtls/platform_util.h"
  16. #include "mbedtls/error.h"
  17. #include <string.h>
  18. #include "mbedtls/platform.h"
  19. #if !defined(MBEDTLS_RIPEMD160_ALT)
  20. void mbedtls_ripemd160_init(mbedtls_ripemd160_context *ctx)
  21. {
  22. memset(ctx, 0, sizeof(mbedtls_ripemd160_context));
  23. }
  24. void mbedtls_ripemd160_free(mbedtls_ripemd160_context *ctx)
  25. {
  26. if (ctx == NULL) {
  27. return;
  28. }
  29. mbedtls_platform_zeroize(ctx, sizeof(mbedtls_ripemd160_context));
  30. }
  31. void mbedtls_ripemd160_clone(mbedtls_ripemd160_context *dst,
  32. const mbedtls_ripemd160_context *src)
  33. {
  34. *dst = *src;
  35. }
  36. /*
  37. * RIPEMD-160 context setup
  38. */
  39. int mbedtls_ripemd160_starts(mbedtls_ripemd160_context *ctx)
  40. {
  41. ctx->total[0] = 0;
  42. ctx->total[1] = 0;
  43. ctx->state[0] = 0x67452301;
  44. ctx->state[1] = 0xEFCDAB89;
  45. ctx->state[2] = 0x98BADCFE;
  46. ctx->state[3] = 0x10325476;
  47. ctx->state[4] = 0xC3D2E1F0;
  48. return 0;
  49. }
  50. #if !defined(MBEDTLS_RIPEMD160_PROCESS_ALT)
  51. /*
  52. * Process one block
  53. */
  54. int mbedtls_internal_ripemd160_process(mbedtls_ripemd160_context *ctx,
  55. const unsigned char data[64])
  56. {
  57. struct {
  58. uint32_t A, B, C, D, E, Ap, Bp, Cp, Dp, Ep, X[16];
  59. } local;
  60. local.X[0] = MBEDTLS_GET_UINT32_LE(data, 0);
  61. local.X[1] = MBEDTLS_GET_UINT32_LE(data, 4);
  62. local.X[2] = MBEDTLS_GET_UINT32_LE(data, 8);
  63. local.X[3] = MBEDTLS_GET_UINT32_LE(data, 12);
  64. local.X[4] = MBEDTLS_GET_UINT32_LE(data, 16);
  65. local.X[5] = MBEDTLS_GET_UINT32_LE(data, 20);
  66. local.X[6] = MBEDTLS_GET_UINT32_LE(data, 24);
  67. local.X[7] = MBEDTLS_GET_UINT32_LE(data, 28);
  68. local.X[8] = MBEDTLS_GET_UINT32_LE(data, 32);
  69. local.X[9] = MBEDTLS_GET_UINT32_LE(data, 36);
  70. local.X[10] = MBEDTLS_GET_UINT32_LE(data, 40);
  71. local.X[11] = MBEDTLS_GET_UINT32_LE(data, 44);
  72. local.X[12] = MBEDTLS_GET_UINT32_LE(data, 48);
  73. local.X[13] = MBEDTLS_GET_UINT32_LE(data, 52);
  74. local.X[14] = MBEDTLS_GET_UINT32_LE(data, 56);
  75. local.X[15] = MBEDTLS_GET_UINT32_LE(data, 60);
  76. local.A = local.Ap = ctx->state[0];
  77. local.B = local.Bp = ctx->state[1];
  78. local.C = local.Cp = ctx->state[2];
  79. local.D = local.Dp = ctx->state[3];
  80. local.E = local.Ep = ctx->state[4];
  81. #define F1(x, y, z) ((x) ^ (y) ^ (z))
  82. #define F2(x, y, z) (((x) & (y)) | (~(x) & (z)))
  83. #define F3(x, y, z) (((x) | ~(y)) ^ (z))
  84. #define F4(x, y, z) (((x) & (z)) | ((y) & ~(z)))
  85. #define F5(x, y, z) ((x) ^ ((y) | ~(z)))
  86. #define S(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
  87. #define P(a, b, c, d, e, r, s, f, k) \
  88. do \
  89. { \
  90. (a) += f((b), (c), (d)) + local.X[r] + (k); \
  91. (a) = S((a), (s)) + (e); \
  92. (c) = S((c), 10); \
  93. } while (0)
  94. #define P2(a, b, c, d, e, r, s, rp, sp) \
  95. do \
  96. { \
  97. P((a), (b), (c), (d), (e), (r), (s), F, K); \
  98. P(a ## p, b ## p, c ## p, d ## p, e ## p, \
  99. (rp), (sp), Fp, Kp); \
  100. } while (0)
  101. #define F F1
  102. #define K 0x00000000
  103. #define Fp F5
  104. #define Kp 0x50A28BE6
  105. P2(local.A, local.B, local.C, local.D, local.E, 0, 11, 5, 8);
  106. P2(local.E, local.A, local.B, local.C, local.D, 1, 14, 14, 9);
  107. P2(local.D, local.E, local.A, local.B, local.C, 2, 15, 7, 9);
  108. P2(local.C, local.D, local.E, local.A, local.B, 3, 12, 0, 11);
  109. P2(local.B, local.C, local.D, local.E, local.A, 4, 5, 9, 13);
  110. P2(local.A, local.B, local.C, local.D, local.E, 5, 8, 2, 15);
  111. P2(local.E, local.A, local.B, local.C, local.D, 6, 7, 11, 15);
  112. P2(local.D, local.E, local.A, local.B, local.C, 7, 9, 4, 5);
  113. P2(local.C, local.D, local.E, local.A, local.B, 8, 11, 13, 7);
  114. P2(local.B, local.C, local.D, local.E, local.A, 9, 13, 6, 7);
  115. P2(local.A, local.B, local.C, local.D, local.E, 10, 14, 15, 8);
  116. P2(local.E, local.A, local.B, local.C, local.D, 11, 15, 8, 11);
  117. P2(local.D, local.E, local.A, local.B, local.C, 12, 6, 1, 14);
  118. P2(local.C, local.D, local.E, local.A, local.B, 13, 7, 10, 14);
  119. P2(local.B, local.C, local.D, local.E, local.A, 14, 9, 3, 12);
  120. P2(local.A, local.B, local.C, local.D, local.E, 15, 8, 12, 6);
  121. #undef F
  122. #undef K
  123. #undef Fp
  124. #undef Kp
  125. #define F F2
  126. #define K 0x5A827999
  127. #define Fp F4
  128. #define Kp 0x5C4DD124
  129. P2(local.E, local.A, local.B, local.C, local.D, 7, 7, 6, 9);
  130. P2(local.D, local.E, local.A, local.B, local.C, 4, 6, 11, 13);
  131. P2(local.C, local.D, local.E, local.A, local.B, 13, 8, 3, 15);
  132. P2(local.B, local.C, local.D, local.E, local.A, 1, 13, 7, 7);
  133. P2(local.A, local.B, local.C, local.D, local.E, 10, 11, 0, 12);
  134. P2(local.E, local.A, local.B, local.C, local.D, 6, 9, 13, 8);
  135. P2(local.D, local.E, local.A, local.B, local.C, 15, 7, 5, 9);
  136. P2(local.C, local.D, local.E, local.A, local.B, 3, 15, 10, 11);
  137. P2(local.B, local.C, local.D, local.E, local.A, 12, 7, 14, 7);
  138. P2(local.A, local.B, local.C, local.D, local.E, 0, 12, 15, 7);
  139. P2(local.E, local.A, local.B, local.C, local.D, 9, 15, 8, 12);
  140. P2(local.D, local.E, local.A, local.B, local.C, 5, 9, 12, 7);
  141. P2(local.C, local.D, local.E, local.A, local.B, 2, 11, 4, 6);
  142. P2(local.B, local.C, local.D, local.E, local.A, 14, 7, 9, 15);
  143. P2(local.A, local.B, local.C, local.D, local.E, 11, 13, 1, 13);
  144. P2(local.E, local.A, local.B, local.C, local.D, 8, 12, 2, 11);
  145. #undef F
  146. #undef K
  147. #undef Fp
  148. #undef Kp
  149. #define F F3
  150. #define K 0x6ED9EBA1
  151. #define Fp F3
  152. #define Kp 0x6D703EF3
  153. P2(local.D, local.E, local.A, local.B, local.C, 3, 11, 15, 9);
  154. P2(local.C, local.D, local.E, local.A, local.B, 10, 13, 5, 7);
  155. P2(local.B, local.C, local.D, local.E, local.A, 14, 6, 1, 15);
  156. P2(local.A, local.B, local.C, local.D, local.E, 4, 7, 3, 11);
  157. P2(local.E, local.A, local.B, local.C, local.D, 9, 14, 7, 8);
  158. P2(local.D, local.E, local.A, local.B, local.C, 15, 9, 14, 6);
  159. P2(local.C, local.D, local.E, local.A, local.B, 8, 13, 6, 6);
  160. P2(local.B, local.C, local.D, local.E, local.A, 1, 15, 9, 14);
  161. P2(local.A, local.B, local.C, local.D, local.E, 2, 14, 11, 12);
  162. P2(local.E, local.A, local.B, local.C, local.D, 7, 8, 8, 13);
  163. P2(local.D, local.E, local.A, local.B, local.C, 0, 13, 12, 5);
  164. P2(local.C, local.D, local.E, local.A, local.B, 6, 6, 2, 14);
  165. P2(local.B, local.C, local.D, local.E, local.A, 13, 5, 10, 13);
  166. P2(local.A, local.B, local.C, local.D, local.E, 11, 12, 0, 13);
  167. P2(local.E, local.A, local.B, local.C, local.D, 5, 7, 4, 7);
  168. P2(local.D, local.E, local.A, local.B, local.C, 12, 5, 13, 5);
  169. #undef F
  170. #undef K
  171. #undef Fp
  172. #undef Kp
  173. #define F F4
  174. #define K 0x8F1BBCDC
  175. #define Fp F2
  176. #define Kp 0x7A6D76E9
  177. P2(local.C, local.D, local.E, local.A, local.B, 1, 11, 8, 15);
  178. P2(local.B, local.C, local.D, local.E, local.A, 9, 12, 6, 5);
  179. P2(local.A, local.B, local.C, local.D, local.E, 11, 14, 4, 8);
  180. P2(local.E, local.A, local.B, local.C, local.D, 10, 15, 1, 11);
  181. P2(local.D, local.E, local.A, local.B, local.C, 0, 14, 3, 14);
  182. P2(local.C, local.D, local.E, local.A, local.B, 8, 15, 11, 14);
  183. P2(local.B, local.C, local.D, local.E, local.A, 12, 9, 15, 6);
  184. P2(local.A, local.B, local.C, local.D, local.E, 4, 8, 0, 14);
  185. P2(local.E, local.A, local.B, local.C, local.D, 13, 9, 5, 6);
  186. P2(local.D, local.E, local.A, local.B, local.C, 3, 14, 12, 9);
  187. P2(local.C, local.D, local.E, local.A, local.B, 7, 5, 2, 12);
  188. P2(local.B, local.C, local.D, local.E, local.A, 15, 6, 13, 9);
  189. P2(local.A, local.B, local.C, local.D, local.E, 14, 8, 9, 12);
  190. P2(local.E, local.A, local.B, local.C, local.D, 5, 6, 7, 5);
  191. P2(local.D, local.E, local.A, local.B, local.C, 6, 5, 10, 15);
  192. P2(local.C, local.D, local.E, local.A, local.B, 2, 12, 14, 8);
  193. #undef F
  194. #undef K
  195. #undef Fp
  196. #undef Kp
  197. #define F F5
  198. #define K 0xA953FD4E
  199. #define Fp F1
  200. #define Kp 0x00000000
  201. P2(local.B, local.C, local.D, local.E, local.A, 4, 9, 12, 8);
  202. P2(local.A, local.B, local.C, local.D, local.E, 0, 15, 15, 5);
  203. P2(local.E, local.A, local.B, local.C, local.D, 5, 5, 10, 12);
  204. P2(local.D, local.E, local.A, local.B, local.C, 9, 11, 4, 9);
  205. P2(local.C, local.D, local.E, local.A, local.B, 7, 6, 1, 12);
  206. P2(local.B, local.C, local.D, local.E, local.A, 12, 8, 5, 5);
  207. P2(local.A, local.B, local.C, local.D, local.E, 2, 13, 8, 14);
  208. P2(local.E, local.A, local.B, local.C, local.D, 10, 12, 7, 6);
  209. P2(local.D, local.E, local.A, local.B, local.C, 14, 5, 6, 8);
  210. P2(local.C, local.D, local.E, local.A, local.B, 1, 12, 2, 13);
  211. P2(local.B, local.C, local.D, local.E, local.A, 3, 13, 13, 6);
  212. P2(local.A, local.B, local.C, local.D, local.E, 8, 14, 14, 5);
  213. P2(local.E, local.A, local.B, local.C, local.D, 11, 11, 0, 15);
  214. P2(local.D, local.E, local.A, local.B, local.C, 6, 8, 3, 13);
  215. P2(local.C, local.D, local.E, local.A, local.B, 15, 5, 9, 11);
  216. P2(local.B, local.C, local.D, local.E, local.A, 13, 6, 11, 11);
  217. #undef F
  218. #undef K
  219. #undef Fp
  220. #undef Kp
  221. local.C = ctx->state[1] + local.C + local.Dp;
  222. ctx->state[1] = ctx->state[2] + local.D + local.Ep;
  223. ctx->state[2] = ctx->state[3] + local.E + local.Ap;
  224. ctx->state[3] = ctx->state[4] + local.A + local.Bp;
  225. ctx->state[4] = ctx->state[0] + local.B + local.Cp;
  226. ctx->state[0] = local.C;
  227. /* Zeroise variables to clear sensitive data from memory. */
  228. mbedtls_platform_zeroize(&local, sizeof(local));
  229. return 0;
  230. }
  231. #endif /* !MBEDTLS_RIPEMD160_PROCESS_ALT */
  232. /*
  233. * RIPEMD-160 process buffer
  234. */
  235. int mbedtls_ripemd160_update(mbedtls_ripemd160_context *ctx,
  236. const unsigned char *input,
  237. size_t ilen)
  238. {
  239. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  240. size_t fill;
  241. uint32_t left;
  242. if (ilen == 0) {
  243. return 0;
  244. }
  245. left = ctx->total[0] & 0x3F;
  246. fill = 64 - left;
  247. ctx->total[0] += (uint32_t) ilen;
  248. ctx->total[0] &= 0xFFFFFFFF;
  249. if (ctx->total[0] < (uint32_t) ilen) {
  250. ctx->total[1]++;
  251. }
  252. if (left && ilen >= fill) {
  253. memcpy((void *) (ctx->buffer + left), input, fill);
  254. if ((ret = mbedtls_internal_ripemd160_process(ctx, ctx->buffer)) != 0) {
  255. return ret;
  256. }
  257. input += fill;
  258. ilen -= fill;
  259. left = 0;
  260. }
  261. while (ilen >= 64) {
  262. if ((ret = mbedtls_internal_ripemd160_process(ctx, input)) != 0) {
  263. return ret;
  264. }
  265. input += 64;
  266. ilen -= 64;
  267. }
  268. if (ilen > 0) {
  269. memcpy((void *) (ctx->buffer + left), input, ilen);
  270. }
  271. return 0;
  272. }
  273. static const unsigned char ripemd160_padding[64] =
  274. {
  275. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  276. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  277. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  278. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  279. };
  280. /*
  281. * RIPEMD-160 final digest
  282. */
  283. int mbedtls_ripemd160_finish(mbedtls_ripemd160_context *ctx,
  284. unsigned char output[20])
  285. {
  286. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  287. uint32_t last, padn;
  288. uint32_t high, low;
  289. unsigned char msglen[8];
  290. high = (ctx->total[0] >> 29)
  291. | (ctx->total[1] << 3);
  292. low = (ctx->total[0] << 3);
  293. MBEDTLS_PUT_UINT32_LE(low, msglen, 0);
  294. MBEDTLS_PUT_UINT32_LE(high, msglen, 4);
  295. last = ctx->total[0] & 0x3F;
  296. padn = (last < 56) ? (56 - last) : (120 - last);
  297. ret = mbedtls_ripemd160_update(ctx, ripemd160_padding, padn);
  298. if (ret != 0) {
  299. goto exit;
  300. }
  301. ret = mbedtls_ripemd160_update(ctx, msglen, 8);
  302. if (ret != 0) {
  303. goto exit;
  304. }
  305. MBEDTLS_PUT_UINT32_LE(ctx->state[0], output, 0);
  306. MBEDTLS_PUT_UINT32_LE(ctx->state[1], output, 4);
  307. MBEDTLS_PUT_UINT32_LE(ctx->state[2], output, 8);
  308. MBEDTLS_PUT_UINT32_LE(ctx->state[3], output, 12);
  309. MBEDTLS_PUT_UINT32_LE(ctx->state[4], output, 16);
  310. ret = 0;
  311. exit:
  312. mbedtls_ripemd160_free(ctx);
  313. return ret;
  314. }
  315. #endif /* ! MBEDTLS_RIPEMD160_ALT */
  316. /*
  317. * output = RIPEMD-160( input buffer )
  318. */
  319. int mbedtls_ripemd160(const unsigned char *input,
  320. size_t ilen,
  321. unsigned char output[20])
  322. {
  323. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  324. mbedtls_ripemd160_context ctx;
  325. mbedtls_ripemd160_init(&ctx);
  326. if ((ret = mbedtls_ripemd160_starts(&ctx)) != 0) {
  327. goto exit;
  328. }
  329. if ((ret = mbedtls_ripemd160_update(&ctx, input, ilen)) != 0) {
  330. goto exit;
  331. }
  332. if ((ret = mbedtls_ripemd160_finish(&ctx, output)) != 0) {
  333. goto exit;
  334. }
  335. exit:
  336. mbedtls_ripemd160_free(&ctx);
  337. return ret;
  338. }
  339. #if defined(MBEDTLS_SELF_TEST)
  340. /*
  341. * Test vectors from the RIPEMD-160 paper and
  342. * http://homes.esat.kuleuven.be/~bosselae/mbedtls_ripemd160.html#HMAC
  343. */
  344. #define TESTS 8
  345. static const unsigned char ripemd160_test_str[TESTS][81] =
  346. {
  347. { "" },
  348. { "a" },
  349. { "abc" },
  350. { "message digest" },
  351. { "abcdefghijklmnopqrstuvwxyz" },
  352. { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
  353. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  354. { "12345678901234567890123456789012345678901234567890123456789012345678901234567890" },
  355. };
  356. static const size_t ripemd160_test_strlen[TESTS] =
  357. {
  358. 0, 1, 3, 14, 26, 56, 62, 80
  359. };
  360. static const unsigned char ripemd160_test_md[TESTS][20] =
  361. {
  362. { 0x9c, 0x11, 0x85, 0xa5, 0xc5, 0xe9, 0xfc, 0x54, 0x61, 0x28,
  363. 0x08, 0x97, 0x7e, 0xe8, 0xf5, 0x48, 0xb2, 0x25, 0x8d, 0x31 },
  364. { 0x0b, 0xdc, 0x9d, 0x2d, 0x25, 0x6b, 0x3e, 0xe9, 0xda, 0xae,
  365. 0x34, 0x7b, 0xe6, 0xf4, 0xdc, 0x83, 0x5a, 0x46, 0x7f, 0xfe },
  366. { 0x8e, 0xb2, 0x08, 0xf7, 0xe0, 0x5d, 0x98, 0x7a, 0x9b, 0x04,
  367. 0x4a, 0x8e, 0x98, 0xc6, 0xb0, 0x87, 0xf1, 0x5a, 0x0b, 0xfc },
  368. { 0x5d, 0x06, 0x89, 0xef, 0x49, 0xd2, 0xfa, 0xe5, 0x72, 0xb8,
  369. 0x81, 0xb1, 0x23, 0xa8, 0x5f, 0xfa, 0x21, 0x59, 0x5f, 0x36 },
  370. { 0xf7, 0x1c, 0x27, 0x10, 0x9c, 0x69, 0x2c, 0x1b, 0x56, 0xbb,
  371. 0xdc, 0xeb, 0x5b, 0x9d, 0x28, 0x65, 0xb3, 0x70, 0x8d, 0xbc },
  372. { 0x12, 0xa0, 0x53, 0x38, 0x4a, 0x9c, 0x0c, 0x88, 0xe4, 0x05,
  373. 0xa0, 0x6c, 0x27, 0xdc, 0xf4, 0x9a, 0xda, 0x62, 0xeb, 0x2b },
  374. { 0xb0, 0xe2, 0x0b, 0x6e, 0x31, 0x16, 0x64, 0x02, 0x86, 0xed,
  375. 0x3a, 0x87, 0xa5, 0x71, 0x30, 0x79, 0xb2, 0x1f, 0x51, 0x89 },
  376. { 0x9b, 0x75, 0x2e, 0x45, 0x57, 0x3d, 0x4b, 0x39, 0xf4, 0xdb,
  377. 0xd3, 0x32, 0x3c, 0xab, 0x82, 0xbf, 0x63, 0x32, 0x6b, 0xfb },
  378. };
  379. /*
  380. * Checkup routine
  381. */
  382. int mbedtls_ripemd160_self_test(int verbose)
  383. {
  384. int i, ret = 0;
  385. unsigned char output[20];
  386. memset(output, 0, sizeof(output));
  387. for (i = 0; i < TESTS; i++) {
  388. if (verbose != 0) {
  389. mbedtls_printf(" RIPEMD-160 test #%d: ", i + 1);
  390. }
  391. ret = mbedtls_ripemd160(ripemd160_test_str[i],
  392. ripemd160_test_strlen[i], output);
  393. if (ret != 0) {
  394. goto fail;
  395. }
  396. if (memcmp(output, ripemd160_test_md[i], 20) != 0) {
  397. ret = 1;
  398. goto fail;
  399. }
  400. if (verbose != 0) {
  401. mbedtls_printf("passed\n");
  402. }
  403. }
  404. if (verbose != 0) {
  405. mbedtls_printf("\n");
  406. }
  407. return 0;
  408. fail:
  409. if (verbose != 0) {
  410. mbedtls_printf("failed\n");
  411. }
  412. return ret;
  413. }
  414. #endif /* MBEDTLS_SELF_TEST */
  415. #endif /* MBEDTLS_RIPEMD160_C */