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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
* $Source$
* $Author$
*
* Copyright 1985, 1986, 1987, 1988,1990 by the Massachusetts Institute
* of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America is assumed
* to require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
*
* Quadratic Congruential Manipulation Dectection Code
*
* ref: "Message Authentication"
* R.R. Jueneman, S. M. Matyas, C.H. Meyer
* IEEE Communications Magazine,
* Sept 1985 Vol 23 No 9 p 29-40
*
* This routine, part of the Athena DES library built for the Kerberos
* authentication system, calculates a manipulation detection code for
* a message. It is a much faster alternative to the DES-checksum
* method. No guarantees are offered for its security. Refer to the
* paper noted above for more information
*
* Implementation for 4.2bsd
* by S.P. Miller Project Athena/MIT
*/
/*
* Algorithm (per paper):
* define:
* message to be composed of n m-bit blocks X1,...,Xn
* optional secret seed S in block X1
* MDC in block Xn+1
* prime modulus N
* accumulator Z
* initial (secret) value of accumulator C
* N, C, and S are known at both ends
* C and , optionally, S, are hidden from the end users
* then
* (read array references as subscripts over time)
* Z[0] = c;
* for i = 1...n
* Z[i] = (Z[i+1] + X[i])**2 modulo N
* X[n+1] = Z[n] = MDC
*
* Then pick
* N = 2**31 -1
* m = 16
* iterate 4 times over plaintext, also use Zn
* from iteration j as seed for iteration j+1,
* total MDC is then a 128 bit array of the four
* Zn;
*
* return the last Zn and optionally, all
* four as output args.
*
* Modifications:
* To inhibit brute force searches of the seed space, this
* implementation is modified to have
* Z = 64 bit accumulator
* C = 64 bit C seed
* N = 2**63 - 1
* S = S seed is not implemented here
* arithmetic is not quite real double integer precision, since we
* cant get at the carry or high order results from multiply,
* but nontheless is 64 bit arithmetic.
*/
#ifndef lint
static char rcsid_quad_cksum_c[] =
"$Id$";
#endif /* lint */
/* System include files */
#include <stdio.h>
#include <errno.h>
/* Application include files */
#include <krb5/krb5.h>
#include <krb5/mit-des.h>
#include "des.h"
/* Definitions for byte swapping */
#ifdef LSBFIRST
#ifdef MUSTALIGN
static unsigned long vaxtohl();
static unsigned short vaxtohs();
#else /* ! MUSTALIGN */
#define vaxtohl(x) *((unsigned long *)(x))
#define vaxtohs(x) *((unsigned short *)(x))
#endif /* MUSTALIGN */
#else /* !LSBFIRST */
static unsigned long four_bytes_vax_to_nets();
#define vaxtohl(x) four_bytes_vax_to_nets((char *)(x))
static unsigned short two_bytes_vax_to_nets();
#define vaxtohs(x) two_bytes_vax_to_nets((char *)(x))
#endif
/* Externals */
extern char *errmsg();
extern int errno;
extern int des_debug;
/*** Routines ***************************************************** */
unsigned long
des_quad_cksum(in,out,length,out_count,c_seed)
mit_des_cblock *c_seed; /* secret seed, 8 bytes */
unsigned char *in; /* input block */
unsigned long *out; /* optional longer output */
int out_count; /* number of iterations */
long length; /* original length in bytes */
{
/*
* this routine both returns the low order of the final (last in
* time) 32bits of the checksum, and if "out" is not a null
* pointer, a longer version, up to entire 32 bytes of the
* checksum is written unto the address pointed to.
*/
register unsigned long z;
register unsigned long z2;
register unsigned long x;
register unsigned long x2;
register unsigned char *p;
register long len;
register int i;
/* use all 8 bytes of seed */
z = vaxtohl(c_seed);
z2 = vaxtohl((char *)c_seed+4);
if (out == NULL)
out_count = 1; /* default */
/* This is repeated n times!! */
for (i = 1; i <=4 && i<= out_count; i++) {
len = length;
p = in;
while (len) {
if (len > 1) {
x = (z + vaxtohs(p));
p += 2;
len -= 2;
}
else {
x = (z + *(unsigned char *)p++);
len = 0;
}
x2 = z2;
z = ((x * x) + (x2 * x2)) % 0x7fffffff;
z2 = (x * (x2+83653421)) % 0x7fffffff; /* modulo */
if (des_debug & 8)
printf("%d %d\n",z,z2);
}
if (out != NULL) {
*out++ = z;
*out++ = z2;
}
}
/* return final z value as 32 bit version of checksum */
return z;
}
#ifdef MSBFIRST
static unsigned short two_bytes_vax_to_nets(p)
char *p;
{
union {
char pieces[2];
unsigned short result;
} short_conv;
short_conv.pieces[0] = p[1];
short_conv.pieces[1] = p[0];
return(short_conv.result);
}
static unsigned long four_bytes_vax_to_nets(p)
char *p;
{
static union {
char pieces[4];
unsigned long result;
} long_conv;
long_conv.pieces[0] = p[3];
long_conv.pieces[1] = p[2];
long_conv.pieces[2] = p[1];
long_conv.pieces[3] = p[0];
return(long_conv.result);
}
#endif
#ifdef LSBFIRST
#ifdef MUSTALIGN
static unsigned long vaxtohl(x)
char *x;
{
unsigned long val;
bcopy(x, (char *)&val, sizeof(val));
return(val);
}
static unsigned short vaxtohs(x)
char *x;
{
unsigned short val;
bcopy(x, (char *)&val, sizeof(val));
return(val);
}
#endif /* MUSTALIGN */
#endif /* LSBFIRST */
|
