crypto/bf/bf_enc.c

   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 "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 \
  69 to modify the code.
  70 #endif
  71
  72 void BF_encrypt(BF_LONG *data, BF_KEY *key)
  73         {
  74         register BF_LONG l,r,*p,*s;
  75
  76         p=key->P;
  77         s= &(key->S[0]);
  78         l=data[0];
  79         r=data[1];
  80
  81         l^=p[0];
  82         BF_ENC(r,l,s,p[ 1]);
  83         BF_ENC(l,r,s,p[ 2]);
  84         BF_ENC(r,l,s,p[ 3]);
  85         BF_ENC(l,r,s,p[ 4]);
  86         BF_ENC(r,l,s,p[ 5]);
  87         BF_ENC(l,r,s,p[ 6]);
  88         BF_ENC(r,l,s,p[ 7]);
  89         BF_ENC(l,r,s,p[ 8]);
  90         BF_ENC(r,l,s,p[ 9]);
  91         BF_ENC(l,r,s,p[10]);
  92         BF_ENC(r,l,s,p[11]);
  93         BF_ENC(l,r,s,p[12]);
  94         BF_ENC(r,l,s,p[13]);
  95         BF_ENC(l,r,s,p[14]);
  96         BF_ENC(r,l,s,p[15]);
  97         BF_ENC(l,r,s,p[16]);
  98 #if BF_ROUNDS == 20
  99         BF_ENC(r,l,s,p[17]);
 100         BF_ENC(l,r,s,p[18]);
 101         BF_ENC(r,l,s,p[19]);
 102         BF_ENC(l,r,s,p[20]);
 103 #endif
 104         r^=p[BF_ROUNDS+1];
 105
 106         data[1]=l&0xffffffffL;
 107         data[0]=r&0xffffffffL;
 108         }
 109
 110 #ifndef BF_DEFAULT_OPTIONS
 111
 112 void BF_decrypt(BF_LONG *data, BF_KEY *key)
 113         {
 114         register BF_LONG l,r,*p,*s;
 115
 116         p=key->P;
 117         s= &(key->S[0]);
 118         l=data[0];
 119         r=data[1];
 120
 121         l^=p[BF_ROUNDS+1];
 122 #if BF_ROUNDS == 20
 123         BF_ENC(r,l,s,p[20]);
 124         BF_ENC(l,r,s,p[19]);
 125         BF_ENC(r,l,s,p[18]);
 126         BF_ENC(l,r,s,p[17]);
 127 #endif
 128         BF_ENC(r,l,s,p[16]);
 129         BF_ENC(l,r,s,p[15]);
 130         BF_ENC(r,l,s,p[14]);
 131         BF_ENC(l,r,s,p[13]);
 132         BF_ENC(r,l,s,p[12]);
 133         BF_ENC(l,r,s,p[11]);
 134         BF_ENC(r,l,s,p[10]);
 135         BF_ENC(l,r,s,p[ 9]);
 136         BF_ENC(r,l,s,p[ 8]);
 137         BF_ENC(l,r,s,p[ 7]);
 138         BF_ENC(r,l,s,p[ 6]);
 139         BF_ENC(l,r,s,p[ 5]);
 140         BF_ENC(r,l,s,p[ 4]);
 141         BF_ENC(l,r,s,p[ 3]);
 142         BF_ENC(r,l,s,p[ 2]);
 143         BF_ENC(l,r,s,p[ 1]);
 144         r^=p[0];
 145
 146         data[1]=l&0xffffffffL;
 147         data[0]=r&0xffffffffL;
 148         }
 149
 150 void BF_cbc_encrypt(unsigned char *in, unsigned char *out, long length,
 151              BF_KEY *ks, unsigned char *iv, int encrypt)
 152         {
 153         register BF_LONG tin0,tin1;
 154         register BF_LONG tout0,tout1,xor0,xor1;
 155         register long l=length;
 156         BF_LONG tin[2];
 157
 158         if (encrypt)
 159                 {
 160                 n2l(iv,tout0);
 161                 n2l(iv,tout1);
 162                 iv-=8;
 163                 for (l-=8; l>=0; l-=8)
 164                         {
 165                         n2l(in,tin0);
 166                         n2l(in,tin1);
 167                         tin0^=tout0;
 168                         tin1^=tout1;
 169                         tin[0]=tin0;
 170                         tin[1]=tin1;
 171                         BF_encrypt(tin,ks);
 172                         tout0=tin[0];
 173                         tout1=tin[1];
 174                         l2n(tout0,out);
 175                         l2n(tout1,out);
 176                         }
 177                 if (l != -8)
 178                         {
 179                         n2ln(in,tin0,tin1,l+8);
 180                         tin0^=tout0;
 181                         tin1^=tout1;
 182                         tin[0]=tin0;
 183                         tin[1]=tin1;
 184                         BF_encrypt(tin,ks);
 185                         tout0=tin[0];
 186                         tout1=tin[1];
 187                         l2n(tout0,out);
 188                         l2n(tout1,out);
 189                         }
 190                 l2n(tout0,iv);
 191                 l2n(tout1,iv);
 192                 }
 193         else
 194                 {
 195                 n2l(iv,xor0);
 196                 n2l(iv,xor1);
 197                 iv-=8;
 198                 for (l-=8; l>=0; l-=8)
 199                         {
 200                         n2l(in,tin0);
 201                         n2l(in,tin1);
 202                         tin[0]=tin0;
 203                         tin[1]=tin1;
 204                         BF_decrypt(tin,ks);
 205                         tout0=tin[0]^xor0;
 206                         tout1=tin[1]^xor1;
 207                         l2n(tout0,out);
 208                         l2n(tout1,out);
 209                         xor0=tin0;
 210                         xor1=tin1;
 211                         }
 212                 if (l != -8)
 213                         {
 214                         n2l(in,tin0);
 215                         n2l(in,tin1);
 216                         tin[0]=tin0;
 217                         tin[1]=tin1;
 218                         BF_decrypt(tin,ks);
 219                         tout0=tin[0]^xor0;
 220                         tout1=tin[1]^xor1;
 221                         l2nn(tout0,tout1,out,l+8);
 222                         xor0=tin0;
 223                         xor1=tin1;
 224                         }
 225                 l2n(xor0,iv);
 226                 l2n(xor1,iv);
 227                 }
 228         tin0=tin1=tout0=tout1=xor0=xor1=0;
 229         tin[0]=tin[1]=0;
 230         }
 231
 232 #endif