ripemd160.c 17 KB

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