ripemd160.c 14 KB

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