sm3.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  1. /* SPDX-License-Identifier: GPL-2.0-only */
  2. /*
  3. * SM3 secure hash, as specified by OSCCA GM/T 0004-2012 SM3 and described
  4. * at https://datatracker.ietf.org/doc/html/draft-sca-cfrg-sm3-02
  5. *
  6. * Copyright (C) 2017 ARM Limited or its affiliates.
  7. * Copyright (C) 2017 Gilad Ben-Yossef <[email protected]>
  8. * Copyright (C) 2021 Tianjia Zhang <[email protected]>
  9. */
  10. #include <linux/module.h>
  11. #include <asm/unaligned.h>
  12. #include <crypto/sm3.h>
  13. static const u32 ____cacheline_aligned K[64] = {
  14. 0x79cc4519, 0xf3988a32, 0xe7311465, 0xce6228cb,
  15. 0x9cc45197, 0x3988a32f, 0x7311465e, 0xe6228cbc,
  16. 0xcc451979, 0x988a32f3, 0x311465e7, 0x6228cbce,
  17. 0xc451979c, 0x88a32f39, 0x11465e73, 0x228cbce6,
  18. 0x9d8a7a87, 0x3b14f50f, 0x7629ea1e, 0xec53d43c,
  19. 0xd8a7a879, 0xb14f50f3, 0x629ea1e7, 0xc53d43ce,
  20. 0x8a7a879d, 0x14f50f3b, 0x29ea1e76, 0x53d43cec,
  21. 0xa7a879d8, 0x4f50f3b1, 0x9ea1e762, 0x3d43cec5,
  22. 0x7a879d8a, 0xf50f3b14, 0xea1e7629, 0xd43cec53,
  23. 0xa879d8a7, 0x50f3b14f, 0xa1e7629e, 0x43cec53d,
  24. 0x879d8a7a, 0x0f3b14f5, 0x1e7629ea, 0x3cec53d4,
  25. 0x79d8a7a8, 0xf3b14f50, 0xe7629ea1, 0xcec53d43,
  26. 0x9d8a7a87, 0x3b14f50f, 0x7629ea1e, 0xec53d43c,
  27. 0xd8a7a879, 0xb14f50f3, 0x629ea1e7, 0xc53d43ce,
  28. 0x8a7a879d, 0x14f50f3b, 0x29ea1e76, 0x53d43cec,
  29. 0xa7a879d8, 0x4f50f3b1, 0x9ea1e762, 0x3d43cec5
  30. };
  31. /*
  32. * Transform the message X which consists of 16 32-bit-words. See
  33. * GM/T 004-2012 for details.
  34. */
  35. #define R(i, a, b, c, d, e, f, g, h, t, w1, w2) \
  36. do { \
  37. ss1 = rol32((rol32((a), 12) + (e) + (t)), 7); \
  38. ss2 = ss1 ^ rol32((a), 12); \
  39. d += FF ## i(a, b, c) + ss2 + ((w1) ^ (w2)); \
  40. h += GG ## i(e, f, g) + ss1 + (w1); \
  41. b = rol32((b), 9); \
  42. f = rol32((f), 19); \
  43. h = P0((h)); \
  44. } while (0)
  45. #define R1(a, b, c, d, e, f, g, h, t, w1, w2) \
  46. R(1, a, b, c, d, e, f, g, h, t, w1, w2)
  47. #define R2(a, b, c, d, e, f, g, h, t, w1, w2) \
  48. R(2, a, b, c, d, e, f, g, h, t, w1, w2)
  49. #define FF1(x, y, z) (x ^ y ^ z)
  50. #define FF2(x, y, z) ((x & y) | (x & z) | (y & z))
  51. #define GG1(x, y, z) FF1(x, y, z)
  52. #define GG2(x, y, z) ((x & y) | (~x & z))
  53. /* Message expansion */
  54. #define P0(x) ((x) ^ rol32((x), 9) ^ rol32((x), 17))
  55. #define P1(x) ((x) ^ rol32((x), 15) ^ rol32((x), 23))
  56. #define I(i) (W[i] = get_unaligned_be32(data + i * 4))
  57. #define W1(i) (W[i & 0x0f])
  58. #define W2(i) (W[i & 0x0f] = \
  59. P1(W[i & 0x0f] \
  60. ^ W[(i-9) & 0x0f] \
  61. ^ rol32(W[(i-3) & 0x0f], 15)) \
  62. ^ rol32(W[(i-13) & 0x0f], 7) \
  63. ^ W[(i-6) & 0x0f])
  64. static void sm3_transform(struct sm3_state *sctx, u8 const *data, u32 W[16])
  65. {
  66. u32 a, b, c, d, e, f, g, h, ss1, ss2;
  67. a = sctx->state[0];
  68. b = sctx->state[1];
  69. c = sctx->state[2];
  70. d = sctx->state[3];
  71. e = sctx->state[4];
  72. f = sctx->state[5];
  73. g = sctx->state[6];
  74. h = sctx->state[7];
  75. R1(a, b, c, d, e, f, g, h, K[0], I(0), I(4));
  76. R1(d, a, b, c, h, e, f, g, K[1], I(1), I(5));
  77. R1(c, d, a, b, g, h, e, f, K[2], I(2), I(6));
  78. R1(b, c, d, a, f, g, h, e, K[3], I(3), I(7));
  79. R1(a, b, c, d, e, f, g, h, K[4], W1(4), I(8));
  80. R1(d, a, b, c, h, e, f, g, K[5], W1(5), I(9));
  81. R1(c, d, a, b, g, h, e, f, K[6], W1(6), I(10));
  82. R1(b, c, d, a, f, g, h, e, K[7], W1(7), I(11));
  83. R1(a, b, c, d, e, f, g, h, K[8], W1(8), I(12));
  84. R1(d, a, b, c, h, e, f, g, K[9], W1(9), I(13));
  85. R1(c, d, a, b, g, h, e, f, K[10], W1(10), I(14));
  86. R1(b, c, d, a, f, g, h, e, K[11], W1(11), I(15));
  87. R1(a, b, c, d, e, f, g, h, K[12], W1(12), W2(16));
  88. R1(d, a, b, c, h, e, f, g, K[13], W1(13), W2(17));
  89. R1(c, d, a, b, g, h, e, f, K[14], W1(14), W2(18));
  90. R1(b, c, d, a, f, g, h, e, K[15], W1(15), W2(19));
  91. R2(a, b, c, d, e, f, g, h, K[16], W1(16), W2(20));
  92. R2(d, a, b, c, h, e, f, g, K[17], W1(17), W2(21));
  93. R2(c, d, a, b, g, h, e, f, K[18], W1(18), W2(22));
  94. R2(b, c, d, a, f, g, h, e, K[19], W1(19), W2(23));
  95. R2(a, b, c, d, e, f, g, h, K[20], W1(20), W2(24));
  96. R2(d, a, b, c, h, e, f, g, K[21], W1(21), W2(25));
  97. R2(c, d, a, b, g, h, e, f, K[22], W1(22), W2(26));
  98. R2(b, c, d, a, f, g, h, e, K[23], W1(23), W2(27));
  99. R2(a, b, c, d, e, f, g, h, K[24], W1(24), W2(28));
  100. R2(d, a, b, c, h, e, f, g, K[25], W1(25), W2(29));
  101. R2(c, d, a, b, g, h, e, f, K[26], W1(26), W2(30));
  102. R2(b, c, d, a, f, g, h, e, K[27], W1(27), W2(31));
  103. R2(a, b, c, d, e, f, g, h, K[28], W1(28), W2(32));
  104. R2(d, a, b, c, h, e, f, g, K[29], W1(29), W2(33));
  105. R2(c, d, a, b, g, h, e, f, K[30], W1(30), W2(34));
  106. R2(b, c, d, a, f, g, h, e, K[31], W1(31), W2(35));
  107. R2(a, b, c, d, e, f, g, h, K[32], W1(32), W2(36));
  108. R2(d, a, b, c, h, e, f, g, K[33], W1(33), W2(37));
  109. R2(c, d, a, b, g, h, e, f, K[34], W1(34), W2(38));
  110. R2(b, c, d, a, f, g, h, e, K[35], W1(35), W2(39));
  111. R2(a, b, c, d, e, f, g, h, K[36], W1(36), W2(40));
  112. R2(d, a, b, c, h, e, f, g, K[37], W1(37), W2(41));
  113. R2(c, d, a, b, g, h, e, f, K[38], W1(38), W2(42));
  114. R2(b, c, d, a, f, g, h, e, K[39], W1(39), W2(43));
  115. R2(a, b, c, d, e, f, g, h, K[40], W1(40), W2(44));
  116. R2(d, a, b, c, h, e, f, g, K[41], W1(41), W2(45));
  117. R2(c, d, a, b, g, h, e, f, K[42], W1(42), W2(46));
  118. R2(b, c, d, a, f, g, h, e, K[43], W1(43), W2(47));
  119. R2(a, b, c, d, e, f, g, h, K[44], W1(44), W2(48));
  120. R2(d, a, b, c, h, e, f, g, K[45], W1(45), W2(49));
  121. R2(c, d, a, b, g, h, e, f, K[46], W1(46), W2(50));
  122. R2(b, c, d, a, f, g, h, e, K[47], W1(47), W2(51));
  123. R2(a, b, c, d, e, f, g, h, K[48], W1(48), W2(52));
  124. R2(d, a, b, c, h, e, f, g, K[49], W1(49), W2(53));
  125. R2(c, d, a, b, g, h, e, f, K[50], W1(50), W2(54));
  126. R2(b, c, d, a, f, g, h, e, K[51], W1(51), W2(55));
  127. R2(a, b, c, d, e, f, g, h, K[52], W1(52), W2(56));
  128. R2(d, a, b, c, h, e, f, g, K[53], W1(53), W2(57));
  129. R2(c, d, a, b, g, h, e, f, K[54], W1(54), W2(58));
  130. R2(b, c, d, a, f, g, h, e, K[55], W1(55), W2(59));
  131. R2(a, b, c, d, e, f, g, h, K[56], W1(56), W2(60));
  132. R2(d, a, b, c, h, e, f, g, K[57], W1(57), W2(61));
  133. R2(c, d, a, b, g, h, e, f, K[58], W1(58), W2(62));
  134. R2(b, c, d, a, f, g, h, e, K[59], W1(59), W2(63));
  135. R2(a, b, c, d, e, f, g, h, K[60], W1(60), W2(64));
  136. R2(d, a, b, c, h, e, f, g, K[61], W1(61), W2(65));
  137. R2(c, d, a, b, g, h, e, f, K[62], W1(62), W2(66));
  138. R2(b, c, d, a, f, g, h, e, K[63], W1(63), W2(67));
  139. sctx->state[0] ^= a;
  140. sctx->state[1] ^= b;
  141. sctx->state[2] ^= c;
  142. sctx->state[3] ^= d;
  143. sctx->state[4] ^= e;
  144. sctx->state[5] ^= f;
  145. sctx->state[6] ^= g;
  146. sctx->state[7] ^= h;
  147. }
  148. #undef R
  149. #undef R1
  150. #undef R2
  151. #undef I
  152. #undef W1
  153. #undef W2
  154. static inline void sm3_block(struct sm3_state *sctx,
  155. u8 const *data, int blocks, u32 W[16])
  156. {
  157. while (blocks--) {
  158. sm3_transform(sctx, data, W);
  159. data += SM3_BLOCK_SIZE;
  160. }
  161. }
  162. void sm3_update(struct sm3_state *sctx, const u8 *data, unsigned int len)
  163. {
  164. unsigned int partial = sctx->count % SM3_BLOCK_SIZE;
  165. u32 W[16];
  166. sctx->count += len;
  167. if ((partial + len) >= SM3_BLOCK_SIZE) {
  168. int blocks;
  169. if (partial) {
  170. int p = SM3_BLOCK_SIZE - partial;
  171. memcpy(sctx->buffer + partial, data, p);
  172. data += p;
  173. len -= p;
  174. sm3_block(sctx, sctx->buffer, 1, W);
  175. }
  176. blocks = len / SM3_BLOCK_SIZE;
  177. len %= SM3_BLOCK_SIZE;
  178. if (blocks) {
  179. sm3_block(sctx, data, blocks, W);
  180. data += blocks * SM3_BLOCK_SIZE;
  181. }
  182. memzero_explicit(W, sizeof(W));
  183. partial = 0;
  184. }
  185. if (len)
  186. memcpy(sctx->buffer + partial, data, len);
  187. }
  188. EXPORT_SYMBOL_GPL(sm3_update);
  189. void sm3_final(struct sm3_state *sctx, u8 *out)
  190. {
  191. const int bit_offset = SM3_BLOCK_SIZE - sizeof(u64);
  192. __be64 *bits = (__be64 *)(sctx->buffer + bit_offset);
  193. __be32 *digest = (__be32 *)out;
  194. unsigned int partial = sctx->count % SM3_BLOCK_SIZE;
  195. u32 W[16];
  196. int i;
  197. sctx->buffer[partial++] = 0x80;
  198. if (partial > bit_offset) {
  199. memset(sctx->buffer + partial, 0, SM3_BLOCK_SIZE - partial);
  200. partial = 0;
  201. sm3_block(sctx, sctx->buffer, 1, W);
  202. }
  203. memset(sctx->buffer + partial, 0, bit_offset - partial);
  204. *bits = cpu_to_be64(sctx->count << 3);
  205. sm3_block(sctx, sctx->buffer, 1, W);
  206. for (i = 0; i < 8; i++)
  207. put_unaligned_be32(sctx->state[i], digest++);
  208. /* Zeroize sensitive information. */
  209. memzero_explicit(W, sizeof(W));
  210. memzero_explicit(sctx, sizeof(*sctx));
  211. }
  212. EXPORT_SYMBOL_GPL(sm3_final);
  213. MODULE_DESCRIPTION("Generic SM3 library");
  214. MODULE_LICENSE("GPL v2");