2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 /* NOTE: fc_cbc_encrypt now modifies its 5th argument, to permit chaining over
11 * scatter/gather vectors.
15 #include <afsconfig.h>
17 #include "afs/param.h"
19 #include <afs/param.h>
30 #if !defined(AFS_LINUX20_ENV) && !defined(AFS_OBSD_ENV)
31 #include "netinet/in.h"
34 #include "afs/sysincludes.h"
37 #ifdef AFS_LINUX22_ENV
38 #include <asm/byteorder.h>
41 #include "afs/longc_procs.h"
46 #include <sys/types.h>
50 #include <netinet/in.h>
69 fc_keysched(struct ktc_encryptionKey *key, fc_KeySchedule schedule)
71 unsigned char *keychar = (unsigned char *)key;
77 /* first, flush the losing key parity bits. */
78 kword[0] = (*keychar++) >> 1;
80 kword[0] += (*keychar++) >> 1;
82 kword[0] += (*keychar++) >> 1;
84 kword[0] += (*keychar++) >> 1;
85 kword[1] = kword[0] >> 4; /* get top 24 bits for hi word */
88 kword[0] += (*keychar++) >> 1;
90 kword[0] += (*keychar++) >> 1;
92 kword[0] += (*keychar++) >> 1;
94 kword[0] += (*keychar) >> 1;
96 schedule[0] = kword[0];
97 for (i = 1; i < ROUNDS; i++) {
99 temp = kword[0] & ((1 << 11) - 1); /* get 11 lsb */
101 (kword[0] >> 11) | ((kword[1] & ((1 << 11) - 1)) << (32 - 11));
102 kword[1] = (kword[1] >> 11) | (temp << (56 - 32 - 11));
103 schedule[i] = kword[0];
106 rxkad_stats.fc_key_scheds++;
111 /* IN int encrypt; * 0 ==> decrypt, else encrypt */
113 fc_ecb_encrypt(void * clear, void * cipher,
114 fc_KeySchedule schedule, int encrypt)
118 unsigned char *Pchar = (unsigned char *)&P;
119 unsigned char *Schar = (unsigned char *)&S;
122 #if defined(vax) || (defined(mips) && defined(MIPSEL)) || defined(AFSLITTLE_ENDIAN)
135 memcpy(&L, clear, sizeof(afs_int32));
136 memcpy(&R, clear + 1, sizeof(afs_int32));
138 L = ntohl(*((afs_uint32 *)clear));
139 R = ntohl(*((afs_uint32 *)clear + 1));
144 rxkad_stats.fc_encrypts[ENCRYPT]++;
146 for (i = 0; i < (ROUNDS / 2); i++) {
147 S = *schedule++ ^ R; /* xor R with key bits from schedule */
148 Pchar[Byte2] = sbox0[Schar[Byte0]]; /* do 8-bit S Box subst. */
149 Pchar[Byte3] = sbox1[Schar[Byte1]]; /* and permute the result */
150 Pchar[Byte1] = sbox2[Schar[Byte2]];
151 Pchar[Byte0] = sbox3[Schar[Byte3]];
152 P = (P >> 5) | ((P & ((1 << 5) - 1)) << (32 - 5)); /* right rot 5 bits */
153 L ^= P; /* we're done with L, so save there */
154 S = *schedule++ ^ L; /* this time xor with L */
155 Pchar[Byte2] = sbox0[Schar[Byte0]];
156 Pchar[Byte3] = sbox1[Schar[Byte1]];
157 Pchar[Byte1] = sbox2[Schar[Byte2]];
158 Pchar[Byte0] = sbox3[Schar[Byte3]];
159 P = (P >> 5) | ((P & ((1 << 5) - 1)) << (32 - 5)); /* right rot 5 bits */
164 rxkad_stats.fc_encrypts[DECRYPT]++;
166 schedule = &schedule[ROUNDS - 1]; /* start at end of key schedule */
167 for (i = 0; i < (ROUNDS / 2); i++) {
168 S = *schedule-- ^ L; /* xor R with key bits from schedule */
169 Pchar[Byte2] = sbox0[Schar[Byte0]]; /* do 8-bit S Box subst. and */
170 Pchar[Byte3] = sbox1[Schar[Byte1]]; /* permute the result */
171 Pchar[Byte1] = sbox2[Schar[Byte2]];
172 Pchar[Byte0] = sbox3[Schar[Byte3]];
173 P = (P >> 5) | ((P & ((1 << 5) - 1)) << (32 - 5)); /* right rot 5 bits */
174 R ^= P; /* we're done with L, so save there */
175 S = *schedule-- ^ R; /* this time xor with L */
176 Pchar[Byte2] = sbox0[Schar[Byte0]];
177 Pchar[Byte3] = sbox1[Schar[Byte1]];
178 Pchar[Byte1] = sbox2[Schar[Byte2]];
179 Pchar[Byte0] = sbox3[Schar[Byte3]];
180 P = (P >> 5) | ((P & ((1 << 5) - 1)) << (32 - 5)); /* right rot 5 bits */
185 memcpy(cipher, &L, sizeof(afs_int32));
186 memcpy(cipher + 1, &R, sizeof(afs_int32));
188 *((afs_int32 *)cipher) = htonl(L);
189 *((afs_int32 *)cipher + 1) = htonl(R);
194 /* Crypting can be done in segments by recycling xor. All but the final segment must
195 * be multiples of 8 bytes.
196 * NOTE: fc_cbc_encrypt now modifies its 5th argument, to permit chaining over
197 * scatter/gather vectors.
200 afs_int32 length; * in bytes *
201 int encrypt; * 0 ==> decrypt, else encrypt *
202 fc_KeySchedule key; * precomputed key schedule *
203 afs_uint32 *xor; * 8 bytes of initialization vector *
206 fc_cbc_encrypt(void *input, void *output, afs_int32 length,
207 fc_KeySchedule key, afs_uint32 * xor, int encrypt)
210 afs_uint32 t_input[2];
211 afs_uint32 t_output[2];
212 unsigned char *t_in_p = (unsigned char *)t_input;
215 for (i = 0; length > 0; i++, length -= 8) {
217 memcpy(t_input, input, sizeof(t_input));
218 (char *)input += sizeof(t_input);
221 for (j = length; j <= 7; j++)
224 /* do the xor for cbc into the temp */
225 xor[0] ^= t_input[0];
226 xor[1] ^= t_input[1];
228 fc_ecb_encrypt(xor, t_output, key, encrypt);
230 /* copy temp output and save it for cbc */
231 memcpy(output, t_output, sizeof(t_output));
232 (char *)output += sizeof(t_output);
234 /* calculate xor value for next round from plain & cipher text */
235 xor[0] = t_input[0] ^ t_output[0];
236 xor[1] = t_input[1] ^ t_output[1];
244 for (i = 0; length > 0; i++, length -= 8) {
246 memcpy(t_input, input, sizeof(t_input));
247 (char *)input += sizeof(t_input);
249 /* no padding for decrypt */
250 fc_ecb_encrypt(t_input, t_output, key, encrypt);
252 /* do the xor for cbc into the output */
253 t_output[0] ^= xor[0];
254 t_output[1] ^= xor[1];
256 /* copy temp output */
257 memcpy(output, t_output, sizeof(t_output));
258 (char *)output += sizeof(t_output);
260 /* calculate xor value for next round from plain & cipher text */
261 xor[0] = t_input[0] ^ t_output[0];
262 xor[1] = t_input[1] ^ t_output[1];