rfc 1321 (rfc1321) - the md5 message-digest algorithm.htm

MD5算法的相关资料

 */
static void MD5_memset (output, value, len)
POINTER output;
int value;
unsigned int len;
{
  unsigned int i;

  for (i = 0; i < len; i++)
 ((char *)output)[i] = (char)value;
}

A.4 mddriver.c

/* MDDRIVER.C - test driver for MD2, MD4 and MD5
 */

/* Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
rights reserved.

RSA Data Security, Inc. makes no representations concerning either
the merchantability of this software or the suitability of this
software for any particular purpose. It is provided "as is"
without express or implied warranty of any kind.

These notices must be retained in any copies of any part of this
documentation and/or software.
 */

/* The following makes MD default to MD5 if it has not already been
  defined with C compiler flags.
 */
#ifndef MD
#define MD MD5
#endif

#include <stdio.h>
#include <time.h>
#include <string.h>
#include "global.h"
#if MD == 2
#include "md2.h"
#endif
#if MD == 4

#include "md4.h"
#endif
#if MD == 5
#include "md5.h"
#endif

/* Length of test block, number of test blocks.
 */
#define TEST_BLOCK_LEN 1000
#define TEST_BLOCK_COUNT 1000

static void MDString PROTO_LIST ((char *));
static void MDTimeTrial PROTO_LIST ((void));
static void MDTestSuite PROTO_LIST ((void));
static void MDFile PROTO_LIST ((char *));
static void MDFilter PROTO_LIST ((void));
static void MDPrint PROTO_LIST ((unsigned char [16]));

#if MD == 2
#define MD_CTX MD2_CTX
#define MDInit MD2Init
#define MDUpdate MD2Update
#define MDFinal MD2Final
#endif
#if MD == 4
#define MD_CTX MD4_CTX
#define MDInit MD4Init
#define MDUpdate MD4Update
#define MDFinal MD4Final
#endif
#if MD == 5
#define MD_CTX MD5_CTX
#define MDInit MD5Init
#define MDUpdate MD5Update
#define MDFinal MD5Final
#endif

/* Main driver.

Arguments (may be any combination):
  -sstring - digests string
  -t       - runs time trial
  -x       - runs test script
  filename - digests file
  (none)   - digests standard input
 */
int main (argc, argv)
int argc;

char *argv[];
{
  int i;

  if (argc > 1)
 for (i = 1; i < argc; i++)
   if (argv[i][0] == '-' && argv[i][1] == 's')
     MDString (argv[i] + 2);
   else if (strcmp (argv[i], "-t") == 0)
     MDTimeTrial ();
   else if (strcmp (argv[i], "-x") == 0)
     MDTestSuite ();
   else
     MDFile (argv[i]);
  else
 MDFilter ();

  return (0);
}

/* Digests a string and prints the result.
 */
static void MDString (string)
char *string;
{
  MD_CTX context;
  unsigned char digest[16];
  unsigned int len = strlen (string);

  MDInit (&context);
  MDUpdate (&context, string, len);
  MDFinal (digest, &context);

  printf ("MD%d (\"%s\") = ", MD, string);
  MDPrint (digest);
  printf ("\n");
}

/* Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte
  blocks.
 */
static void MDTimeTrial ()
{
  MD_CTX context;
  time_t endTime, startTime;
  unsigned char block[TEST_BLOCK_LEN], digest[16];
  unsigned int i;

  printf
 ("MD%d time trial. Digesting %d %d-byte blocks ...", MD,
  TEST_BLOCK_LEN, TEST_BLOCK_COUNT);

  /* Initialize block */
  for (i = 0; i < TEST_BLOCK_LEN; i++)
 block[i] = (unsigned char)(i & 0xff);

  /* Start timer */
  time (&startTime);

  /* Digest blocks */
  MDInit (&context);
  for (i = 0; i < TEST_BLOCK_COUNT; i++)
 MDUpdate (&context, block, TEST_BLOCK_LEN);
  MDFinal (digest, &context);

  /* Stop timer */
  time (&endTime);

  printf (" done\n");
  printf ("Digest = ");
  MDPrint (digest);
  printf ("\nTime = %ld seconds\n", (long)(endTime-startTime));
  printf
 ("Speed = %ld bytes/second\n",
  (long)TEST_BLOCK_LEN * (long)TEST_BLOCK_COUNT/(endTime-startTime));
}

