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/* 63 * Blowfish as implemented from 'Blowfish: Springer-Verlag paper' (From 64 * LECTURE NOTES IN COMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, CAMBRIDGE 65 * SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993) 66 */ 67 68#if (BF_ROUNDS != 16) && (BF_ROUNDS != 20) 69# error If you set BF_ROUNDS to some value other than 16 or 20, you will have \ 70to modify the code. 71#endif 72 73void BF_encrypt(BF_LONG *data, const BF_KEY *key) 74{ 75#ifndef BF_PTR2 76 register BF_LONG l, r; 77 register const BF_LONG *p, *s; 78 79 p = key->P; 80 s = &(key->S[0]); 81 l = data[0]; 82 r = data[1]; 83 84 l ^= p[0]; 85 BF_ENC(r, l, s, p[1]); 86 BF_ENC(l, r, s, p[2]); 87 BF_ENC(r, l, s, p[3]); 88 BF_ENC(l, r, s, p[4]); 89 BF_ENC(r, l, s, p[5]); 90 BF_ENC(l, r, s, p[6]); 91 BF_ENC(r, l, s, p[7]); 92 BF_ENC(l, r, s, p[8]); 93 BF_ENC(r, l, s, p[9]); 94 BF_ENC(l, r, s, p[10]); 95 BF_ENC(r, l, s, p[11]); 96 BF_ENC(l, r, s, p[12]); 97 BF_ENC(r, l, s, p[13]); 98 BF_ENC(l, r, s, p[14]); 99 BF_ENC(r, l, s, p[15]); 100 BF_ENC(l, r, s, p[16]); 101# if BF_ROUNDS == 20 102 BF_ENC(r, l, s, p[17]); 103 BF_ENC(l, r, s, p[18]); 104 BF_ENC(r, l, s, p[19]); 105 BF_ENC(l, r, s, p[20]); 106# endif 107 r ^= p[BF_ROUNDS + 1]; 108 109 data[1] = l & 0xffffffffL; 110 data[0] = r & 0xffffffffL; 111#else 112 register BF_LONG l, r, t, *k; 113 114 l = data[0]; 115 r = data[1]; 116 k = (BF_LONG *)key; 117 118 l ^= k[0]; 119 BF_ENC(r, l, k, 1); 120 BF_ENC(l, r, k, 2); 121 BF_ENC(r, l, k, 3); 122 BF_ENC(l, r, k, 4); 123 BF_ENC(r, l, k, 5); 124 BF_ENC(l, r, k, 6); 125 BF_ENC(r, l, k, 7); 126 BF_ENC(l, r, k, 8); 127 BF_ENC(r, l, k, 9); 128 BF_ENC(l, r, k, 10); 129 BF_ENC(r, l, k, 11); 130 BF_ENC(l, r, k, 12); 131 BF_ENC(r, l, k, 13); 132 BF_ENC(l, r, k, 14); 133 BF_ENC(r, l, k, 15); 134 BF_ENC(l, r, k, 16); 135# if BF_ROUNDS == 20 136 BF_ENC(r, l, k, 17); 137 BF_ENC(l, r, k, 18); 138 BF_ENC(r, l, k, 19); 139 BF_ENC(l, r, k, 20); 140# endif 141 r ^= k[BF_ROUNDS + 1]; 142 143 data[1] = l & 0xffffffffL; 144 data[0] = r & 0xffffffffL; 145#endif 146} 147 148#ifndef BF_DEFAULT_OPTIONS 149 150void BF_decrypt(BF_LONG *data, const BF_KEY *key) 151{ 152# ifndef BF_PTR2 153 register BF_LONG l, r; 154 register const BF_LONG *p, *s; 155 156 p = key->P; 157 s = &(key->S[0]); 158 l = data[0]; 159 r = data[1]; 160 161 l ^= p[BF_ROUNDS + 1]; 162# if BF_ROUNDS == 20 163 BF_ENC(r, l, s, p[20]); 164 BF_ENC(l, r, s, p[19]); 165 BF_ENC(r, l, s, p[18]); 166 BF_ENC(l, r, s, p[17]); 167# endif 168 BF_ENC(r, l, s, p[16]); 169 BF_ENC(l, r, s, p[15]); 170 BF_ENC(r, l, s, p[14]); 171 BF_ENC(l, r, s, p[13]); 172 BF_ENC(r, l, s, p[12]); 173 BF_ENC(l, r, s, p[11]); 174 BF_ENC(r, l, s, p[10]); 175 BF_ENC(l, r, s, p[9]); 176 BF_ENC(r, l, s, p[8]); 177 BF_ENC(l, r, s, p[7]); 178 BF_ENC(r, l, s, p[6]); 179 BF_ENC(l, r, s, p[5]); 180 BF_ENC(r, l, s, p[4]); 181 BF_ENC(l, r, s, p[3]); 182 BF_ENC(r, l, s, p[2]); 183 BF_ENC(l, r, s, p[1]); 184 r ^= p[0]; 185 186 data[1] = l & 0xffffffffL; 187 data[0] = r & 0xffffffffL; 188# else 189 register BF_LONG l, r, t, *k; 190 191 l = data[0]; 192 r = data[1]; 193 k = (BF_LONG *)key; 194 195 l ^= k[BF_ROUNDS + 1]; 196# if BF_ROUNDS == 20 197 BF_ENC(r, l, k, 20); 198 BF_ENC(l, r, k, 19); 199 BF_ENC(r, l, k, 18); 200 BF_ENC(l, r, k, 17); 201# endif 202 BF_ENC(r, l, k, 16); 203 BF_ENC(l, r, k, 15); 204 BF_ENC(r, l, k, 14); 205 BF_ENC(l, r, k, 13); 206 BF_ENC(r, l, k, 12); 207 BF_ENC(l, r, k, 11); 208 BF_ENC(r, l, k, 10); 209 BF_ENC(l, r, k, 9); 210 BF_ENC(r, l, k, 8); 211 BF_ENC(l, r, k, 7); 212 BF_ENC(r, l, k, 6); 213 BF_ENC(l, r, k, 5); 214 BF_ENC(r, l, k, 4); 215 BF_ENC(l, r, k, 3); 216 BF_ENC(r, l, k, 2); 217 BF_ENC(l, r, k, 1); 218 r ^= k[0]; 219 220 data[1] = l & 0xffffffffL; 221 data[0] = r & 0xffffffffL; 222# endif 223} 224 225void BF_cbc_encrypt(const unsigned char *in, unsigned char *out, long length, 226 const BF_KEY *schedule, unsigned char *ivec, int encrypt) 227{ 228 register BF_LONG tin0, tin1; 229 register BF_LONG tout0, tout1, xor0, xor1; 230 register long l = length; 231 BF_LONG tin[2]; 232 233 if (encrypt) { 234 n2l(ivec, tout0); 235 n2l(ivec, tout1); 236 ivec -= 8; 237 for (l -= 8; l >= 0; l -= 8) { 238 n2l(in, tin0); 239 n2l(in, tin1); 240 tin0 ^= tout0; 241 tin1 ^= tout1; 242 tin[0] = tin0; 243 tin[1] = tin1; 244 BF_encrypt(tin, schedule); 245 tout0 = tin[0]; 246 tout1 = tin[1]; 247 l2n(tout0, out); 248 l2n(tout1, out); 249 } 250 if (l != -8) { 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, schedule); 257 tout0 = tin[0]; 258 tout1 = tin[1]; 259 l2n(tout0, out); 260 l2n(tout1, out); 261 } 262 l2n(tout0, ivec); 263 l2n(tout1, ivec); 264 } else { 265 n2l(ivec, xor0); 266 n2l(ivec, xor1); 267 ivec -= 8; 268 for (l -= 8; l >= 0; l -= 8) { 269 n2l(in, tin0); 270 n2l(in, tin1); 271 tin[0] = tin0; 272 tin[1] = tin1; 273 BF_decrypt(tin, schedule); 274 tout0 = tin[0] ^ xor0; 275 tout1 = tin[1] ^ xor1; 276 l2n(tout0, out); 277 l2n(tout1, out); 278 xor0 = tin0; 279 xor1 = tin1; 280 } 281 if (l != -8) { 282 n2l(in, tin0); 283 n2l(in, tin1); 284 tin[0] = tin0; 285 tin[1] = tin1; 286 BF_decrypt(tin, schedule); 287 tout0 = tin[0] ^ xor0; 288 tout1 = tin[1] ^ xor1; 289 l2nn(tout0, tout1, out, l + 8); 290 xor0 = tin0; 291 xor1 = tin1; 292 } 293 l2n(xor0, ivec); 294 l2n(xor1, ivec); 295 } 296 tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0; 297 tin[0] = tin[1] = 0; 298} 299 300#endif 301