des_setkey.c revision 1.4 1 /* $NetBSD: des_setkey.c,v 1.4 2001/02/21 21:39:53 jdolecek Exp $ */
2 /* $KAME: des_setkey.c,v 1.5 2000/11/06 13:58:09 itojun Exp $ */
3
4 /* crypto/des/set_key.c */
5 /* Copyright (C) 1995-1996 Eric Young (eay (at) mincom.oz.au)
6 * All rights reserved.
7 *
8 * This file is part of an SSL implementation written
9 * by Eric Young (eay (at) mincom.oz.au).
10 * The implementation was written so as to conform with Netscapes SSL
11 * specification. This library and applications are
12 * FREE FOR COMMERCIAL AND NON-COMMERCIAL USE
13 * as long as the following conditions are aheared to.
14 *
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed. If this code is used in a product,
17 * Eric Young should be given attribution as the author of the parts used.
18 * This can be in the form of a textual message at program startup or
19 * in documentation (online or textual) provided with the package.
20 *
21 * Redistribution and use in source and binary forms, with or without
22 * modification, are permitted provided that the following conditions
23 * are met:
24 * 1. Redistributions of source code must retain the copyright
25 * notice, this list of conditions and the following disclaimer.
26 * 2. Redistributions in binary form must reproduce the above copyright
27 * notice, this list of conditions and the following disclaimer in the
28 * documentation and/or other materials provided with the distribution.
29 * 3. All advertising materials mentioning features or use of this software
30 * must display the following acknowledgement:
31 * This product includes software developed by Eric Young (eay (at) mincom.oz.au)
32 *
33 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * SUCH DAMAGE.
44 *
45 * The licence and distribution terms for any publically available version or
46 * derivative of this code cannot be changed. i.e. this code cannot simply be
47 * copied and put under another distribution licence
48 * [including the GNU Public Licence.]
49 */
50
51 /* set_key.c v 1.4 eay 24/9/91
52 * 1.4 Speed up by 400% :-)
53 * 1.3 added register declarations.
54 * 1.2 unrolled make_key_sched a bit more
55 * 1.1 added norm_expand_bits
56 * 1.0 First working version
57 */
58 #include <sys/param.h>
59 #ifdef _KERNEL
60 #include <sys/systm.h>
61 #else
62 #include <string.h>
63 #endif
64 #include <crypto/des/des_locl.h>
65 #include <crypto/des/podd.h>
66 #include <crypto/des/sk.h>
67
68 static int check_parity __P((des_cblock (*)));
69
70 int des_check_key=0;
71
72 void des_set_odd_parity(key)
73 des_cblock (*key);
74 {
75 int i;
76
77 for (i=0; i<DES_KEY_SZ; i++)
78 (*key)[i]=odd_parity[(*key)[i]];
79 }
80
81 static int check_parity(key)
82 des_cblock (*key);
83 {
84 int i;
85
86 for (i=0; i<DES_KEY_SZ; i++)
87 {
88 if ((*key)[i] != odd_parity[(*key)[i]])
89 return(0);
90 }
91 return(1);
92 }
93
94 /* Weak and semi week keys as take from
95 * %A D.W. Davies
96 * %A W.L. Price
97 * %T Security for Computer Networks
98 * %I John Wiley & Sons
99 * %D 1984
100 * Many thanks to smb (at) ulysses.att.com (Steven Bellovin) for the reference
101 * (and actual cblock values).
102 */
103 #define NUM_WEAK_KEY 16
104 static const des_cblock weak_keys[NUM_WEAK_KEY]={
105 /* weak keys */
106 {0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01},
107 {0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE},
108 {0x1F,0x1F,0x1F,0x1F,0x1F,0x1F,0x1F,0x1F},
109 {0xE0,0xE0,0xE0,0xE0,0xE0,0xE0,0xE0,0xE0},
110 /* semi-weak keys */
111 {0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE},
112 {0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01},
113 {0x1F,0xE0,0x1F,0xE0,0x0E,0xF1,0x0E,0xF1},
114 {0xE0,0x1F,0xE0,0x1F,0xF1,0x0E,0xF1,0x0E},
115 {0x01,0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1},
116 {0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1,0x01},
117 {0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E,0xFE},
118 {0xFE,0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E},
119 {0x01,0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E},
120 {0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E,0x01},
121 {0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1,0xFE},
122 {0xFE,0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1}};
123
124 int des_is_weak_key(key)
125 des_cblock (*key);
126 {
127 int i;
128
129 for (i=0; i<NUM_WEAK_KEY; i++)
130 /* Added == 0 to comparision, I obviously don't run
131 * this section very often :-(, thanks to
132 * engineering (at) MorningStar.Com for the fix
133 * eay 93/06/29 */
134 /*
135 if (memcmp(weak_keys[i],key,sizeof(key)) == 0) return(1);
136 */
137 if (bcmp(weak_keys[i],key,sizeof(key)) == 0) return(1);
138 return(0);
139 }
140
141 /* NOW DEFINED IN des_local.h
142 * See ecb_encrypt.c for a pseudo description of these macros.
143 * #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
144 * (b)^=(t),\
145 * (a)=((a)^((t)<<(n))))
146 */
147
148 #define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)),\
149 (a)=(a)^(t)^(t>>(16-(n))))
150
151 /* return 0 if key parity is odd (correct),
152 * return -1 if key parity error,
153 * return -2 if illegal weak key.
154 */
155 int des_set_key(key, schedule)
156 des_cblock (*key);
157 des_key_schedule schedule;
158 {
159 static const int shifts2[16]={0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,0};
160 register DES_LONG c,d,t,s;
161 register unsigned char *in;
162 register DES_LONG *k;
163 register int i;
164
165 if (des_check_key)
166 {
167 if (!check_parity(key))
168 return(-1);
169
170 if (des_is_weak_key(key))
171 return(-2);
172 }
173
174 k=(DES_LONG *)schedule;
175 in=(unsigned char *)key;
176
177 c2l(in,c);
178 c2l(in,d);
179
180 /* do PC1 in 60 simple operations */
181 /* PERM_OP(d,c,t,4,0x0f0f0f0fL);
182 HPERM_OP(c,t,-2, 0xcccc0000L);
183 HPERM_OP(c,t,-1, 0xaaaa0000L);
184 HPERM_OP(c,t, 8, 0x00ff0000L);
185 HPERM_OP(c,t,-1, 0xaaaa0000L);
186 HPERM_OP(d,t,-8, 0xff000000L);
187 HPERM_OP(d,t, 8, 0x00ff0000L);
188 HPERM_OP(d,t, 2, 0x33330000L);
189 d=((d&0x00aa00aaL)<<7L)|((d&0x55005500L)>>7L)|(d&0xaa55aa55L);
190 d=(d>>8)|((c&0xf0000000L)>>4);
191 c&=0x0fffffffL; */
192
193 /* I now do it in 47 simple operations :-)
194 * Thanks to John Fletcher (john_fletcher (at) lccmail.ocf.llnl.gov)
195 * for the inspiration. :-) */
196 PERM_OP (d,c,t,4,0x0f0f0f0fL);
197 HPERM_OP(c,t,-2,0xcccc0000L);
198 HPERM_OP(d,t,-2,0xcccc0000L);
199 PERM_OP (d,c,t,1,0x55555555L);
200 PERM_OP (c,d,t,8,0x00ff00ffL);
201 PERM_OP (d,c,t,1,0x55555555L);
202 d= (((d&0x000000ffL)<<16L)| (d&0x0000ff00L) |
203 ((d&0x00ff0000L)>>16L)|((c&0xf0000000L)>>4L));
204 c&=0x0fffffffL;
205
206 for (i=0; i<ITERATIONS; i++)
207 {
208 if (shifts2[i])
209 { c=((c>>2L)|(c<<26L)); d=((d>>2L)|(d<<26L)); }
210 else
211 { c=((c>>1L)|(c<<27L)); d=((d>>1L)|(d<<27L)); }
212 c&=0x0fffffffL;
213 d&=0x0fffffffL;
214 /* could be a few less shifts but I am to lazy at this
215 * point in time to investigate */
216 s= des_skb[0][ (c )&0x3f ]|
217 des_skb[1][((c>> 6)&0x03)|((c>> 7L)&0x3c)]|
218 des_skb[2][((c>>13)&0x0f)|((c>>14L)&0x30)]|
219 des_skb[3][((c>>20)&0x01)|((c>>21L)&0x06) |
220 ((c>>22L)&0x38)];
221 t= des_skb[4][ (d )&0x3f ]|
222 des_skb[5][((d>> 7L)&0x03)|((d>> 8L)&0x3c)]|
223 des_skb[6][ (d>>15L)&0x3f ]|
224 des_skb[7][((d>>21L)&0x0f)|((d>>22L)&0x30)];
225
226 /* table contained 0213 4657 */
227 *(k++)=((t<<16L)|(s&0x0000ffffL))&0xffffffffL;
228 s= ((s>>16L)|(t&0xffff0000L));
229
230 s=(s<<4L)|(s>>28L);
231 *(k++)=s&0xffffffffL;
232 }
233 return(0);
234 }
235
236 int des_key_sched(key, schedule)
237 des_cblock (*key);
238 des_key_schedule schedule;
239 {
240 return(des_set_key(key,schedule));
241 }
242