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>
44 * Length of test block, number of test blocks.
46 #define TEST_BLOCK_LEN 10000
47 #define TEST_BLOCK_COUNT 100000
54 typedef void (DIGEST_Init
)(void *);
55 typedef void (DIGEST_Update
)(void *, const unsigned char *, size_t);
56 typedef char *(DIGEST_End
)(void *, char *);
58 extern const char *MD5TestOutput
[MDTESTCOUNT
];
59 extern const char *SHA1_TestOutput
[MDTESTCOUNT
];
60 extern const char *SHA256_TestOutput
[MDTESTCOUNT
];
61 extern const char *SHA512_TestOutput
[MDTESTCOUNT
];
62 extern const char *RIPEMD160_TestOutput
[MDTESTCOUNT
];
64 typedef struct Algorithm_t
{
67 const char *(*TestOutput
)[MDTESTCOUNT
];
69 DIGEST_Update
*Update
;
71 char *(*Data
)(const void *, unsigned int, char *);
72 char *(*File
)(const char *, char *);
75 static void MDString(const Algorithm_t
*, const char *);
76 static void MDTimeTrial(const Algorithm_t
*);
77 static void MDTestSuite(const Algorithm_t
*);
78 static void MDFilter(const Algorithm_t
*, int);
79 static void usage(int excode
);
86 RIPEMD160_CTX ripemd160
;
89 /* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH,
90 SHA256_DIGEST_LENGTH, SHA512_DIGEST_LENGTH,
91 RIPEMD160_DIGEST_LENGTH)*2+1 */
92 #define HEX_DIGEST_LENGTH 129
94 /* algorithm function table */
96 static const struct Algorithm_t Algorithm
[] = {
97 { "md5", "MD5", &MD5TestOutput
, (DIGEST_Init
*)&MD5Init
,
98 (DIGEST_Update
*)&MD5Update
, (DIGEST_End
*)&MD5End
,
100 { "sha1", "SHA1", &SHA1_TestOutput
, (DIGEST_Init
*)&SHA1_Init
,
101 (DIGEST_Update
*)&SHA1_Update
, (DIGEST_End
*)&SHA1_End
,
102 &SHA1_Data
, &SHA1_File
},
103 { "sha256", "SHA256", &SHA256_TestOutput
, (DIGEST_Init
*)&SHA256_Init
,
104 (DIGEST_Update
*)&SHA256_Update
, (DIGEST_End
*)&SHA256_End
,
105 &SHA256_Data
, &SHA256_File
},
106 { "sha512", "SHA512", &SHA512_TestOutput
, (DIGEST_Init
*)&SHA512_Init
,
107 (DIGEST_Update
*)&SHA512_Update
, (DIGEST_End
*)&SHA512_End
,
108 &SHA512_Data
, &SHA512_File
},
109 { "rmd160", "RMD160", &RIPEMD160_TestOutput
,
110 (DIGEST_Init
*)&RIPEMD160_Init
, (DIGEST_Update
*)&RIPEMD160_Update
,
111 (DIGEST_End
*)&RIPEMD160_End
, &RIPEMD160_Data
, &RIPEMD160_File
}
115 * There is no need to use a huge mmap, just pick something
118 #define MAXMMAP (32*1024*1024)
121 digestfile(const char *fname
, char *buf
, const Algorithm_t
*alg
,
122 off_t
*beginp
, off_t
*endp
)
130 off_t end
= *endp
, begin
= *beginp
;
133 fd
= open(fname
, O_RDONLY
);
135 warn("can't open %s", fname
);
139 if (fstat(fd
, &st
) == -1) {
140 warn("can't fstat %s after opening", fname
);
144 /* Non-positive end means, it has to be counted from the back: */
147 /* Negative begin means, it has to be counted from the back: */
151 if (begin
< 0 || end
< 0 || begin
> st
.st_size
|| end
> st
.st_size
) {
152 warnx("%s is %jd bytes long, not large enough for the "
153 "specified offsets [%jd-%jd]", fname
,
154 (intmax_t)st
.st_size
,
155 (intmax_t)*beginp
, (intmax_t)*endp
);
159 warnx("%s is %jd bytes long. Begin-offset %jd (%jd) is "
160 "larger than end-offset %jd (%jd)",
161 fname
, (intmax_t)st
.st_size
,
162 (intmax_t)begin
, (intmax_t)*beginp
,
163 (intmax_t)end
, (intmax_t)*endp
);
172 pagesize
= getpagesize();
177 if (end
- begin
> MAXMMAP
)
182 map
= mmap(NULL
, size
, PROT_READ
, MAP_NOCORE
, fd
, begin
);
183 if (map
== MAP_FAILED
) {
184 warn("mmaping of %s between %jd and %jd ",
185 fname
, (intmax_t)begin
, (intmax_t)begin
+ size
);
189 * Try to give kernel a hint. Not that it
190 * cares at the time of this writing :-(
193 madvise(map
, size
, MADV_SEQUENTIAL
);
194 alg
->Update(&context
, map
, size
);
197 } while (begin
< end
);
199 result
= alg
->End(&context
, buf
);
207 parseint(const char *arg
)
209 double result
; /* Use double to allow things like 0.5Kb */
212 result
= strtod(arg
, &endp
);
216 result
*= 1024; /* FALLTHROUGH */
219 result
*= 1024; /* FALLTHROUGH */
223 if (endp
[1] == 'b' || endp
[1] == 'B')
225 result
*= 1024; /* FALLTHROUGH */
229 warnx("%c (%d): unrecognized suffix", endp
[0], (int)endp
[0]);
237 errx(EX_USAGE
, "`%s' is not a valid offset.", arg
);
242 Arguments (may be any combination):
243 -sstring - digests string
245 -x - runs test script
246 filename - digests file
247 (none) - digests standard input
250 main(int argc
, char *argv
[])
254 char buf
[HEX_DIGEST_LENGTH
];
255 int failed
, useoffsets
= 0;
256 off_t begin
= 0, end
= 0; /* To shut compiler warning */
258 const char* progname
;
260 if ((progname
= strrchr(argv
[0], '/')) == NULL
)
265 for (digest
= 0; digest
< sizeof(Algorithm
)/sizeof(*Algorithm
); digest
++)
266 if (strcasecmp(Algorithm
[digest
].progname
, progname
) == 0)
269 if (digest
== sizeof(Algorithm
)/sizeof(*Algorithm
))
273 while ((ch
= getopt(argc
, argv
, "hb:e:pqrs:tx")) != -1) {
276 begin
= parseint(optarg
);
280 end
= parseint(optarg
);
284 MDFilter(&Algorithm
[digest
], 1);
294 MDString(&Algorithm
[digest
], optarg
);
297 MDTimeTrial(&Algorithm
[digest
]);
300 MDTestSuite(&Algorithm
[digest
]);
314 p
= digestfile(*argv
, buf
, Algorithm
+ digest
,
317 p
= Algorithm
[digest
].File(*argv
, buf
);
319 /* digestfile() outputs its own diagnostics */
328 printf("%s %s[%jd-%jd]\n",
335 } else if (useoffsets
) {
336 printf("%s (%s[%jd-%jd]) = %s\n",
337 Algorithm
[digest
].name
, *argv
,
342 printf("%s (%s) = %s\n",
343 Algorithm
[digest
].name
,
348 } else if (!sflag
&& (optind
== 1 || qflag
|| rflag
))
349 MDFilter(&Algorithm
[digest
], 0);
357 * Digests a string and prints the result.
360 MDString(const Algorithm_t
*alg
, const char *string
)
362 size_t len
= strlen(string
);
363 char buf
[HEX_DIGEST_LENGTH
];
366 printf("%s\n", alg
->Data(string
, len
, buf
));
368 printf("%s \"%s\"\n", alg
->Data(string
, len
, buf
), string
);
370 printf("%s (\"%s\") = %s\n", alg
->name
, string
, alg
->Data(string
, len
, buf
));
373 * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks.
376 MDTimeTrial(const Algorithm_t
*alg
)
379 struct rusage before
, after
;
380 struct timeval total
;
382 unsigned char block
[TEST_BLOCK_LEN
];
384 char *p
, buf
[HEX_DIGEST_LENGTH
];
386 printf("%s time trial. Digesting %d %d-byte blocks ...",
387 alg
->name
, TEST_BLOCK_COUNT
, TEST_BLOCK_LEN
);
390 /* Initialize block */
391 for (i
= 0; i
< TEST_BLOCK_LEN
; i
++)
392 block
[i
] = (unsigned char) (i
& 0xff);
395 getrusage(RUSAGE_SELF
, &before
);
399 for (i
= 0; i
< TEST_BLOCK_COUNT
; i
++)
400 alg
->Update(&context
, block
, TEST_BLOCK_LEN
);
401 p
= alg
->End(&context
, buf
);
404 getrusage(RUSAGE_SELF
, &after
);
405 timersub(&after
.ru_utime
, &before
.ru_utime
, &total
);
406 seconds
= total
.tv_sec
+ (float) total
.tv_usec
/ 1000000;
409 printf("Digest = %s", p
);
410 printf("\nTime = %f seconds\n", seconds
);
411 printf("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 static 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 *SHA512_TestOutput
[MDTESTCOUNT
] = {
464 "cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e",
465 "1f40fc92da241694750979ee6cf582f2d5d7d28e18335de05abc54d0560e0f5302860c652bf08d560252aa5e74210546f369fbbbce8c12cfc7957b2652fe9a75",
466 "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f",
467 "107dbf389d9e9f71a3a95f6c055b9251bc5268c2be16d6c13492ea45b0199f3309e16455ab1e96118e8a905d5597b72038ddb372a89826046de66687bb420e7c",
468 "4dbff86cc2ca1bae1e16468a05cb9881c97f1753bce3619034898faa1aabe429955a1bf8ec483d7421fe3c1646613a59ed5441fb0f321389f77f48a879c7b1f1",
469 "1e07be23c26a86ea37ea810c8ec7809352515a970e9253c26f536cfc7a9996c45c8370583e0a78fa4a90041d71a4ceab7423f19c71b9d5a3e01249f0bebd5894",
470 "72ec1ef1124a45b047e8b7c75a932195135bb61de24ec0d1914042246e0aec3a2354e093d76f3048b456764346900cb130d2a4fd5dd16abb5e30bcb850dee843",
471 "e8a835195e039708b13d9131e025f4441dbdc521ce625f245a436dcd762f54bf5cb298d96235e6c6a304e087ec8189b9512cbdf6427737ea82793460c367b9c3"
474 const char *RIPEMD160_TestOutput
[MDTESTCOUNT
] = {
475 "9c1185a5c5e9fc54612808977ee8f548b2258d31",
476 "0bdc9d2d256b3ee9daae347be6f4dc835a467ffe",
477 "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc",
478 "5d0689ef49d2fae572b881b123a85ffa21595f36",
479 "f71c27109c692c1b56bbdceb5b9d2865b3708dbc",
480 "b0e20b6e3116640286ed3a87a5713079b21f5189",
481 "9b752e45573d4b39f4dbd3323cab82bf63326bfb",
482 "5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32"
486 MDTestSuite(const Algorithm_t
*alg
)
489 char buffer
[HEX_DIGEST_LENGTH
];
491 printf("%s test suite:\n", alg
->name
);
492 for (i
= 0; i
< MDTESTCOUNT
; i
++) {
493 (*alg
->Data
)(MDTestInput
[i
], strlen(MDTestInput
[i
]), buffer
);
494 printf("%s (\"%s\") = %s", alg
->name
, MDTestInput
[i
], buffer
);
495 if (strcmp(buffer
, (*alg
->TestOutput
)[i
]) == 0)
496 printf(" - verified correct\n");
498 printf(" - INCORRECT RESULT!\n");
503 * Digests the standard input and prints the result.
506 MDFilter(const Algorithm_t
*alg
, int tee
)
510 unsigned char buffer
[BUFSIZ
];
511 char buf
[HEX_DIGEST_LENGTH
];
514 while ((len
= fread(buffer
, 1, BUFSIZ
, stdin
))) {
515 if (tee
&& len
!= fwrite(buffer
, 1, len
, stdout
))
517 alg
->Update(&context
, buffer
, len
);
519 printf("%s\n", alg
->End(&context
, buf
));
525 fprintf(stderr
, "usage:\n\t%s [-pqrtx] [-b offset] [-e offset] "
526 "[-s string] [files ...]\n", getprogname());