ripemd160.c 18 KB

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