blob: 04fc12bef570a9c741b61d93f3d270357db12645 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
* $Source$
* $Author$
*
* Copyright 1985, 1986, 1987, 1988 by the Massachusetts Institute
* of Technology.
*
* For copying and distribution information, please see the file
* <mit-copyright.h>.
*
* This routine computes the DES key schedule given a key. The
* permutations and shifts have been done at compile time, resulting
* in a direct one-step mapping from the input key to the key
* schedule.
*
* Also checks parity and weak keys.
*
* Watch out for the subscripts -- most effectively start at 1 instead
* of at zero. Maybe some bugs in that area.
*
* DON'T change the data types for arrays and such, or it will either
* break or run slower. This was optimized for Uvax2.
*
* In case the user wants to cache the computed key schedule, it is
* passed as an arg. Also implies that caller has explicit control
* over zeroing both the key schedule and the key.
*
* All registers labeled imply Vax using the Ultrix or 4.2bsd compiler.
*
* Originally written 6/85 by Steve Miller, MIT Project Athena.
*/
#ifndef lint
static char rcsid_key_sched_c[] =
"$Id$";
#endif
#include <mit-copyright.h>
#include <stdio.h>
#include "des.h"
int
des_key_sched(k,schedule)
register des_cblock k;
des_key_schedule schedule;
{
if (!des_check_key_parity(k)) /* bad parity --> return -1 */
return(-1);
/* check against weak keys */
if (des_is_weak_key(k))
return(-2);
make_key_sched(k,schedule);
/* if key was good, return 0 */
return 0;
}
|
