blake2s-generic.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115
  1. // SPDX-License-Identifier: GPL-2.0 OR MIT
  2. /*
  3. * Copyright (C) 2015-2019 Jason A. Donenfeld <[email protected]>. All Rights Reserved.
  4. *
  5. * This is an implementation of the BLAKE2s hash and PRF functions.
  6. *
  7. * Information: https://blake2.net/
  8. *
  9. */
  10. #include <crypto/internal/blake2s.h>
  11. #include <linux/types.h>
  12. #include <linux/string.h>
  13. #include <linux/kernel.h>
  14. #include <linux/module.h>
  15. #include <linux/init.h>
  16. #include <linux/bug.h>
  17. #include <asm/unaligned.h>
  18. static const u8 blake2s_sigma[10][16] = {
  19. { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
  20. { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
  21. { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
  22. { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
  23. { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
  24. { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
  25. { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
  26. { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
  27. { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
  28. { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
  29. };
  30. static inline void blake2s_increment_counter(struct blake2s_state *state,
  31. const u32 inc)
  32. {
  33. state->t[0] += inc;
  34. state->t[1] += (state->t[0] < inc);
  35. }
  36. void blake2s_compress(struct blake2s_state *state, const u8 *block,
  37. size_t nblocks, const u32 inc)
  38. __weak __alias(blake2s_compress_generic);
  39. void blake2s_compress_generic(struct blake2s_state *state, const u8 *block,
  40. size_t nblocks, const u32 inc)
  41. {
  42. u32 m[16];
  43. u32 v[16];
  44. int i;
  45. WARN_ON(IS_ENABLED(DEBUG) &&
  46. (nblocks > 1 && inc != BLAKE2S_BLOCK_SIZE));
  47. while (nblocks > 0) {
  48. blake2s_increment_counter(state, inc);
  49. memcpy(m, block, BLAKE2S_BLOCK_SIZE);
  50. le32_to_cpu_array(m, ARRAY_SIZE(m));
  51. memcpy(v, state->h, 32);
  52. v[ 8] = BLAKE2S_IV0;
  53. v[ 9] = BLAKE2S_IV1;
  54. v[10] = BLAKE2S_IV2;
  55. v[11] = BLAKE2S_IV3;
  56. v[12] = BLAKE2S_IV4 ^ state->t[0];
  57. v[13] = BLAKE2S_IV5 ^ state->t[1];
  58. v[14] = BLAKE2S_IV6 ^ state->f[0];
  59. v[15] = BLAKE2S_IV7 ^ state->f[1];
  60. #define G(r, i, a, b, c, d) do { \
  61. a += b + m[blake2s_sigma[r][2 * i + 0]]; \
  62. d = ror32(d ^ a, 16); \
  63. c += d; \
  64. b = ror32(b ^ c, 12); \
  65. a += b + m[blake2s_sigma[r][2 * i + 1]]; \
  66. d = ror32(d ^ a, 8); \
  67. c += d; \
  68. b = ror32(b ^ c, 7); \
  69. } while (0)
  70. #define ROUND(r) do { \
  71. G(r, 0, v[0], v[ 4], v[ 8], v[12]); \
  72. G(r, 1, v[1], v[ 5], v[ 9], v[13]); \
  73. G(r, 2, v[2], v[ 6], v[10], v[14]); \
  74. G(r, 3, v[3], v[ 7], v[11], v[15]); \
  75. G(r, 4, v[0], v[ 5], v[10], v[15]); \
  76. G(r, 5, v[1], v[ 6], v[11], v[12]); \
  77. G(r, 6, v[2], v[ 7], v[ 8], v[13]); \
  78. G(r, 7, v[3], v[ 4], v[ 9], v[14]); \
  79. } while (0)
  80. ROUND(0);
  81. ROUND(1);
  82. ROUND(2);
  83. ROUND(3);
  84. ROUND(4);
  85. ROUND(5);
  86. ROUND(6);
  87. ROUND(7);
  88. ROUND(8);
  89. ROUND(9);
  90. #undef G
  91. #undef ROUND
  92. for (i = 0; i < 8; ++i)
  93. state->h[i] ^= v[i] ^ v[i + 8];
  94. block += BLAKE2S_BLOCK_SIZE;
  95. --nblocks;
  96. }
  97. }
  98. EXPORT_SYMBOL(blake2s_compress_generic);
  99. MODULE_LICENSE("GPL v2");
  100. MODULE_DESCRIPTION("BLAKE2s hash function");
  101. MODULE_AUTHOR("Jason A. Donenfeld <[email protected]>");