bf_enc.c revision 55714
1/* crypto/bf/bf_enc.c */ 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 3 * All rights reserved. 4 * 5 * This package is an SSL implementation written 6 * by Eric Young (eay@cryptsoft.com). 7 * The implementation was written so as to conform with Netscapes SSL. 8 * 9 * This library is free for commercial and non-commercial use as long as 10 * the following conditions are aheared to. The following conditions 11 * apply to all code found in this distribution, be it the RC4, RSA, 12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 13 * included with this distribution is covered by the same copyright terms 14 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15 * 16 * Copyright remains Eric Young's, and as such any Copyright notices in 17 * the code are not to be removed. 18 * If this package is used in a product, Eric Young should be given attribution 19 * as the author of the parts of the library used. 20 * This can be in the form of a textual message at program startup or 21 * in documentation (online or textual) provided with the package. 22 * 23 * Redistribution and use in source and binary forms, with or without 24 * modification, are permitted provided that the following conditions 25 * are met: 26 * 1. Redistributions of source code must retain the copyright 27 * notice, this list of conditions and the following disclaimer. 28 * 2. Redistributions in binary form must reproduce the above copyright 29 * notice, this list of conditions and the following disclaimer in the 30 * documentation and/or other materials provided with the distribution. 31 * 3. All advertising materials mentioning features or use of this software 32 * must display the following acknowledgement: 33 * "This product includes cryptographic software written by 34 * Eric Young (eay@cryptsoft.com)" 35 * The word 'cryptographic' can be left out if the rouines from the library 36 * being used are not cryptographic related :-). 37 * 4. If you include any Windows specific code (or a derivative thereof) from 38 * the apps directory (application code) you must include an acknowledgement: 39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40 * 41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 51 * SUCH DAMAGE. 52 * 53 * The licence and distribution terms for any publically available version or 54 * derivative of this code cannot be changed. i.e. this code cannot simply be 55 * copied and put under another distribution licence 56 * [including the GNU Public Licence.] 57 */ 58 59#include <openssl/blowfish.h> 60#include "bf_locl.h" 61 62/* Blowfish as implemented from 'Blowfish: Springer-Verlag paper' 63 * (From LECTURE NOTES IN COIMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, 64 * CAMBRIDGE SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993) 65 */ 66 67#if (BF_ROUNDS != 16) && (BF_ROUNDS != 20) 68#error If you set BF_ROUNDS to some value other than 16 or 20, you will have \ 69to modify the code. 70#endif 71 72void BF_encrypt(BF_LONG *data, BF_KEY *key) 73 { 74#ifndef BF_PTR2 75 register BF_LONG l,r,*p,*s; 76 77 p=key->P; 78 s= &(key->S[0]); 79 l=data[0]; 80 r=data[1]; 81 82 l^=p[0]; 83 BF_ENC(r,l,s,p[ 1]); 84 BF_ENC(l,r,s,p[ 2]); 85 BF_ENC(r,l,s,p[ 3]); 86 BF_ENC(l,r,s,p[ 4]); 87 BF_ENC(r,l,s,p[ 5]); 88 BF_ENC(l,r,s,p[ 6]); 89 BF_ENC(r,l,s,p[ 7]); 90 BF_ENC(l,r,s,p[ 8]); 91 BF_ENC(r,l,s,p[ 9]); 92 BF_ENC(l,r,s,p[10]); 93 BF_ENC(r,l,s,p[11]); 94 BF_ENC(l,r,s,p[12]); 95 BF_ENC(r,l,s,p[13]); 96 BF_ENC(l,r,s,p[14]); 97 BF_ENC(r,l,s,p[15]); 98 BF_ENC(l,r,s,p[16]); 99#if BF_ROUNDS == 20 100 BF_ENC(r,l,s,p[17]); 101 BF_ENC(l,r,s,p[18]); 102 BF_ENC(r,l,s,p[19]); 103 BF_ENC(l,r,s,p[20]); 104#endif 105 r^=p[BF_ROUNDS+1]; 106 107 data[1]=l&0xffffffffL; 108 data[0]=r&0xffffffffL; 109#else 110 register BF_LONG l,r,t,*k; 111 112 l=data[0]; 113 r=data[1]; 114 k=(BF_LONG*)key; 115 116 l^=k[0]; 117 BF_ENC(r,l,k, 1); 118 BF_ENC(l,r,k, 2); 119 BF_ENC(r,l,k, 3); 120 BF_ENC(l,r,k, 4); 121 BF_ENC(r,l,k, 5); 122 BF_ENC(l,r,k, 6); 123 BF_ENC(r,l,k, 7); 124 BF_ENC(l,r,k, 8); 125 BF_ENC(r,l,k, 9); 126 BF_ENC(l,r,k,10); 127 BF_ENC(r,l,k,11); 128 BF_ENC(l,r,k,12); 129 BF_ENC(r,l,k,13); 130 BF_ENC(l,r,k,14); 131 BF_ENC(r,l,k,15); 132 BF_ENC(l,r,k,16); 133#if BF_ROUNDS == 20 134 BF_ENC(r,l,k,17); 135 BF_ENC(l,r,k,18); 136 BF_ENC(r,l,k,19); 137 BF_ENC(l,r,k,20); 138#endif 139 r^=k[BF_ROUNDS+1]; 140 141 data[1]=l&0xffffffffL; 142 data[0]=r&0xffffffffL; 143#endif 144 } 145 146#ifndef BF_DEFAULT_OPTIONS 147 148void BF_decrypt(BF_LONG *data, BF_KEY *key) 149 { 150#ifndef BF_PTR2 151 register BF_LONG l,r,*p,*s; 152 153 p=key->P; 154 s= &(key->S[0]); 155 l=data[0]; 156 r=data[1]; 157 158 l^=p[BF_ROUNDS+1]; 159#if BF_ROUNDS == 20 160 BF_ENC(r,l,s,p[20]); 161 BF_ENC(l,r,s,p[19]); 162 BF_ENC(r,l,s,p[18]); 163 BF_ENC(l,r,s,p[17]); 164#endif 165 BF_ENC(r,l,s,p[16]); 166 BF_ENC(l,r,s,p[15]); 167 BF_ENC(r,l,s,p[14]); 168 BF_ENC(l,r,s,p[13]); 169 BF_ENC(r,l,s,p[12]); 170 BF_ENC(l,r,s,p[11]); 171 BF_ENC(r,l,s,p[10]); 172 BF_ENC(l,r,s,p[ 9]); 173 BF_ENC(r,l,s,p[ 8]); 174 BF_ENC(l,r,s,p[ 7]); 175 BF_ENC(r,l,s,p[ 6]); 176 BF_ENC(l,r,s,p[ 5]); 177 BF_ENC(r,l,s,p[ 4]); 178 BF_ENC(l,r,s,p[ 3]); 179 BF_ENC(r,l,s,p[ 2]); 180 BF_ENC(l,r,s,p[ 1]); 181 r^=p[0]; 182 183 data[1]=l&0xffffffffL; 184 data[0]=r&0xffffffffL; 185#else 186 register BF_LONG l,r,t,*k; 187 188 l=data[0]; 189 r=data[1]; 190 k=(BF_LONG *)key; 191 192 l^=k[BF_ROUNDS+1]; 193#if BF_ROUNDS == 20 194 BF_ENC(r,l,k,20); 195 BF_ENC(l,r,k,19); 196 BF_ENC(r,l,k,18); 197 BF_ENC(l,r,k,17); 198#endif 199 BF_ENC(r,l,k,16); 200 BF_ENC(l,r,k,15); 201 BF_ENC(r,l,k,14); 202 BF_ENC(l,r,k,13); 203 BF_ENC(r,l,k,12); 204 BF_ENC(l,r,k,11); 205 BF_ENC(r,l,k,10); 206 BF_ENC(l,r,k, 9); 207 BF_ENC(r,l,k, 8); 208 BF_ENC(l,r,k, 7); 209 BF_ENC(r,l,k, 6); 210 BF_ENC(l,r,k, 5); 211 BF_ENC(r,l,k, 4); 212 BF_ENC(l,r,k, 3); 213 BF_ENC(r,l,k, 2); 214 BF_ENC(l,r,k, 1); 215 r^=k[0]; 216 217 data[1]=l&0xffffffffL; 218 data[0]=r&0xffffffffL; 219#endif 220 } 221 222void BF_cbc_encrypt(unsigned char *in, unsigned char *out, long length, 223 BF_KEY *ks, unsigned char *iv, int encrypt) 224 { 225 register BF_LONG tin0,tin1; 226 register BF_LONG tout0,tout1,xor0,xor1; 227 register long l=length; 228 BF_LONG tin[2]; 229 230 if (encrypt) 231 { 232 n2l(iv,tout0); 233 n2l(iv,tout1); 234 iv-=8; 235 for (l-=8; l>=0; l-=8) 236 { 237 n2l(in,tin0); 238 n2l(in,tin1); 239 tin0^=tout0; 240 tin1^=tout1; 241 tin[0]=tin0; 242 tin[1]=tin1; 243 BF_encrypt(tin,ks); 244 tout0=tin[0]; 245 tout1=tin[1]; 246 l2n(tout0,out); 247 l2n(tout1,out); 248 } 249 if (l != -8) 250 { 251 n2ln(in,tin0,tin1,l+8); 252 tin0^=tout0; 253 tin1^=tout1; 254 tin[0]=tin0; 255 tin[1]=tin1; 256 BF_encrypt(tin,ks); 257 tout0=tin[0]; 258 tout1=tin[1]; 259 l2n(tout0,out); 260 l2n(tout1,out); 261 } 262 l2n(tout0,iv); 263 l2n(tout1,iv); 264 } 265 else 266 { 267 n2l(iv,xor0); 268 n2l(iv,xor1); 269 iv-=8; 270 for (l-=8; l>=0; l-=8) 271 { 272 n2l(in,tin0); 273 n2l(in,tin1); 274 tin[0]=tin0; 275 tin[1]=tin1; 276 BF_decrypt(tin,ks); 277 tout0=tin[0]^xor0; 278 tout1=tin[1]^xor1; 279 l2n(tout0,out); 280 l2n(tout1,out); 281 xor0=tin0; 282 xor1=tin1; 283 } 284 if (l != -8) 285 { 286 n2l(in,tin0); 287 n2l(in,tin1); 288 tin[0]=tin0; 289 tin[1]=tin1; 290 BF_decrypt(tin,ks); 291 tout0=tin[0]^xor0; 292 tout1=tin[1]^xor1; 293 l2nn(tout0,tout1,out,l+8); 294 xor0=tin0; 295 xor1=tin1; 296 } 297 l2n(xor0,iv); 298 l2n(xor1,iv); 299 } 300 tin0=tin1=tout0=tout1=xor0=xor1=0; 301 tin[0]=tin[1]=0; 302 } 303 304#endif 305