4 * MDDRIVER.C - test driver for MD2, MD4 and MD5
6 * $FreeBSD: src/sbin/md5/md5.c,v 1.35 2006/01/17 15:35:57 phk Exp $
10 * Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
13 * RSA Data Security, Inc. makes no representations concerning either
14 * the merchantability of this software or the suitability of this
15 * software for any particular purpose. It is provided "as is"
16 * without express or implied warranty of any kind.
18 * These notices must be retained in any copies of any part of this
19 * documentation and/or software.
23 #include <sys/types.h>
26 #include <sys/resource.h>
41 * Length of test block, number of test blocks.
43 #define TEST_BLOCK_LEN 10000
44 #define TEST_BLOCK_COUNT 100000
51 typedef void (DIGEST_Init)(void *);
52 typedef void (DIGEST_Update)(void *, const unsigned char *, size_t);
53 typedef char *(DIGEST_End)(void *, char *);
55 extern const char *MD5TestOutput[MDTESTCOUNT];
56 extern const char *SHA1_TestOutput[MDTESTCOUNT];
57 extern const char *SHA256_TestOutput[MDTESTCOUNT];
58 extern const char *RIPEMD160_TestOutput[MDTESTCOUNT];
60 typedef struct Algorithm_t {
63 const char *(*TestOutput)[MDTESTCOUNT];
65 DIGEST_Update *Update;
67 char *(*Data)(const void *, unsigned int, char *);
68 char *(*File)(const char *, char *);
71 static void MD5_Update(MD5_CTX *, const unsigned char *, size_t);
72 static void MDString(Algorithm_t *, const char *);
73 static void MDTimeTrial(Algorithm_t *);
74 static void MDTestSuite(Algorithm_t *);
75 static void MDFilter(Algorithm_t *, int);
76 static void usage(int excode);
82 RIPEMD160_CTX ripemd160;
85 /* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH,
86 SHA256_DIGEST_LENGTH, RIPEMD160_DIGEST_LENGTH)*2+1 */
87 #define HEX_DIGEST_LENGTH 65
89 /* algorithm function table */
91 struct Algorithm_t Algorithm[] = {
92 { "md5", "MD5", &MD5TestOutput, (DIGEST_Init*)&MD5Init,
93 (DIGEST_Update*)&MD5_Update, (DIGEST_End*)&MD5End,
95 { "sha1", "SHA1", &SHA1_TestOutput, (DIGEST_Init*)&SHA1_Init,
96 (DIGEST_Update*)&SHA1_Update, (DIGEST_End*)&SHA1_End,
97 &SHA1_Data, &SHA1_File },
98 { "sha256", "SHA256", &SHA256_TestOutput, (DIGEST_Init*)&SHA256_Init,
99 (DIGEST_Update*)&SHA256_Update, (DIGEST_End*)&SHA256_End,
100 &SHA256_Data, &SHA256_File },
101 { "rmd160", "RMD160", &RIPEMD160_TestOutput,
102 (DIGEST_Init*)&RIPEMD160_Init, (DIGEST_Update*)&RIPEMD160_Update,
103 (DIGEST_End*)&RIPEMD160_End, &RIPEMD160_Data, &RIPEMD160_File }
107 MD5_Update(MD5_CTX *c, const unsigned char *data, size_t len)
109 MD5Update(c, data, len);
113 * There is no need to use a huge mmap, just pick something
116 #define MAXMMAP (32*1024*1024)
119 digestfile(const char *fname, char *buf, const Algorithm_t *alg,
120 off_t *beginp, off_t *endp)
128 off_t end = *endp, begin = *beginp;
131 fd = open(fname, O_RDONLY);
133 warn("can't open %s", fname);
137 if (fstat(fd, &st) == -1) {
138 warn("can't fstat %s after opening", fname);
142 /* Non-positive end means, it has to be counted from the back: */
145 /* Negative begin means, it has to be counted from the back: */
149 if (begin < 0 || end < 0 || begin > st.st_size || end > st.st_size) {
150 warnx("%s is %jd bytes long, not large enough for the "
151 "specified offsets [%jd-%jd]", fname,
152 (intmax_t)st.st_size,
153 (intmax_t)*beginp, (intmax_t)*endp);
157 warnx("%s is %jd bytes long. Begin-offset %jd (%jd) is "
158 "larger than end-offset %jd (%jd)",
159 fname, (intmax_t)st.st_size,
160 (intmax_t)begin, (intmax_t)*beginp,
161 (intmax_t)end, (intmax_t)*endp);
170 pagesize = getpagesize();
175 if (end - begin > MAXMMAP)
180 map = mmap(NULL, size, PROT_READ, MAP_NOCORE, fd, begin);
181 if (map == MAP_FAILED) {
182 warn("mmaping of %s between %jd and %jd ",
183 fname, (intmax_t)begin, (intmax_t)begin + size);
187 * Try to give kernel a hint. Not that it
188 * cares at the time of this writing :-(
191 madvise(map, size, MADV_SEQUENTIAL);
192 alg->Update(&context, map, size);
195 } while (begin < end);
197 result = alg->End(&context, buf);
205 parseint(const char *arg)
207 double result; /* Use double to allow things like 0.5Kb */
210 result = strtod(arg, &endp);
214 result *= 1024; /* FALLTHROUGH */
217 result *= 1024; /* FALLTHROUGH */
221 if (endp[1] == 'b' || endp[1] == 'B')
223 result *= 1024; /* FALLTHROUGH */
227 warnx("%c (%d): unrecognized suffix", endp[0], (int)endp[0]);
235 errx(EX_USAGE, "`%s' is not a valid offset.", arg);
240 Arguments (may be any combination):
241 -sstring - digests string
243 -x - runs test script
244 filename - digests file
245 (none) - digests standard input
248 main(int argc, char *argv[])
252 char buf[HEX_DIGEST_LENGTH];
253 int failed, useoffsets = 0;
254 off_t begin = 0, end = 0; /* To shut compiler warning */
256 const char* progname;
258 if ((progname = strrchr(argv[0], '/')) == NULL)
263 for (digest = 0; digest < sizeof(Algorithm)/sizeof(*Algorithm); digest++)
264 if (strcasecmp(Algorithm[digest].progname, progname) == 0)
267 if (digest == sizeof(Algorithm)/sizeof(*Algorithm))
271 while ((ch = getopt(argc, argv, "hb:e:pqrs:tx")) != -1) {
274 begin = parseint(optarg);
278 end = parseint(optarg);
282 MDFilter(&Algorithm[digest], 1);
292 MDString(&Algorithm[digest], optarg);
295 MDTimeTrial(&Algorithm[digest]);
298 MDTestSuite(&Algorithm[digest]);
312 p = digestfile(*argv, buf, Algorithm + digest,
315 p = Algorithm[digest].File(*argv, buf);
317 /* digestfile() outputs its own diagnostics */
326 printf("%s %s[%jd-%jd]\n",
333 } else if (useoffsets) {
334 printf("%s (%s[%jd-%jd]) = %s\n",
335 Algorithm[digest].name, *argv,
340 printf("%s (%s) = %s\n",
341 Algorithm[digest].name,
346 } else if (!sflag && (optind == 1 || qflag || rflag))
347 MDFilter(&Algorithm[digest], 0);
355 * Digests a string and prints the result.
358 MDString(Algorithm_t *alg, const char *string)
360 size_t len = strlen(string);
361 char buf[HEX_DIGEST_LENGTH];
364 printf("%s\n", alg->Data(string, len, buf));
366 printf("%s \"%s\"\n", alg->Data(string, len, buf), string);
368 printf("%s (\"%s\") = %s\n", alg->name, string, alg->Data(string, len, buf));
371 * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks.
374 MDTimeTrial(Algorithm_t *alg)
377 struct rusage before, after;
378 struct timeval total;
380 unsigned char block[TEST_BLOCK_LEN];
382 char *p, buf[HEX_DIGEST_LENGTH];
385 ("%s time trial. Digesting %d %d-byte blocks ...",
386 alg->name, TEST_BLOCK_COUNT, TEST_BLOCK_LEN);
389 /* Initialize block */
390 for (i = 0; i < TEST_BLOCK_LEN; i++)
391 block[i] = (unsigned char) (i & 0xff);
394 getrusage(0, &before);
398 for (i = 0; i < TEST_BLOCK_COUNT; i++)
399 alg->Update(&context, block, TEST_BLOCK_LEN);
400 p = alg->End(&context, buf);
403 getrusage(0, &after);
404 timersub(&after.ru_utime, &before.ru_utime, &total);
405 seconds = total.tv_sec + (float) total.tv_usec / 1000000;
408 printf("Digest = %s", p);
409 printf("\nTime = %f seconds\n", seconds);
411 ("Speed = %f bytes/second\n",
412 (float) TEST_BLOCK_LEN * (float) TEST_BLOCK_COUNT / seconds);
415 * Digests a reference suite of strings and prints the results.
418 const char *MDTestInput[MDTESTCOUNT] = {
423 "abcdefghijklmnopqrstuvwxyz",
424 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
425 "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
426 "MD5 has not yet (2001-09-03) been broken, but sufficient attacks have been made \
427 that its security is in some doubt"
430 const char *MD5TestOutput[MDTESTCOUNT] = {
431 "d41d8cd98f00b204e9800998ecf8427e",
432 "0cc175b9c0f1b6a831c399e269772661",
433 "900150983cd24fb0d6963f7d28e17f72",
434 "f96b697d7cb7938d525a2f31aaf161d0",
435 "c3fcd3d76192e4007dfb496cca67e13b",
436 "d174ab98d277d9f5a5611c2c9f419d9f",
437 "57edf4a22be3c955ac49da2e2107b67a",
438 "b50663f41d44d92171cb9976bc118538"
441 const char *SHA1_TestOutput[MDTESTCOUNT] = {
442 "da39a3ee5e6b4b0d3255bfef95601890afd80709",
443 "86f7e437faa5a7fce15d1ddcb9eaeaea377667b8",
444 "a9993e364706816aba3e25717850c26c9cd0d89d",
445 "c12252ceda8be8994d5fa0290a47231c1d16aae3",
446 "32d10c7b8cf96570ca04ce37f2a19d84240d3a89",
447 "761c457bf73b14d27e9e9265c46f4b4dda11f940",
448 "50abf5706a150990a08b2c5ea40fa0e585554732",
449 "18eca4333979c4181199b7b4fab8786d16cf2846"
452 const char *SHA256_TestOutput[MDTESTCOUNT] = {
453 "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
454 "ca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb",
455 "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad",
456 "f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650",
457 "71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73",
458 "db4bfcbd4da0cd85a60c3c37d3fbd8805c77f15fc6b1fdfe614ee0a7c8fdb4c0",
459 "f371bc4a311f2b009eef952dd83ca80e2b60026c8e935592d0f9c308453c813e",
460 "e6eae09f10ad4122a0e2a4075761d185a272ebd9f5aa489e998ff2f09cbfdd9f"
463 const char *RIPEMD160_TestOutput[MDTESTCOUNT] = {
464 "9c1185a5c5e9fc54612808977ee8f548b2258d31",
465 "0bdc9d2d256b3ee9daae347be6f4dc835a467ffe",
466 "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc",
467 "5d0689ef49d2fae572b881b123a85ffa21595f36",
468 "f71c27109c692c1b56bbdceb5b9d2865b3708dbc",
469 "b0e20b6e3116640286ed3a87a5713079b21f5189",
470 "9b752e45573d4b39f4dbd3323cab82bf63326bfb",
471 "5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32"
475 MDTestSuite(Algorithm_t *alg)
478 char buffer[HEX_DIGEST_LENGTH];
480 printf("%s test suite:\n", alg->name);
481 for (i = 0; i < MDTESTCOUNT; i++) {
482 (*alg->Data)(MDTestInput[i], strlen(MDTestInput[i]), buffer);
483 printf("%s (\"%s\") = %s", alg->name, MDTestInput[i], buffer);
484 if (strcmp(buffer, (*alg->TestOutput)[i]) == 0)
485 printf(" - verified correct\n");
487 printf(" - INCORRECT RESULT!\n");
492 * Digests the standard input and prints the result.
495 MDFilter(Algorithm_t *alg, int tee)
499 unsigned char buffer[BUFSIZ];
500 char buf[HEX_DIGEST_LENGTH];
503 while ((len = fread(buffer, 1, BUFSIZ, stdin))) {
504 if (tee && len != fwrite(buffer, 1, len, stdout))
506 alg->Update(&context, buffer, len);
508 printf("%s\n", alg->End(&context, buf));
514 fprintf(stderr, "usage:\n\t%s [-pqrtx] [-b offset] [-e offset] "
515 "[-s string] [files ...]\n", getprogname());