2 ** ********************************************************************
3 ** md4.c -- Implementation of MD4 Message Digest Algorithm **
4 ** Updated: 2/16/90 by Ronald L. Rivest **
5 ** (C) 1990 RSA Data Security, Inc. **
6 ** ********************************************************************
11 ** -- Include md4.h in your program
12 ** -- Declare an MDstruct MD to hold the state of the digest
14 ** -- Initialize MD using MDbegin(&MD)
15 ** -- For each full block (64 bytes) X you wish to process, call
16 ** MD4Update(&MD,X,512)
17 ** (512 is the number of bits in a full block.)
18 ** -- For the last block (less than 64 bytes) you wish to process,
20 ** where n is the number of bits in the partial block. A partial
21 ** block terminates the computation, so every MD computation
22 ** should terminate by processing a partial block, even if it
24 ** -- The message digest is available in MD.buffer[0] ...
25 ** MD.buffer[3]. (Least-significant byte of each word
26 ** should be output first.)
27 ** -- You can print out the digest using MDprint(&MD)
30 /* Implementation notes:
31 ** This implementation assumes that ints are 32-bit quantities.
37 /* Compile-time includes
43 /* Compile-time declarations of MD4 "magic constants".
45 #define I0 0x67452301 /* Initial values for MD buffer */
49 #define C2 013240474631 /* round 2 constant = sqrt(2) in octal */
50 #define C3 015666365641 /* round 3 constant = sqrt(3) in octal */
51 /* C2 and C3 are from Knuth, The Art of Programming, Volume 2
52 ** (Seminumerical Algorithms), Second Edition (1981), Addison-Wesley.
56 #define fs1 3 /* round 1 shift amounts */
60 #define gs1 3 /* round 2 shift amounts */
64 #define hs1 3 /* round 3 shift amounts */
69 /* Compile-time macro declarations for MD4.
70 ** Note: The "rot" operator uses the variable "tmp".
71 ** It assumes tmp is declared as unsigned int, so that the >>
72 ** operator will shift in zeros rather than extending the sign bit.
74 #define f(X,Y,Z) ((X&Y) | ((~X)&Z))
75 #define g(X,Y,Z) ((X&Y) | (X&Z) | (Y&Z))
76 #define h(X,Y,Z) (X^Y^Z)
77 #define rot(X,S) (tmp=X,(tmp<<S) | (tmp>>(32-S)))
78 #define ff(A,B,C,D,i,s) A = rot((A + f(B,C,D) + X[i]),s)
79 #define gg(A,B,C,D,i,s) A = rot((A + g(B,C,D) + X[i] + C2),s)
80 #define hh(A,B,C,D,i,s) A = rot((A + h(B,C,D) + X[i] + C3),s)
83 ** Print message digest buffer MDp as 32 hexadecimal digits.
84 ** Order is from low-order byte of buffer[0] to high-order byte of
86 ** Each byte is printed with high-order hexadecimal digit first.
87 ** This is a user-callable routine.
90 MD4Print(MD4_CTX *MDp)
95 printf("%02x",(MDp->buffer[i]>>j) & 0xFF);
99 ** Initialize message digest buffer MDp.
100 ** This is a user-callable routine.
103 MD4Init(MD4_CTX *MDp)
110 for (i=0;i<8;i++) MDp->count[i] = 0;
115 ** Update message digest buffer MDp->buffer using 16-word data block X.
116 ** Assumes all 16 words of X are full of data.
117 ** Does not update MDp->count.
118 ** This routine is not user-callable.
121 MDblock(MD4_CTX *MDp, unsigned char *Xb)
123 register unsigned int tmp, A, B, C, D;
127 for (i = 0; i < 16; ++i) {
128 X[i] = Xb[0] + (Xb[1] << 8) + (Xb[2] << 16) + (Xb[3] << 24);
136 /* Update the message digest buffer */
137 ff(A , B , C , D , 0 , fs1); /* Round 1 */
138 ff(D , A , B , C , 1 , fs2);
139 ff(C , D , A , B , 2 , fs3);
140 ff(B , C , D , A , 3 , fs4);
141 ff(A , B , C , D , 4 , fs1);
142 ff(D , A , B , C , 5 , fs2);
143 ff(C , D , A , B , 6 , fs3);
144 ff(B , C , D , A , 7 , fs4);
145 ff(A , B , C , D , 8 , fs1);
146 ff(D , A , B , C , 9 , fs2);
147 ff(C , D , A , B , 10 , fs3);
148 ff(B , C , D , A , 11 , fs4);
149 ff(A , B , C , D , 12 , fs1);
150 ff(D , A , B , C , 13 , fs2);
151 ff(C , D , A , B , 14 , fs3);
152 ff(B , C , D , A , 15 , fs4);
153 gg(A , B , C , D , 0 , gs1); /* Round 2 */
154 gg(D , A , B , C , 4 , gs2);
155 gg(C , D , A , B , 8 , gs3);
156 gg(B , C , D , A , 12 , gs4);
157 gg(A , B , C , D , 1 , gs1);
158 gg(D , A , B , C , 5 , gs2);
159 gg(C , D , A , B , 9 , gs3);
160 gg(B , C , D , A , 13 , gs4);
161 gg(A , B , C , D , 2 , gs1);
162 gg(D , A , B , C , 6 , gs2);
163 gg(C , D , A , B , 10 , gs3);
164 gg(B , C , D , A , 14 , gs4);
165 gg(A , B , C , D , 3 , gs1);
166 gg(D , A , B , C , 7 , gs2);
167 gg(C , D , A , B , 11 , gs3);
168 gg(B , C , D , A , 15 , gs4);
169 hh(A , B , C , D , 0 , hs1); /* Round 3 */
170 hh(D , A , B , C , 8 , hs2);
171 hh(C , D , A , B , 4 , hs3);
172 hh(B , C , D , A , 12 , hs4);
173 hh(A , B , C , D , 2 , hs1);
174 hh(D , A , B , C , 10 , hs2);
175 hh(C , D , A , B , 6 , hs3);
176 hh(B , C , D , A , 14 , hs4);
177 hh(A , B , C , D , 1 , hs1);
178 hh(D , A , B , C , 9 , hs2);
179 hh(C , D , A , B , 5 , hs3);
180 hh(B , C , D , A , 13 , hs4);
181 hh(A , B , C , D , 3 , hs1);
182 hh(D , A , B , C , 11 , hs2);
183 hh(C , D , A , B , 7 , hs3);
184 hh(B , C , D , A , 15 , hs4);
191 /* MD4Update(MDp,X,count)
192 ** Input: X -- a pointer to an array of unsigned characters.
193 ** count -- the number of bits of X to use.
194 ** (if not a multiple of 8, uses high bits of last byte.)
195 ** Update MDp using the number of bits of X given by count.
196 ** This is the basic input routine for an MD4 user.
197 ** The routine completes the MD computation when count < 512, so
198 ** every MD computation should end with one call to MD4Update with a
199 ** count less than 512. A call with count 0 will be ignored if the
200 ** MD has already been terminated (done != 0), so an extra call with
201 ** count 0 can be given as a "courtesy close" to force termination
205 MD4Update(MD4_CTX *MDp, unsigned char *X, unsigned int count)
207 unsigned int i, tmp, bit, byte, mask;
208 unsigned char XX[64];
211 /* return with no error if this is a courtesy close with count
212 ** zero and MDp->done is true.
214 if (count == 0 && MDp->done) return;
215 /* check to see if MD is already done and report error */
217 { printf("\nError: MD4Update MD already done."); return; }
219 /* Add count to MDp->count */
230 { /* Full block of data to handle */
233 else if (count > 512) /* Check for count too large */
235 printf("\nError: MD4Update called with illegal count value %d.",
239 else /* partial block -- must be last block so finish up */
241 /* Find out how many bytes and residual bits there are */
244 /* Copy X into XX since we need to modify it */
246 for (i=0;i<=byte;i++) XX[i] = X[i];
247 for (i=byte+1;i<64;i++) XX[i] = 0;
248 /* Add padding '1' bit and low-order zeros in last byte */
249 mask = 1 << (7 - bit);
250 XX[byte] = (XX[byte] | mask) & ~( mask - 1);
251 /* If room for bit count, finish up with this block */
254 for (i=0;i<8;i++) XX[56+i] = MDp->count[i];
257 else /* need to do two blocks to finish up */
260 for (i=0;i<56;i++) XX[i] = 0;
261 for (i=0;i<8;i++) XX[56+i] = MDp->count[i];
264 /* Set flag saying we're done with MD computation */
270 ** Finish up MD4 computation and return message digest.
273 MD4Final(unsigned char *buf, MD4_CTX *MD)
278 MD4Update(MD, NULL, 0);
279 for (i = 0; i < 4; ++i) {
281 for (j = 0; j < 4; ++j) {
290 ****************************(cut)***********************************/