diff options
author | Alexey Dobriyan <adobriyan@gmail.com> | 2012-01-14 13:40:57 -0500 |
---|---|---|
committer | Herbert Xu <herbert@gondor.apana.org.au> | 2012-01-14 20:39:17 -0500 |
commit | 51fc6dc8f948047364f7d42a4ed89b416c6cc0a3 (patch) | |
tree | 4d0fb9ce98440289ace6045e08ad0a6141fe52ea /crypto/sha512_generic.c | |
parent | 84e31fdb7c797a7303e0cc295cb9bc8b73fb872d (diff) |
crypto: sha512 - reduce stack usage to safe number
For rounds 16--79, W[i] only depends on W[i - 2], W[i - 7], W[i - 15] and W[i - 16].
Consequently, keeping all W[80] array on stack is unnecessary,
only 16 values are really needed.
Using W[16] instead of W[80] greatly reduces stack usage
(~750 bytes to ~340 bytes on x86_64).
Line by line explanation:
* BLEND_OP
array is "circular" now, all indexes have to be modulo 16.
Round number is positive, so remainder operation should be
without surprises.
* initial full message scheduling is trimmed to first 16 values which
come from data block, the rest is calculated before it's needed.
* original loop body is unrolled version of new SHA512_0_15 and
SHA512_16_79 macros, unrolling was done to not do explicit variable
renaming. Otherwise it's the very same code after preprocessing.
See sha1_transform() code which does the same trick.
Patch survives in-tree crypto test and original bugreport test
(ping flood with hmac(sha512).
See FIPS 180-2 for SHA-512 definition
http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
Signed-off-by: Alexey Dobriyan <adobriyan@gmail.com>
Cc: stable@vger.kernel.org
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
Diffstat (limited to 'crypto/sha512_generic.c')
-rw-r--r-- | crypto/sha512_generic.c | 58 |
1 files changed, 34 insertions, 24 deletions
diff --git a/crypto/sha512_generic.c b/crypto/sha512_generic.c index 8b9035b0189c..88f160b77b1f 100644 --- a/crypto/sha512_generic.c +++ b/crypto/sha512_generic.c | |||
@@ -78,7 +78,7 @@ static inline void LOAD_OP(int I, u64 *W, const u8 *input) | |||
78 | 78 | ||
79 | static inline void BLEND_OP(int I, u64 *W) | 79 | static inline void BLEND_OP(int I, u64 *W) |
80 | { | 80 | { |
81 | W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16]; | 81 | W[I % 16] += s1(W[(I-2) % 16]) + W[(I-7) % 16] + s0(W[(I-15) % 16]); |
82 | } | 82 | } |
83 | 83 | ||
84 | static void | 84 | static void |
@@ -87,38 +87,48 @@ sha512_transform(u64 *state, const u8 *input) | |||
87 | u64 a, b, c, d, e, f, g, h, t1, t2; | 87 | u64 a, b, c, d, e, f, g, h, t1, t2; |
88 | 88 | ||
89 | int i; | 89 | int i; |
90 | u64 W[80]; | 90 | u64 W[16]; |
91 | 91 | ||
92 | /* load the input */ | 92 | /* load the input */ |
93 | for (i = 0; i < 16; i++) | 93 | for (i = 0; i < 16; i++) |
94 | LOAD_OP(i, W, input); | 94 | LOAD_OP(i, W, input); |
95 | 95 | ||
96 | for (i = 16; i < 80; i++) { | ||
97 | BLEND_OP(i, W); | ||
98 | } | ||
99 | |||
100 | /* load the state into our registers */ | 96 | /* load the state into our registers */ |
101 | a=state[0]; b=state[1]; c=state[2]; d=state[3]; | 97 | a=state[0]; b=state[1]; c=state[2]; d=state[3]; |
102 | e=state[4]; f=state[5]; g=state[6]; h=state[7]; | 98 | e=state[4]; f=state[5]; g=state[6]; h=state[7]; |
103 | 99 | ||
104 | /* now iterate */ | 100 | #define SHA512_0_15(i, a, b, c, d, e, f, g, h) \ |
105 | for (i=0; i<80; i+=8) { | 101 | t1 = h + e1(e) + Ch(e, f, g) + sha512_K[i] + W[i]; \ |
106 | t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[i ]; | 102 | t2 = e0(a) + Maj(a, b, c); \ |
107 | t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2; | 103 | d += t1; \ |
108 | t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[i+1]; | 104 | h = t1 + t2 |
109 | t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2; | 105 | |
110 | t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[i+2]; | 106 | #define SHA512_16_79(i, a, b, c, d, e, f, g, h) \ |
111 | t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2; | 107 | BLEND_OP(i, W); \ |
112 | t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[i+3]; | 108 | t1 = h + e1(e) + Ch(e, f, g) + sha512_K[i] + W[(i)%16]; \ |
113 | t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2; | 109 | t2 = e0(a) + Maj(a, b, c); \ |
114 | t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[i+4]; | 110 | d += t1; \ |
115 | t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2; | 111 | h = t1 + t2 |
116 | t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[i+5]; | 112 | |
117 | t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2; | 113 | for (i = 0; i < 16; i += 8) { |
118 | t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[i+6]; | 114 | SHA512_0_15(i, a, b, c, d, e, f, g, h); |
119 | t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2; | 115 | SHA512_0_15(i + 1, h, a, b, c, d, e, f, g); |
120 | t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[i+7]; | 116 | SHA512_0_15(i + 2, g, h, a, b, c, d, e, f); |
121 | t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2; | 117 | SHA512_0_15(i + 3, f, g, h, a, b, c, d, e); |
118 | SHA512_0_15(i + 4, e, f, g, h, a, b, c, d); | ||
119 | SHA512_0_15(i + 5, d, e, f, g, h, a, b, c); | ||
120 | SHA512_0_15(i + 6, c, d, e, f, g, h, a, b); | ||
121 | SHA512_0_15(i + 7, b, c, d, e, f, g, h, a); | ||
122 | } | ||
123 | for (i = 16; i < 80; i += 8) { | ||
124 | SHA512_16_79(i, a, b, c, d, e, f, g, h); | ||
125 | SHA512_16_79(i + 1, h, a, b, c, d, e, f, g); | ||
126 | SHA512_16_79(i + 2, g, h, a, b, c, d, e, f); | ||
127 | SHA512_16_79(i + 3, f, g, h, a, b, c, d, e); | ||
128 | SHA512_16_79(i + 4, e, f, g, h, a, b, c, d); | ||
129 | SHA512_16_79(i + 5, d, e, f, g, h, a, b, c); | ||
130 | SHA512_16_79(i + 6, c, d, e, f, g, h, a, b); | ||
131 | SHA512_16_79(i + 7, b, c, d, e, f, g, h, a); | ||
122 | } | 132 | } |
123 | 133 | ||
124 | state[0] += a; state[1] += b; state[2] += c; state[3] += d; | 134 | state[0] += a; state[1] += b; state[2] += c; state[3] += d; |