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.
17 #include "../afs/param.h"
19 #include "../afs/stds.h"
20 #include "../h/types.h"
21 #ifndef AFS_LINUX20_ENV
22 #include "../netinet/in.h"
25 #include "../afs/sysincludes.h"
26 #include "../afs/stds.h"
28 #ifdef AFS_LINUX22_ENV
29 #include <asm/byteorder.h>
32 #include "../afs/longc_procs.h"
36 #include <afs/param.h>
38 #include <sys/types.h>
42 #include <netinet/in.h>
60 int fc_keysched (key, schedule)
61 IN struct ktc_encryptionKey *key;
62 OUT fc_KeySchedule schedule;
63 { unsigned char *keychar = (unsigned char *)key;
69 /* first, flush the losing key parity bits. */
70 kword[0] = (*keychar++) >> 1;
72 kword[0] += (*keychar++) >> 1;
74 kword[0] += (*keychar++) >> 1;
76 kword[0] += (*keychar++) >> 1;
77 kword[1] = kword[0] >> 4; /* get top 24 bits for hi word */
80 kword[0] += (*keychar++) >> 1;
82 kword[0] += (*keychar++) >> 1;
84 kword[0] += (*keychar++) >> 1;
86 kword[0] += (*keychar) >> 1;
88 schedule[0] = kword[0];
89 for (i=1; i<ROUNDS; i++) {
91 temp = kword[0] & ((1<<11)-1); /* get 11 lsb */
92 kword[0] = (kword[0] >> 11) | ((kword[1] & ((1<<11)-1)) << (32-11));
93 kword[1] = (kword[1] >> 11) | (temp << (56-32-11));
94 schedule[i] = kword[0];
97 rxkad_stats.fc_key_scheds++;
102 afs_int32 fc_ecb_encrypt(clear, cipher, schedule, encrypt)
103 IN afs_uint32 *clear;
104 OUT afs_uint32 *cipher;
105 IN fc_KeySchedule schedule;
106 IN int encrypt; /* 0 ==> decrypt, else encrypt */
109 unsigned char *Pchar = (unsigned char *)&P;
110 unsigned char *Schar = (unsigned char *)&S;
113 #if defined(vax) || (defined(mips) && defined(MIPSEL)) || defined(AFSLITTLE_ENDIAN)
126 bcopy (clear, &L, sizeof(afs_int32));
127 bcopy (clear+1, &R, sizeof(afs_int32));
130 R = ntohl(*(clear+1));
135 rxkad_stats.fc_encrypts[ENCRYPT]++;
137 for (i=0; i<(ROUNDS/2); i++) {
138 S = *schedule++ ^ R; /* xor R with key bits from schedule */
139 Pchar[Byte2] = sbox0[Schar[Byte0]]; /* do 8-bit S Box subst. */
140 Pchar[Byte3] = sbox1[Schar[Byte1]]; /* and permute the result */
141 Pchar[Byte1] = sbox2[Schar[Byte2]];
142 Pchar[Byte0] = sbox3[Schar[Byte3]];
143 P = (P >> 5) | ((P & ((1<<5)-1)) << (32-5)); /* right rot 5 bits */
144 L ^= P; /* we're done with L, so save there */
145 S = *schedule++ ^ L; /* this time xor with L */
146 Pchar[Byte2] = sbox0[Schar[Byte0]];
147 Pchar[Byte3] = sbox1[Schar[Byte1]];
148 Pchar[Byte1] = sbox2[Schar[Byte2]];
149 Pchar[Byte0] = sbox3[Schar[Byte3]];
150 P = (P >> 5) | ((P & ((1<<5)-1)) << (32-5)); /* right rot 5 bits */
156 rxkad_stats.fc_encrypts[DECRYPT]++;
158 schedule = &schedule[ROUNDS-1]; /* start at end of key schedule */
159 for (i=0; i<(ROUNDS/2); i++) {
160 S = *schedule-- ^ L; /* xor R with key bits from schedule */
161 Pchar[Byte2] = sbox0[Schar[Byte0]]; /* do 8-bit S Box subst. and */
162 Pchar[Byte3] = sbox1[Schar[Byte1]]; /* permute the result */
163 Pchar[Byte1] = sbox2[Schar[Byte2]];
164 Pchar[Byte0] = sbox3[Schar[Byte3]];
165 P = (P >> 5) | ((P & ((1<<5)-1)) << (32-5)); /* right rot 5 bits */
166 R ^= P; /* we're done with L, so save there */
167 S = *schedule-- ^ R; /* this time xor with L */
168 Pchar[Byte2] = sbox0[Schar[Byte0]];
169 Pchar[Byte3] = sbox1[Schar[Byte1]];
170 Pchar[Byte1] = sbox2[Schar[Byte2]];
171 Pchar[Byte0] = sbox3[Schar[Byte3]];
172 P = (P >> 5) | ((P & ((1<<5)-1)) << (32-5)); /* right rot 5 bits */
177 bcopy (&L, cipher, sizeof(afs_int32));
178 bcopy (&R, cipher+1, sizeof(afs_int32));
181 *(cipher+1) = htonl(R);
186 /* Crypting can be done in segments by recycling xor. All but the final segment must
187 * be multiples of 8 bytes.
188 * NOTE: fc_cbc_encrypt now modifies its 5th argument, to permit chaining over
189 * scatter/gather vectors.
191 afs_int32 fc_cbc_encrypt (input, output, length, key, xor, encrypt)
194 afs_int32 length; /* in bytes */
195 int encrypt; /* 0 ==> decrypt, else encrypt */
196 fc_KeySchedule key; /* precomputed key schedule */
197 afs_uint32 *xor; /* 8 bytes of initialization vector */
199 afs_uint32 t_input[2];
200 afs_uint32 t_output[2];
201 unsigned char *t_in_p = (unsigned char *) t_input;
204 for (i = 0; length > 0; i++, length -= 8) {
206 bcopy (input, t_input, sizeof(t_input));
207 input += sizeof(t_input);
210 for (j = length; j <= 7; j++)
213 /* do the xor for cbc into the temp */
214 xor[0] ^= t_input[0] ;
215 xor[1] ^= t_input[1] ;
217 fc_ecb_encrypt (xor, t_output, key, encrypt);
219 /* copy temp output and save it for cbc */
220 bcopy (t_output, output, sizeof(t_output));
221 output += sizeof(t_output);
223 /* calculate xor value for next round from plain & cipher text */
224 xor[0] = t_input[0] ^ t_output[0];
225 xor[1] = t_input[1] ^ t_output[1];
234 for (i = 0; length > 0; i++, length -= 8) {
236 bcopy (input, t_input, sizeof(t_input));
237 input += sizeof(t_input);
239 /* no padding for decrypt */
240 fc_ecb_encrypt(t_input, t_output, key, encrypt);
242 /* do the xor for cbc into the output */
243 t_output[0] ^= xor[0] ;
244 t_output[1] ^= xor[1] ;
246 /* copy temp output */
247 bcopy (t_output, output, sizeof(t_output));
248 output += sizeof(t_output);
250 /* calculate xor value for next round from plain & cipher text */
251 xor[0] = t_input[0] ^ t_output[0];
252 xor[1] = t_input[1] ^ t_output[1];