/* Digests a reference suite of strings and prints the results.
 */
static void MDTestSuite ()
{
  printf ("MD%d test suite:\n", MD);

  MDString ("");
  MDString ("a");
  MDString ("abc");
  MDString ("message digest");
  MDString ("abcdefghijklmnopqrstuvwxyz");
  MDString
 ("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");
  MDString
 ("1234567890123456789012345678901234567890\
1234567890123456789012345678901234567890");
}

/* Digests a file and prints the result.

 */
static void MDFile (filename)
char *filename;
{
  FILE *file;
  MD_CTX context;
  int len;
  unsigned char buffer[1024], digest[16];

  if ((file = fopen (filename, "rb")) == NULL)
 printf ("%s can't be opened\n", filename);

  else {
 MDInit (&context);
 while (len = fread (buffer, 1, 1024, file))
   MDUpdate (&context, buffer, len);
 MDFinal (digest, &context);

 fclose (file);

 printf ("MD%d (%s) = ", MD, filename);
 MDPrint (digest);
 printf ("\n");
  }
}

/* Digests the standard input and prints the result.
 */
static void MDFilter ()
{
  MD_CTX context;
  int len;
  unsigned char buffer[16], digest[16];

  MDInit (&context);
  while (len = fread (buffer, 1, 16, stdin))
 MDUpdate (&context, buffer, len);
  MDFinal (digest, &context);

  MDPrint (digest);
  printf ("\n");
}

/* Prints a message digest in hexadecimal.
 */
static void MDPrint (digest)
unsigned char digest[16];
{

  unsigned int i;

  for (i = 0; i < 16; i++)
 printf ("%02x", digest[i]);
}

A.5 Test suite

   The MD5 test suite (driver option "-x") should print the following
   results:

