1 /* 2 * Derived from: 3 * 4 * MDDRIVER.C - test driver for MD2, MD4 and MD5 5 */ 6 7 /* 8 * Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All 9 * rights reserved. 10 * 11 * RSA Data Security, Inc. makes no representations concerning either 12 * the merchantability of this software or the suitability of this 13 * software for any particular purpose. It is provided "as is" 14 * without express or implied warranty of any kind. 15 * 16 * These notices must be retained in any copies of any part of this 17 * documentation and/or software. 18 */ 19 20 #include <sys/cdefs.h> 21 __FBSDID("$FreeBSD$"); 22 23 #include <sys/types.h> 24 #include <sys/time.h> 25 #include <sys/resource.h> 26 #include <err.h> 27 #include <md5.h> 28 #include <ripemd.h> 29 #include <sha.h> 30 #include <sha256.h> 31 #include <sha512.h> 32 #include <stdio.h> 33 #include <stdlib.h> 34 #include <string.h> 35 #include <time.h> 36 #include <unistd.h> 37 38 /* 39 * Length of test block, number of test blocks. 40 */ 41 #define TEST_BLOCK_LEN 10000 42 #define TEST_BLOCK_COUNT 100000 43 #define MDTESTCOUNT 8 44 45 static int qflag; 46 static int rflag; 47 static int sflag; 48 static char* checkAgainst; 49 static int checksFailed; 50 51 typedef void (DIGEST_Init)(void *); 52 typedef void (DIGEST_Update)(void *, const unsigned char *, size_t); 53 typedef char *(DIGEST_End)(void *, char *); 54 55 extern const char *MD5TestOutput[MDTESTCOUNT]; 56 extern const char *SHA1_TestOutput[MDTESTCOUNT]; 57 extern const char *SHA256_TestOutput[MDTESTCOUNT]; 58 extern const char *SHA512_TestOutput[MDTESTCOUNT]; 59 extern const char *RIPEMD160_TestOutput[MDTESTCOUNT]; 60 61 typedef struct Algorithm_t { 62 const char *progname; 63 const char *name; 64 const char *(*TestOutput)[MDTESTCOUNT]; 65 DIGEST_Init *Init; 66 DIGEST_Update *Update; 67 DIGEST_End *End; 68 char *(*Data)(const void *, unsigned int, char *); 69 char *(*File)(const char *, char *); 70 } Algorithm_t; 71 72 static void MD5_Update(MD5_CTX *, const unsigned char *, size_t); 73 static void MDString(const Algorithm_t *, const char *); 74 static void MDTimeTrial(const Algorithm_t *); 75 static void MDTestSuite(const Algorithm_t *); 76 static void MDFilter(const Algorithm_t *, int); 77 static void usage(const Algorithm_t *); 78 79 typedef union { 80 MD5_CTX md5; 81 SHA1_CTX sha1; 82 SHA256_CTX sha256; 83 SHA512_CTX sha512; 84 RIPEMD160_CTX ripemd160; 85 } DIGEST_CTX; 86 87 /* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH, 88 SHA256_DIGEST_LENGTH, SHA512_DIGEST_LENGTH, 89 RIPEMD160_DIGEST_LENGTH)*2+1 */ 90 #define HEX_DIGEST_LENGTH 129 91 92 /* algorithm function table */ 93 94 static const struct Algorithm_t Algorithm[] = { 95 { "md5", "MD5", &MD5TestOutput, (DIGEST_Init*)&MD5Init, 96 (DIGEST_Update*)&MD5_Update, (DIGEST_End*)&MD5End, 97 &MD5Data, &MD5File }, 98 { "sha1", "SHA1", &SHA1_TestOutput, (DIGEST_Init*)&SHA1_Init, 99 (DIGEST_Update*)&SHA1_Update, (DIGEST_End*)&SHA1_End, 100 &SHA1_Data, &SHA1_File }, 101 { "sha256", "SHA256", &SHA256_TestOutput, (DIGEST_Init*)&SHA256_Init, 102 (DIGEST_Update*)&SHA256_Update, (DIGEST_End*)&SHA256_End, 103 &SHA256_Data, &SHA256_File }, 104 { "sha512", "SHA512", &SHA512_TestOutput, (DIGEST_Init*)&SHA512_Init, 105 (DIGEST_Update*)&SHA512_Update, (DIGEST_End*)&SHA512_End, 106 &SHA512_Data, &SHA512_File }, 107 { "rmd160", "RMD160", &RIPEMD160_TestOutput, 108 (DIGEST_Init*)&RIPEMD160_Init, (DIGEST_Update*)&RIPEMD160_Update, 109 (DIGEST_End*)&RIPEMD160_End, &RIPEMD160_Data, &RIPEMD160_File } 110 }; 111 112 static void 113 MD5_Update(MD5_CTX *c, const unsigned char *data, size_t len) 114 { 115 MD5Update(c, data, len); 116 } 117 118 /* Main driver. 119 120 Arguments (may be any combination): 121 -sstring - digests string 122 -t - runs time trial 123 -x - runs test script 124 filename - digests file 125 (none) - digests standard input 126 */ 127 int 128 main(int argc, char *argv[]) 129 { 130 int ch; 131 char *p; 132 char buf[HEX_DIGEST_LENGTH]; 133 int failed; 134 unsigned digest; 135 const char* progname; 136 137 if ((progname = strrchr(argv[0], '/')) == NULL) 138 progname = argv[0]; 139 else 140 progname++; 141 142 for (digest = 0; digest < sizeof(Algorithm)/sizeof(*Algorithm); digest++) 143 if (strcasecmp(Algorithm[digest].progname, progname) == 0) 144 break; 145 146 if (digest == sizeof(Algorithm)/sizeof(*Algorithm)) 147 digest = 0; 148 149 failed = 0; 150 checkAgainst = NULL; 151 checksFailed = 0; 152 while ((ch = getopt(argc, argv, "c:pqrs:tx")) != -1) 153 switch (ch) { 154 case 'c': 155 checkAgainst = optarg; 156 break; 157 case 'p': 158 MDFilter(&Algorithm[digest], 1); 159 break; 160 case 'q': 161 qflag = 1; 162 break; 163 case 'r': 164 rflag = 1; 165 break; 166 case 's': 167 sflag = 1; 168 MDString(&Algorithm[digest], optarg); 169 break; 170 case 't': 171 MDTimeTrial(&Algorithm[digest]); 172 break; 173 case 'x': 174 MDTestSuite(&Algorithm[digest]); 175 break; 176 default: 177 usage(&Algorithm[digest]); 178 } 179 argc -= optind; 180 argv += optind; 181 182 if (*argv) { 183 do { 184 p = Algorithm[digest].File(*argv, buf); 185 if (!p) { 186 warn("%s", *argv); 187 failed++; 188 } else { 189 if (qflag) 190 printf("%s", p); 191 else if (rflag) 192 printf("%s %s", p, *argv); 193 else 194 printf("%s (%s) = %s", 195 Algorithm[digest].name, *argv, p); 196 if (checkAgainst && strcmp(checkAgainst,p)) 197 { 198 checksFailed++; 199 if (!qflag) 200 printf(" [ Failed ]"); 201 } 202 printf("\n"); 203 } 204 } while (*++argv); 205 } else if (!sflag && (optind == 1 || qflag || rflag)) 206 MDFilter(&Algorithm[digest], 0); 207 208 if (failed != 0) 209 return (1); 210 if (checksFailed != 0) 211 return (2); 212 213 return (0); 214 } 215 /* 216 * Digests a string and prints the result. 217 */ 218 static void 219 MDString(const Algorithm_t *alg, const char *string) 220 { 221 size_t len = strlen(string); 222 char buf[HEX_DIGEST_LENGTH]; 223 224 alg->Data(string,len,buf); 225 if (qflag) 226 printf("%s", buf); 227 else if (rflag) 228 printf("%s \"%s\"", buf, string); 229 else 230 printf("%s (\"%s\") = %s", alg->name, string, buf); 231 if (checkAgainst && strcmp(buf,checkAgainst)) 232 { 233 checksFailed++; 234 if (!qflag) 235 printf(" [ failed ]"); 236 } 237 printf("\n"); 238 } 239 /* 240 * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks. 241 */ 242 static void 243 MDTimeTrial(const Algorithm_t *alg) 244 { 245 DIGEST_CTX context; 246 struct rusage before, after; 247 struct timeval total; 248 float seconds; 249 unsigned char block[TEST_BLOCK_LEN]; 250 unsigned int i; 251 char *p, buf[HEX_DIGEST_LENGTH]; 252 253 printf("%s time trial. Digesting %d %d-byte blocks ...", 254 alg->name, TEST_BLOCK_COUNT, TEST_BLOCK_LEN); 255 fflush(stdout); 256 257 /* Initialize block */ 258 for (i = 0; i < TEST_BLOCK_LEN; i++) 259 block[i] = (unsigned char) (i & 0xff); 260 261 /* Start timer */ 262 getrusage(RUSAGE_SELF, &before); 263 264 /* Digest blocks */ 265 alg->Init(&context); 266 for (i = 0; i < TEST_BLOCK_COUNT; i++) 267 alg->Update(&context, block, TEST_BLOCK_LEN); 268 p = alg->End(&context, buf); 269 270 /* Stop timer */ 271 getrusage(RUSAGE_SELF, &after); 272 timersub(&after.ru_utime, &before.ru_utime, &total); 273 seconds = total.tv_sec + (float) total.tv_usec / 1000000; 274 275 printf(" done\n"); 276 printf("Digest = %s", p); 277 printf("\nTime = %f seconds\n", seconds); 278 printf("Speed = %f bytes/second\n", 279 (float) TEST_BLOCK_LEN * (float) TEST_BLOCK_COUNT / seconds); 280 } 281 /* 282 * Digests a reference suite of strings and prints the results. 283 */ 284 285 static const char *MDTestInput[MDTESTCOUNT] = { 286 "", 287 "a", 288 "abc", 289 "message digest", 290 "abcdefghijklmnopqrstuvwxyz", 291 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", 292 "12345678901234567890123456789012345678901234567890123456789012345678901234567890", 293 "MD5 has not yet (2001-09-03) been broken, but sufficient attacks have been made \ 294 that its security is in some doubt" 295 }; 296 297 const char *MD5TestOutput[MDTESTCOUNT] = { 298 "d41d8cd98f00b204e9800998ecf8427e", 299 "0cc175b9c0f1b6a831c399e269772661", 300 "900150983cd24fb0d6963f7d28e17f72", 301 "f96b697d7cb7938d525a2f31aaf161d0", 302 "c3fcd3d76192e4007dfb496cca67e13b", 303 "d174ab98d277d9f5a5611c2c9f419d9f", 304 "57edf4a22be3c955ac49da2e2107b67a", 305 "b50663f41d44d92171cb9976bc118538" 306 }; 307 308 const char *SHA1_TestOutput[MDTESTCOUNT] = { 309 "da39a3ee5e6b4b0d3255bfef95601890afd80709", 310 "86f7e437faa5a7fce15d1ddcb9eaeaea377667b8", 311 "a9993e364706816aba3e25717850c26c9cd0d89d", 312 "c12252ceda8be8994d5fa0290a47231c1d16aae3", 313 "32d10c7b8cf96570ca04ce37f2a19d84240d3a89", 314 "761c457bf73b14d27e9e9265c46f4b4dda11f940", 315 "50abf5706a150990a08b2c5ea40fa0e585554732", 316 "18eca4333979c4181199b7b4fab8786d16cf2846" 317 }; 318 319 const char *SHA256_TestOutput[MDTESTCOUNT] = { 320 "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", 321 "ca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb", 322 "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad", 323 "f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650", 324 "71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73", 325 "db4bfcbd4da0cd85a60c3c37d3fbd8805c77f15fc6b1fdfe614ee0a7c8fdb4c0", 326 "f371bc4a311f2b009eef952dd83ca80e2b60026c8e935592d0f9c308453c813e", 327 "e6eae09f10ad4122a0e2a4075761d185a272ebd9f5aa489e998ff2f09cbfdd9f" 328 }; 329 330 const char *SHA512_TestOutput[MDTESTCOUNT] = { 331 "cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e", 332 "1f40fc92da241694750979ee6cf582f2d5d7d28e18335de05abc54d0560e0f5302860c652bf08d560252aa5e74210546f369fbbbce8c12cfc7957b2652fe9a75", 333 "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f", 334 "107dbf389d9e9f71a3a95f6c055b9251bc5268c2be16d6c13492ea45b0199f3309e16455ab1e96118e8a905d5597b72038ddb372a89826046de66687bb420e7c", 335 "4dbff86cc2ca1bae1e16468a05cb9881c97f1753bce3619034898faa1aabe429955a1bf8ec483d7421fe3c1646613a59ed5441fb0f321389f77f48a879c7b1f1", 336 "1e07be23c26a86ea37ea810c8ec7809352515a970e9253c26f536cfc7a9996c45c8370583e0a78fa4a90041d71a4ceab7423f19c71b9d5a3e01249f0bebd5894", 337 "72ec1ef1124a45b047e8b7c75a932195135bb61de24ec0d1914042246e0aec3a2354e093d76f3048b456764346900cb130d2a4fd5dd16abb5e30bcb850dee843", 338 "e8a835195e039708b13d9131e025f4441dbdc521ce625f245a436dcd762f54bf5cb298d96235e6c6a304e087ec8189b9512cbdf6427737ea82793460c367b9c3" 339 }; 340 341 const char *RIPEMD160_TestOutput[MDTESTCOUNT] = { 342 "9c1185a5c5e9fc54612808977ee8f548b2258d31", 343 "0bdc9d2d256b3ee9daae347be6f4dc835a467ffe", 344 "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc", 345 "5d0689ef49d2fae572b881b123a85ffa21595f36", 346 "f71c27109c692c1b56bbdceb5b9d2865b3708dbc", 347 "b0e20b6e3116640286ed3a87a5713079b21f5189", 348 "9b752e45573d4b39f4dbd3323cab82bf63326bfb", 349 "5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32" 350 }; 351 352 static void 353 MDTestSuite(const Algorithm_t *alg) 354 { 355 int i; 356 char buffer[HEX_DIGEST_LENGTH]; 357 358 printf("%s test suite:\n", alg->name); 359 for (i = 0; i < MDTESTCOUNT; i++) { 360 (*alg->Data)(MDTestInput[i], strlen(MDTestInput[i]), buffer); 361 printf("%s (\"%s\") = %s", alg->name, MDTestInput[i], buffer); 362 if (strcmp(buffer, (*alg->TestOutput)[i]) == 0) 363 printf(" - verified correct\n"); 364 else 365 printf(" - INCORRECT RESULT!\n"); 366 } 367 } 368 369 /* 370 * Digests the standard input and prints the result. 371 */ 372 static void 373 MDFilter(const Algorithm_t *alg, int tee) 374 { 375 DIGEST_CTX context; 376 unsigned int len; 377 unsigned char buffer[BUFSIZ]; 378 char buf[HEX_DIGEST_LENGTH]; 379 380 alg->Init(&context); 381 while ((len = fread(buffer, 1, BUFSIZ, stdin))) { 382 if (tee && len != fwrite(buffer, 1, len, stdout)) 383 err(1, "stdout"); 384 alg->Update(&context, buffer, len); 385 } 386 printf("%s\n", alg->End(&context, buf)); 387 } 388 389 static void 390 usage(const Algorithm_t *alg) 391 { 392 393 fprintf(stderr, "usage: %s [-pqrtx] [-c string] [-s string] [files ...]\n", alg->progname); 394 exit(1); 395 } 396