ripemd160.c 13 KB

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