MD5 test suite:
MD5 ("") = d41d8cd98f00b204e9800998ecf8427e
MD5 ("a") = 0cc175b9c0f1b6a831c399e269772661
MD5 ("abc") = 900150983cd24fb0d6963f7d28e17f72
MD5 ("message digest") = f96b697d7cb7938d525a2f31aaf161d0
MD5 ("abcdefghijklmnopqrstuvwxyz") = c3fcd3d76192e4007dfb496cca67e13b
MD5 ("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789") =
d174ab98d277d9f5a5611c2c9f419d9f
MD5 ("123456789012345678901234567890123456789012345678901234567890123456
78901234567890") = 57edf4a22be3c955ac49da2e2107b67a

Security Considerations

   The level of security discussed in this memo is considered to be
   sufficient for implementing very high security hybrid digital-
   signature schemes based on MD5 and a public-key cryptosystem.

Author's Address

   Ronald L. Rivest
   Massachusetts Institute of Technology
   Laboratory for Computer Science
   NE43-324
   545 Technology Square
   Cambridge, MA  02139-1986

   Phone: [phone]
   EMail: <A href="mailto:[e-mail]">[e-mail]</A>

</PRE>
<P align=center>
<SCRIPT language=JavaScript><!--
erfc("1321");
// --></SCRIPT>
</P>&nbsp;<BR>
<DIV align=center>
<CENTER>
<TABLE cellSpacing=4 cellPadding=4 width="100%" border=0>
  <TBODY>
  <TR>
    <TD width="100%" bgColor=#d6d6c0>
      <P><FONT face=Arial>Comments about this RFC:</FONT></P>
      <UL>
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-362.html">RFC 
        1321: In the document, where algorythm is analysed, is small mistake. In 
        roudn 1,...</A> by Modestas Kapusinskas (11/30/2003)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1057.html">RFC 
        1321: mddriver.c - MDTrial() there should be a if ( endTime-startTime 
        &gt; 0 ) ...</A> by puma99 (7/13/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-855.html">RFC 
        1321: i want the contain of md5context </A>by agad (5/9/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-2416.html">RFC 
        1321: The exact code may be compiler dependent. I got it to compile as a 
        DOS 16...</A> by Gregory D. MELLOTT (9/5/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-549.html">RFC 
        1321: hgdhfgdhfdgfhdjgfd hugrnjrkgyou are a stinky butthead! i hate you! 
        you smell...</A> by bla bla bla bla (2/6/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-937.html">RFC 
        1321: It's better to put "(long)TEST_BLOCK_LEN * 
        (long)TEST_BLOCK_COUNT/((endTime-st...</A> by Shar CMC MSU 
        (6/3/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1343.html">RFC 
        1321: Just a little question. What does "lsb" mean? I mean in this line: 
        UINT4...</A> by Nightfall (10/17/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-862.html">RFC 
        1321: The code does not compile. I am almost sure of it, I may be wrong, 
        but someone...</A> by Student (5/11/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1420.html">RFC 
        1321: We are lawyers in Sydney Australia. We have been referred to this 
        page. We need...</A> by Phill (11/18/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-2042.html">RFC 
        1321: i read this and i think MD2 is the bomb </A>by hgc 
        (5/20/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-522.html">RFC 
        1321: For finding RAT's not handled by today's AV vendors, I suspect 
        basic knowledge...</A> by longneckedhorse (1/27/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1651.html">RFC 
        1321: MD5 is great and i love this algorithm... it's much better than 
        MD4 btw ...</A> by Gokart Krenn (2/2/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-710.html">RFC 
        1321: There appears to be a slight error in the hash macro description 
        for Rounds 3 &amp;...</A> by paranoia (3/30/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1649.html">RFC 
        1321: Oida bist du deppat ... wer solln des checkn ? :D </A>by DeiMuddi 
        (2/2/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1663.html">RFC 
        1321: helppppppppppppppppppppp </A>by al7eran (2/4/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1643.html">RFC 
        1321: Comment by FvdMarkd.... printf("MD%d time trial. Digesting %d 
        %d-byte blocks...</A> by Robert Collins (1/31/2005)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-1512.html">RFC 
        1321: FDRE DDTDVCTSDWYETAHXUDGE6DCOEDGUNBNBVDFXXFDFDXCDC CVSFXGSRSBCBCV 
        DRGRGDRTCBEE...</A> by FCRFDFTDFW (12/13/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-969.html">RFC 
        1321: printf("MD%d time trial. Digesting %d %d-byte blocks ...", MD, 
        TEST_BLOCK_...</A> by FvdMarkt (6/14/2004)</FONT> 
        <LI><FONT face=Arial><A href="http://www.faqs.org/qa/rfcc-888.html">RFC 
        1321: Small error on line 19 of mddriver.c: There is #define MD MD5 
        instead of ...</A> by phil (5/17/2004)</FONT> 
</LI></UL></TD></TR></TBODY></TABLE><BR></CENTER></DIV>
<DIV align=center>
<TABLE cellSpacing=3 cellPadding=3 width="100%" border=0>
  <TBODY>
  <TR>
    <TD width="45%">
      <P align=left>Previous: <A 
      href="http://www.faqs.org/rfcs/rfc1320.html">RFC 1320 - The MD4 
      Message-Digest Algorithm</A> </P></TD>
    <TD width="10%">&nbsp;</TD>
    <TD width="45%">
      <P align=right>Next: <A href="http://www.faqs.org/rfcs/rfc1322.html">RFC 
      1322 - A Unified Approach to Inter-Domain Routing</A> 
</P></TD></TR></TBODY></TABLE></DIV>
<P align=right>&nbsp;</P>
<HR noShade SIZE=2>

<DIV align=center>[ <A href="http://www.faqs.org/rfcs/">RFC Index</A> | <A 
href="http://www.faqs.org/rfcs/rfcsearch.html">RFC Search</A> | <A 
href="http://www.faqs.org/faqs/">Usenet FAQs</A> | <A 
href="http://www.faqs.org/contrib/">Web FAQs</A> | <A 
href="http://www.faqs.org/docs/">Documents</A> | <A 
href="http://www.city-data.com/">Cities</A> ] 
<P></P></DIV><SMALL>
<ADDRESS>
<P align=center></P></ADDRESS></SMALL></BODY></HTML>