]> git.saurik.com Git - apple/xnu.git/blob - bsd/crypto/des/des_setkey.c
72b4d1a48492ba2f3cf86951007b4d3b0f3747b8
[apple/xnu.git] / bsd / crypto / des / des_setkey.c
1 /* $FreeBSD: src/sys/crypto/des/des_setkey.c,v 1.1.2.3 2001/07/10 09:46:35 ume Exp $ */
2 /* $KAME: des_setkey.c,v 1.6 2001/07/03 14:27:53 itojun Exp $ */
3
4 /* crypto/des/set_key.c */
5 /* Copyright (C) 1995-1996 Eric Young (eay@mincom.oz.au)
6 * All rights reserved.
7 *
8 * This file is part of 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 * 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@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 #include <sys/systm.h>
60 #include <crypto/des/des_locl.h>
61 #include <crypto/des/podd.h>
62 #include <crypto/des/sk.h>
63
64 static int check_parity __P((des_cblock (*)));
65
66 int des_check_key=0;
67
68 void des_set_odd_parity(key)
69 des_cblock (*key);
70 {
71 int i;
72
73 for (i=0; i<DES_KEY_SZ; i++)
74 (*key)[i]=odd_parity[(*key)[i]];
75 }
76
77 static int check_parity(key)
78 des_cblock (*key);
79 {
80 int i;
81
82 for (i=0; i<DES_KEY_SZ; i++)
83 {
84 if ((*key)[i] != odd_parity[(*key)[i]])
85 return(0);
86 }
87 return(1);
88 }
89
90 /* Weak and semi week keys as take from
91 * %A D.W. Davies
92 * %A W.L. Price
93 * %T Security for Computer Networks
94 * %I John Wiley & Sons
95 * %D 1984
96 * Many thanks to smb@ulysses.att.com (Steven Bellovin) for the reference
97 * (and actual cblock values).
98 */
99 #define NUM_WEAK_KEY 16
100 static des_cblock weak_keys[NUM_WEAK_KEY]={
101 /* weak keys */
102 {0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01},
103 {0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE},
104 {0x1F,0x1F,0x1F,0x1F,0x1F,0x1F,0x1F,0x1F},
105 {0xE0,0xE0,0xE0,0xE0,0xE0,0xE0,0xE0,0xE0},
106 /* semi-weak keys */
107 {0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE},
108 {0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01},
109 {0x1F,0xE0,0x1F,0xE0,0x0E,0xF1,0x0E,0xF1},
110 {0xE0,0x1F,0xE0,0x1F,0xF1,0x0E,0xF1,0x0E},
111 {0x01,0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1},
112 {0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1,0x01},
113 {0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E,0xFE},
114 {0xFE,0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E},
115 {0x01,0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E},
116 {0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E,0x01},
117 {0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1,0xFE},
118 {0xFE,0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1}};
119
120 int des_is_weak_key(key)
121 des_cblock (*key);
122 {
123 int i;
124
125 for (i=0; i<NUM_WEAK_KEY; i++)
126 /* Added == 0 to comparision, I obviously don't run
127 * this section very often :-(, thanks to
128 * engineering@MorningStar.Com for the fix
129 * eay 93/06/29 */
130 if (bcmp(weak_keys[i],key,sizeof(*key)) == 0) return(1);
131 return(0);
132 }
133
134 /* NOW DEFINED IN des_local.h
135 * See ecb_encrypt.c for a pseudo description of these macros.
136 * #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
137 * (b)^=(t),\
138 * (a)=((a)^((t)<<(n))))
139 */
140
141 #define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)),\
142 (a)=(a)^(t)^(t>>(16-(n))))
143
144 /* return 0 if key parity is odd (correct),
145 * return -1 if key parity error,
146 * return -2 if illegal weak key.
147 */
148 int des_set_key(key, schedule)
149 des_cblock (*key);
150 des_key_schedule schedule;
151 {
152 static int shifts2[16]={0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,0};
153 register DES_LONG c,d,t,s;
154 register unsigned char *in;
155 register DES_LONG *k;
156 register int i;
157
158 if (des_check_key)
159 {
160 if (!check_parity(key))
161 return(-1);
162
163 if (des_is_weak_key(key))
164 return(-2);
165 }
166
167 k=(DES_LONG *)schedule;
168 in=(unsigned char *)key;
169
170 c2l(in,c);
171 c2l(in,d);
172
173 /* do PC1 in 60 simple operations */
174 /* PERM_OP(d,c,t,4,0x0f0f0f0fL);
175 HPERM_OP(c,t,-2, 0xcccc0000L);
176 HPERM_OP(c,t,-1, 0xaaaa0000L);
177 HPERM_OP(c,t, 8, 0x00ff0000L);
178 HPERM_OP(c,t,-1, 0xaaaa0000L);
179 HPERM_OP(d,t,-8, 0xff000000L);
180 HPERM_OP(d,t, 8, 0x00ff0000L);
181 HPERM_OP(d,t, 2, 0x33330000L);
182 d=((d&0x00aa00aaL)<<7L)|((d&0x55005500L)>>7L)|(d&0xaa55aa55L);
183 d=(d>>8)|((c&0xf0000000L)>>4);
184 c&=0x0fffffffL; */
185
186 /* I now do it in 47 simple operations :-)
187 * Thanks to John Fletcher (john_fletcher@lccmail.ocf.llnl.gov)
188 * for the inspiration. :-) */
189 PERM_OP (d,c,t,4,0x0f0f0f0fL);
190 HPERM_OP(c,t,-2,0xcccc0000L);
191 HPERM_OP(d,t,-2,0xcccc0000L);
192 PERM_OP (d,c,t,1,0x55555555L);
193 PERM_OP (c,d,t,8,0x00ff00ffL);
194 PERM_OP (d,c,t,1,0x55555555L);
195 d= (((d&0x000000ffL)<<16L)| (d&0x0000ff00L) |
196 ((d&0x00ff0000L)>>16L)|((c&0xf0000000L)>>4L));
197 c&=0x0fffffffL;
198
199 for (i=0; i<ITERATIONS; i++)
200 {
201 if (shifts2[i])
202 { c=((c>>2L)|(c<<26L)); d=((d>>2L)|(d<<26L)); }
203 else
204 { c=((c>>1L)|(c<<27L)); d=((d>>1L)|(d<<27L)); }
205 c&=0x0fffffffL;
206 d&=0x0fffffffL;
207 /* could be a few less shifts but I am to lazy at this
208 * point in time to investigate */
209 s= des_skb[0][ (c )&0x3f ]|
210 des_skb[1][((c>> 6)&0x03)|((c>> 7L)&0x3c)]|
211 des_skb[2][((c>>13)&0x0f)|((c>>14L)&0x30)]|
212 des_skb[3][((c>>20)&0x01)|((c>>21L)&0x06) |
213 ((c>>22L)&0x38)];
214 t= des_skb[4][ (d )&0x3f ]|
215 des_skb[5][((d>> 7L)&0x03)|((d>> 8L)&0x3c)]|
216 des_skb[6][ (d>>15L)&0x3f ]|
217 des_skb[7][((d>>21L)&0x0f)|((d>>22L)&0x30)];
218
219 /* table contained 0213 4657 */
220 *(k++)=((t<<16L)|(s&0x0000ffffL))&0xffffffffL;
221 s= ((s>>16L)|(t&0xffff0000L));
222
223 s=(s<<4L)|(s>>28L);
224 *(k++)=s&0xffffffffL;
225 }
226 return(0);
227 }
228
229 int des_key_sched(key, schedule)
230 des_cblock (*key);
231 des_key_schedule schedule;
232 {
233 return(des_set_key(key,schedule));
234 }