ripemd160.c 19 KB

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