bf_enc.c revision 1.3 
1/*	$NetBSD: bf_enc.c,v 1.3 2000/11/06 14:11:40 itojun Exp $	*/
2/*	$KAME: bf_enc.c,v 1.5 2000/09/18 21:21:19 itojun Exp $	*/
3
4/* crypto/bf/bf_enc.c */
5/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
6 * All rights reserved.
7 *
8 * This package is an SSL implementation written
9 * by Eric Young (eay@mincom.oz.au).
10 * The implementation was written so as to conform with Netscapes SSL.
11 *
12 * This library is free for commercial and non-commercial use as long as
13 * the following conditions are aheared to.  The following conditions
14 * apply to all code found in this distribution, be it the RC4, RSA,
15 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
16 * included with this distribution is covered by the same copyright terms
17 * except that the holder is Tim Hudson (tjh@mincom.oz.au).
18 *
19 * Copyright remains Eric Young's, and as such any Copyright notices in
20 * the code are not to be removed.
21 * If this package is used in a product, Eric Young should be given attribution
22 * as the author of the parts of the library used.
23 * This can be in the form of a textual message at program startup or
24 * in documentation (online or textual) provided with the package.
25 *
26 * Redistribution and use in source and binary forms, with or without
27 * modification, are permitted provided that the following conditions
28 * are met:
29 * 1. Redistributions of source code must retain the copyright
30 *    notice, this list of conditions and the following disclaimer.
31 * 2. Redistributions in binary form must reproduce the above copyright
32 *    notice, this list of conditions and the following disclaimer in the
33 *    documentation and/or other materials provided with the distribution.
34 * 3. All advertising materials mentioning features or use of this software
35 *    must display the following acknowledgement:
36 *    "This product includes cryptographic software written by
37 *     Eric Young (eay@mincom.oz.au)"
38 *    The word 'cryptographic' can be left out if the rouines from the library
39 *    being used are not cryptographic related :-).
40 * 4. If you include any Windows specific code (or a derivative thereof) from
41 *    the apps directory (application code) you must include an acknowledgement:
42 *    "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
43 *
44 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
45 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
46 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
47 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
48 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
49 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
50 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
51 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
52 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
53 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
54 * SUCH DAMAGE.
55 *
56 * The licence and distribution terms for any publically available version or
57 * derivative of this code cannot be changed.  i.e. this code cannot simply be
58 * copied and put under another distribution licence
59 * [including the GNU Public Licence.]
60 */
61
62#include <sys/types.h>
63#include <crypto/blowfish/blowfish.h>
64#include <crypto/blowfish/bf_locl.h>
65
66/* Blowfish as implemented from 'Blowfish: Springer-Verlag paper'
67 * (From LECTURE NOTES IN COIMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION,
68 * CAMBRIDGE SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993)
69 */
70
71#if (BF_ROUNDS != 16) && (BF_ROUNDS != 20)
72If you set BF_ROUNDS to some value other than 16 or 20, you will have
73to modify the code.
74#endif
75
76/* XXX "data" is host endian */
77void
78BF_encrypt(data, key, encrypt)
79	BF_LONG *data;
80	BF_KEY *key;
81	int encrypt;
82{
83	register BF_LONG l, r, *p, *s;
84
85	p = key->P;
86	s= &key->S[0];
87	l = data[0];
88	r = data[1];
89
90	if (encrypt) {
91		l^=p[0];
92		BF_ENC(r, l, s, p[ 1]);
93		BF_ENC(l, r, s, p[ 2]);
94		BF_ENC(r, l, s, p[ 3]);
95		BF_ENC(l, r, s, p[ 4]);
96		BF_ENC(r, l, s, p[ 5]);
97		BF_ENC(l, r, s, p[ 6]);
98		BF_ENC(r, l, s, p[ 7]);
99		BF_ENC(l, r, s, p[ 8]);
100		BF_ENC(r, l, s, p[ 9]);
101		BF_ENC(l, r, s, p[10]);
102		BF_ENC(r, l, s, p[11]);
103		BF_ENC(l, r, s, p[12]);
104		BF_ENC(r, l, s, p[13]);
105		BF_ENC(l, r, s, p[14]);
106		BF_ENC(r, l, s, p[15]);
107		BF_ENC(l, r, s, p[16]);
108#if BF_ROUNDS == 20
109		BF_ENC(r, l, s, p[17]);
110		BF_ENC(l, r, s, p[18]);
111		BF_ENC(r, l, s, p[19]);
112		BF_ENC(l, r, s, p[20]);
113#endif
114		r ^= p[BF_ROUNDS + 1];
115	} else {
116		l ^= p[BF_ROUNDS + 1];
117#if BF_ROUNDS == 20
118		BF_ENC(r, l, s, p[20]);
119		BF_ENC(l, r, s, p[19]);
120		BF_ENC(r, l, s, p[18]);
121		BF_ENC(l, r, s, p[17]);
122#endif
123		BF_ENC(r, l, s, p[16]);
124		BF_ENC(l, r, s, p[15]);
125		BF_ENC(r, l, s, p[14]);
126		BF_ENC(l, r, s, p[13]);
127		BF_ENC(r, l, s, p[12]);
128		BF_ENC(l, r, s, p[11]);
129		BF_ENC(r, l, s, p[10]);
130		BF_ENC(l, r, s, p[ 9]);
131		BF_ENC(r, l, s, p[ 8]);
132		BF_ENC(l, r, s, p[ 7]);
133		BF_ENC(r, l, s, p[ 6]);
134		BF_ENC(l, r, s, p[ 5]);
135		BF_ENC(r, l, s, p[ 4]);
136		BF_ENC(l, r, s, p[ 3]);
137		BF_ENC(r, l, s, p[ 2]);
138		BF_ENC(l, r, s, p[ 1]);
139		r ^= p[0];
140	}
141	data[1] = l & 0xffffffff;
142	data[0] = r & 0xffffffff;
143}
144