ripemd160.c 20 KB

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