blob: 8aa4ee352ad58aa4669becd0db695d17ee21e0c9 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -07002 * SHA1 routine optimized to do word accesses rather than byte accesses,
3 * and to avoid unnecessary copies into the context array.
4 *
5 * This was based on the git SHA1 implementation.
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 */
7
8#include <linux/kernel.h>
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -05009#include <linux/export.h>
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070010#include <linux/bitops.h>
H Hartley Sweeten003f6c92011-09-09 11:30:27 -070011#include <linux/cryptohash.h>
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +010012#include <linux/string.h>
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070013#include <asm/unaligned.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070014
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070015/*
16 * If you have 32 registers or more, the compiler can (and should)
17 * try to change the array[] accesses into registers. However, on
18 * machines with less than ~25 registers, that won't really work,
19 * and at least gcc will make an unholy mess of it.
20 *
21 * So to avoid that mess which just slows things down, we force
22 * the stores to memory to actually happen (we might be better off
23 * with a 'W(t)=(val);asm("":"+m" (W(t))' there instead, as
24 * suggested by Artur Skawina - that will also make gcc unable to
25 * try to do the silly "optimize away loads" part because it won't
26 * see what the value will be).
27 *
28 * Ben Herrenschmidt reports that on PPC, the C version comes close
29 * to the optimized asm with this (ie on PPC you don't want that
30 * 'volatile', since there are lots of registers).
31 *
32 * On ARM we get the best code generation by forcing a full memory barrier
33 * between each SHA_ROUND, otherwise gcc happily get wild with spilling and
34 * the stack frame size simply explode and performance goes down the drain.
35 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070037#ifdef CONFIG_X86
38 #define setW(x, val) (*(volatile __u32 *)&W(x) = (val))
39#elif defined(CONFIG_ARM)
40 #define setW(x, val) do { W(x) = (val); __asm__("":::"memory"); } while (0)
41#else
42 #define setW(x, val) (W(x) = (val))
43#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070044
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070045/* This "rolls" over the 512-bit array */
46#define W(x) (array[(x)&15])
Linus Torvalds1da177e2005-04-16 15:20:36 -070047
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070048/*
49 * Where do we get the source from? The first 16 iterations get it from
50 * the input data, the next mix it from the 512-bit array.
51 */
52#define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t)
53#define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1)
54
55#define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \
56 __u32 TEMP = input(t); setW(t, TEMP); \
57 E += TEMP + rol32(A,5) + (fn) + (constant); \
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +010058 B = ror32(B, 2); \
59 TEMP = E; E = D; D = C; C = B; B = A; A = TEMP; } while (0)
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070060
61#define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E )
62#define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E )
63#define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E )
64#define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D, E )
65#define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E )
Linus Torvalds1da177e2005-04-16 15:20:36 -070066
Robert P. J. Day72fd4a32007-02-10 01:45:59 -080067/**
68 * sha_transform - single block SHA1 transform
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 *
70 * @digest: 160 bit digest to update
71 * @data: 512 bits of data to hash
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070072 * @array: 16 words of workspace (see note)
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 *
74 * This function generates a SHA1 digest for a single 512-bit block.
75 * Be warned, it does not handle padding and message digest, do not
76 * confuse it with the full FIPS 180-1 digest algorithm for variable
77 * length messages.
78 *
79 * Note: If the hash is security sensitive, the caller should be sure
80 * to clear the workspace. This is left to the caller to avoid
81 * unnecessary clears between chained hashing operations.
82 */
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070083void sha_transform(__u32 *digest, const char *data, __u32 *array)
Linus Torvalds1da177e2005-04-16 15:20:36 -070084{
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070085 __u32 A, B, C, D, E;
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +010086 unsigned int i = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070087
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070088 A = digest[0];
89 B = digest[1];
90 C = digest[2];
91 D = digest[3];
92 E = digest[4];
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070094 /* Round 1 - iterations 0-16 take their input from 'data' */
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +010095 for (; i < 16; ++i)
96 T_0_15(i, A, B, C, D, E);
Linus Torvalds1da177e2005-04-16 15:20:36 -070097
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -070098 /* Round 1 - tail. Input from 512-bit mixing array */
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +010099 for (; i < 20; ++i)
100 T_16_19(i, A, B, C, D, E);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -0700102 /* Round 2 */
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +0100103 for (; i < 40; ++i)
104 T_20_39(i, A, B, C, D, E);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -0700106 /* Round 3 */
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +0100107 for (; i < 60; ++i)
108 T_40_59(i, A, B, C, D, E);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -0700110 /* Round 4 */
Jason A. Donenfeld79dd56c2022-01-11 18:58:43 +0100111 for (; i < 80; ++i)
112 T_60_79(i, A, B, C, D, E);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
Mandeep Singh Baines1eb19a12011-08-05 18:46:27 -0700114 digest[0] += A;
115 digest[1] += B;
116 digest[2] += C;
117 digest[3] += D;
118 digest[4] += E;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119}
120EXPORT_SYMBOL(sha_transform);
121
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800122/**
123 * sha_init - initialize the vectors for a SHA1 digest
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 * @buf: vector to initialize
125 */
126void sha_init(__u32 *buf)
127{
128 buf[0] = 0x67452301;
129 buf[1] = 0xefcdab89;
130 buf[2] = 0x98badcfe;
131 buf[3] = 0x10325476;
132 buf[4] = 0xc3d2e1f0;
133}
Hannes Frederic Sowaab2bb322015-03-23 23:35:59 +0100134EXPORT_SYMBOL(sha_init);