1/*	$KAME: bf_enc.c,v 1.7 2002/02/27 01:33:59 itojun Exp $	*/
2
3/* crypto/bf/bf_enc.c */
4
5/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
6 * All rights reserved.
7 *
8 * This package is an SSL implementation written
9 * by Eric Young (eay@cryptsoft.com).
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@cryptsoft.com).
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@cryptsoft.com)"
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@cryptsoft.com)"
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/cdefs.h>
63__FBSDID("$FreeBSD$");
64
65#include <sys/types.h>
66#include <crypto/blowfish/blowfish.h>
67#include <crypto/blowfish/bf_locl.h>
68
69/* Blowfish as implemented from 'Blowfish: Springer-Verlag paper'
70 * (From LECTURE NOTES IN COIMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION,
71 * CAMBRIDGE SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993)
72 */
73
74#if (BF_ROUNDS != 16) && (BF_ROUNDS != 20)
75If you set BF_ROUNDS to some value other than 16 or 20, you will have
76to modify the code.
77#endif
78
79/* XXX "data" is host endian */
80void
81BF_encrypt(data, key)
82	BF_LONG *data;
83	BF_KEY *key;
84{
85	register BF_LONG l, r, *p, *s;
86
87	p = key->P;
88	s= &key->S[0];
89	l = data[0];
90	r = data[1];
91
92	l^=p[0];
93	BF_ENC(r, l, s, p[ 1]);
94	BF_ENC(l, r, s, p[ 2]);
95	BF_ENC(r, l, s, p[ 3]);
96	BF_ENC(l, r, s, p[ 4]);
97	BF_ENC(r, l, s, p[ 5]);
98	BF_ENC(l, r, s, p[ 6]);
99	BF_ENC(r, l, s, p[ 7]);
100	BF_ENC(l, r, s, p[ 8]);
101	BF_ENC(r, l, s, p[ 9]);
102	BF_ENC(l, r, s, p[10]);
103	BF_ENC(r, l, s, p[11]);
104	BF_ENC(l, r, s, p[12]);
105	BF_ENC(r, l, s, p[13]);
106	BF_ENC(l, r, s, p[14]);
107	BF_ENC(r, l, s, p[15]);
108	BF_ENC(l, r, s, p[16]);
109#if BF_ROUNDS == 20
110	BF_ENC(r, l, s, p[17]);
111	BF_ENC(l, r, s, p[18]);
112	BF_ENC(r, l, s, p[19]);
113	BF_ENC(l, r, s, p[20]);
114#endif
115	r ^= p[BF_ROUNDS + 1];
116
117	data[1] = l & 0xffffffff;
118	data[0] = r & 0xffffffff;
119}
120
121/* XXX "data" is host endian */
122void
123BF_decrypt(data, key)
124	BF_LONG *data;
125	BF_KEY *key;
126{
127	register BF_LONG l, r, *p, *s;
128
129	p = key->P;
130	s= &key->S[0];
131	l = data[0];
132	r = data[1];
133
134	l ^= p[BF_ROUNDS + 1];
135#if BF_ROUNDS == 20
136	BF_ENC(r, l, s, p[20]);
137	BF_ENC(l, r, s, p[19]);
138	BF_ENC(r, l, s, p[18]);
139	BF_ENC(l, r, s, p[17]);
140#endif
141	BF_ENC(r, l, s, p[16]);
142	BF_ENC(l, r, s, p[15]);
143	BF_ENC(r, l, s, p[14]);
144	BF_ENC(l, r, s, p[13]);
145	BF_ENC(r, l, s, p[12]);
146	BF_ENC(l, r, s, p[11]);
147	BF_ENC(r, l, s, p[10]);
148	BF_ENC(l, r, s, p[ 9]);
149	BF_ENC(r, l, s, p[ 8]);
150	BF_ENC(l, r, s, p[ 7]);
151	BF_ENC(r, l, s, p[ 6]);
152	BF_ENC(l, r, s, p[ 5]);
153	BF_ENC(r, l, s, p[ 4]);
154	BF_ENC(l, r, s, p[ 3]);
155	BF_ENC(r, l, s, p[ 2]);
156	BF_ENC(l, r, s, p[ 1]);
157	r ^= p[0];
158
159	data[1] = l & 0xffffffff;
160	data[0] = r & 0xffffffff;
161}
162