1/* 2 * ccsha1_eay.c 3 * corecrypto 4 * 5 * Created by Fabrice Gautier on 12/6/10. 6 * Copyright 2010,2011 Apple Inc. All rights reserved. 7 * 8 * Based on ssleay implementation. 9 * 10 */ 11 12/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 13 * All rights reserved. 14 * 15 * This package is an SSL implementation written 16 * by Eric Young (eay@cryptsoft.com). 17 * The implementation was written so as to conform with Netscapes SSL. 18 * 19 * This library is free for commercial and non-commercial use as long as 20 * the following conditions are aheared to. The following conditions 21 * apply to all code found in this distribution, be it the RC4, RSA, 22 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 23 * included with this distribution is covered by the same copyright terms 24 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 25 * 26 * Copyright remains Eric Young's, and as such any Copyright notices in 27 * the code are not to be removed. 28 * If this package is used in a product, Eric Young should be given attribution 29 * as the author of the parts of the library used. 30 * This can be in the form of a textual message at program startup or 31 * in documentation (online or textual) provided with the package. 32 * 33 * Redistribution and use in source and binary forms, with or without 34 * modification, are permitted provided that the following conditions 35 * are met: 36 * 1. Redistributions of source code must retain the copyright 37 * notice, this list of conditions and the following disclaimer. 38 * 2. Redistributions in binary form must reproduce the above copyright 39 * notice, this list of conditions and the following disclaimer in the 40 * documentation and/or other materials provided with the distribution. 41 * 3. All advertising materials mentioning features or use of this software 42 * must display the following acknowledgement: 43 * "This product includes cryptographic software written by 44 * Eric Young (eay@cryptsoft.com)" 45 * The word 'cryptographic' can be left out if the rouines from the library 46 * being used are not cryptographic related :-). 47 * 4. If you include any Windows specific code (or a derivative thereof) from 48 * the apps directory (application code) you must include an acknowledgement: 49 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 50 * 51 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 52 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 53 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 54 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 55 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 56 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 57 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 58 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 59 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 60 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 61 * SUCH DAMAGE. 62 * 63 * The licence and distribution terms for any publically available version or 64 * derivative of this code cannot be changed. i.e. this code cannot simply be 65 * copied and put under another distribution licence 66 * [including the GNU Public Licence.] 67 */ 68 69#define USE_SUPER_COOL_NEW_CCOID_T 70#include <corecrypto/ccsha1.h> 71#include <corecrypto/cc_priv.h> 72#include <corecrypto/ccdigest_priv.h> 73 74 75#ifndef SHA_LONG_LOG2 76#define SHA_LONG_LOG2 2 /* default to 32 bits */ 77#endif 78 79 80#define ROTATE(b, n) CC_ROLc(b, n) 81 82#define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \ 83 ix=(a)=ROTATE((a),1) \ 84 ) 85 86#define MD32_REG_T uint32_t 87 88#define HOST_c2l(data, l) CC_LOAD32_BE(l, data); data+=4; 89 90#define K_00_19 0x5a827999 91#define K_20_39 0x6ed9eba1 92#define K_40_59 0x8f1bbcdc 93#define K_60_79 0xca62c1d6 94 95/* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be 96 * simplified to the code in F_00_19. Wei attributes these optimisations 97 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. 98 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) 99 * I've just become aware of another tweak to be made, again from Wei Dai, 100 * in F_40_59, (x&a)|(y&a) -> (x|y)&a 101 */ 102#define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) 103#define F_20_39(b,c,d) ((b) ^ (c) ^ (d)) 104#define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d))) 105#define F_60_79(b,c,d) F_20_39(b,c,d) 106 107#define BODY_00_15(i,a,b,c,d,e,f,xi) \ 108 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ 109 (b)=ROTATE((b),30); 110 111#define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \ 112 Xupdate(f,xi,xa,xb,xc,xd); \ 113 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ 114 (b)=ROTATE((b),30); 115 116#define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \ 117 Xupdate(f,xi,xa,xb,xc,xd); \ 118 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ 119 (b)=ROTATE((b),30); 120 121#define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \ 122 Xupdate(f,xa,xa,xb,xc,xd); \ 123 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ 124 (b)=ROTATE((b),30); 125 126#define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \ 127 Xupdate(f,xa,xa,xb,xc,xd); \ 128 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \ 129 (b)=ROTATE((b),30); 130 131#define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \ 132 Xupdate(f,xa,xa,xb,xc,xd); \ 133 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \ 134 (b)=ROTATE((b),30); 135 136#ifdef X 137#undef X 138#endif 139 140#ifndef MD32_XARRAY 141 /* 142 * Originally X was an array. As it's automatic it's natural 143 * to expect RISC compiler to accomodate at least part of it in 144 * the register bank, isn't it? Unfortunately not all compilers 145 * "find" this expectation reasonable:-( On order to make such 146 * compilers generate better code I replace X[] with a bunch of 147 * X0, X1, etc. See the function body below... 148 * <appro@fy.chalmers.se> 149 */ 150# define X(i) XX##i 151#else 152 /* 153 * However! Some compilers (most notably HP C) get overwhelmed by 154 * that many local variables so that we have to have the way to 155 * fall down to the original behavior. 156 */ 157# define X(i) XX[i] 158#endif 159 160static void sha1_compress(ccdigest_state_t s, unsigned long num, const void *buf) 161{ 162 const unsigned char *data=buf; 163 register uint32_t A,B,C,D,E,T,l; 164#ifndef MD32_XARRAY 165 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, 166 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; 167#else 168 uint32_t XX[16]; 169#endif 170 uint32_t *state=ccdigest_u32(s); 171 172 A=state[0]; 173 B=state[1]; 174 C=state[2]; 175 D=state[3]; 176 E=state[4]; 177 178 for (;;) 179 { 180 181 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; 182 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l; 183 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l; 184 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l; 185 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l; 186 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l; 187 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l; 188 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l; 189 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l; 190 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l; 191 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l; 192 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l; 193 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l; 194 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l; 195 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l; 196 BODY_00_15(14,E,T,A,B,C,D,X(14)); 197 BODY_00_15(15,D,E,T,A,B,C,X(15)); 198 199 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13)); 200 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14)); 201 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15)); 202 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0)); 203 204 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1)); 205 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2)); 206 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3)); 207 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4)); 208 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5)); 209 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6)); 210 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7)); 211 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8)); 212 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9)); 213 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10)); 214 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11)); 215 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12)); 216 217 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13)); 218 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14)); 219 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15)); 220 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0)); 221 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1)); 222 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2)); 223 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3)); 224 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4)); 225 226 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5)); 227 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6)); 228 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7)); 229 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8)); 230 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9)); 231 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10)); 232 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11)); 233 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12)); 234 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13)); 235 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14)); 236 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15)); 237 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0)); 238 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1)); 239 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2)); 240 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3)); 241 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4)); 242 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5)); 243 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6)); 244 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7)); 245 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8)); 246 247 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9)); 248 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10)); 249 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11)); 250 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12)); 251 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13)); 252 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14)); 253 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15)); 254 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0)); 255 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1)); 256 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2)); 257 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3)); 258 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4)); 259 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5)); 260 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6)); 261 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7)); 262 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8)); 263 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9)); 264 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10)); 265 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11)); 266 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12)); 267 268 state[0]=(state[0]+E)&0xffffffff; 269 state[1]=(state[1]+T)&0xffffffff; 270 state[2]=(state[2]+A)&0xffffffff; 271 state[3]=(state[3]+B)&0xffffffff; 272 state[4]=(state[4]+C)&0xffffffff; 273 274 if (--num <= 0) break; 275 276 A=state[0]; 277 B=state[1]; 278 C=state[2]; 279 D=state[3]; 280 E=state[4]; 281 282 } 283} 284 285const struct ccdigest_info ccsha1_eay_di = { 286 .output_size = CCSHA1_OUTPUT_SIZE, 287 .state_size = CCSHA1_STATE_SIZE, 288 .block_size = CCSHA1_BLOCK_SIZE, 289 .oid_size = ccoid_sha1_len, 290 .oid = CC_DIGEST_OID_SHA1, 291 .initial_state = ccsha1_initial_state, 292 .compress = sha1_compress, 293 .final = ccdigest_final_64be, 294}; 295