ripemd160.c 16 KB

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