Commit 3701d0f6 authored by 's avatar
Browse files

removed unnecessary folder


git-svn-id: file:///home/svn/mapi/trunk@232 8d5bb341-7cf1-0310-8cf6-ba355fef3186
parent 5a363e0f
This diff is collapsed.
This diff is collapsed.
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
<meta name="author" content="Christophe Devine">
<style type="text/css">
PRE { font-family: Courier New, Courier, monospace; }
TD { font-Family: Verdana, Arial, Helvetica, sans-serif; }
P { font-Family: Verdana, Arial, Helvetica, sans-serif; }
A:link { text-decoration: none; color: #0000CC; }
A:visited { text-decoration: none; color: #0000CC; }
A:hover { text-decoration: underline; color: #0000FF; }
A:active { text-decoration: underline; color: #0000FF; }
</style>
<title>MD5 Source Code</title></head>
<body bgcolor="#ffffff" text="#000000">
<center>
<table align="center" border="0" cellpadding="32" cellspacing="0">
<tbody><tr valign="top"><td align="left">
<center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/about/">About</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/"><b>Source Code</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/xnaima/">xNAIMA</a></td>
</tr></tbody></table>
</center>
<p>
</p><center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/"><b>Crypto</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/network/">Networking</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/opengl/">OpenGL</a></td>
</tr></tbody></table>
</center>
<p>
</p><center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/des/">3DES</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/rc4/">RC4</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/aes/">AES</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/md5/"><b>MD5</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/sha1/">SHA-1</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/sha256/">SHA-2</a></td>
</tr></tbody></table>
</center>
<p>
</p><center><b>MD5 Source Code</b></center>
<p>
</p><p>
This optimized MD5 implementation conforms to RFC 1321.
</p><p>
<table border="0" cellpadding="8" cellspacing="0">
<tbody><tr valign="middle">
<td align="left">
<font size="+1"><a href="http://www.cr0.net:8040/code/crypto/md5/md5.h">md5.h</a></font>
</td>
</tr>
<tr bgcolor="#f8f8f8" valign="middle">
<td align="left">
<pre>#ifndef _MD5_H
#define _MD5_H
#ifndef uint8
#define uint8 unsigned char
#endif
#ifndef uint32
#define uint32 unsigned long int
#endif
typedef struct
{
uint32 total[2];
uint32 state[4];
uint8 buffer[64];
}
md5_context;
void md5_starts( md5_context *ctx );
void md5_update( md5_context *ctx, uint8 *input, uint32 length );
void md5_finish( md5_context *ctx, uint8 digest[16] );
#endif /* md5.h */
</pre>
</td>
</tr>
<tr valign="middle">
<td align="left">
<font size="+1"><a href="http://www.cr0.net:8040/code/crypto/md5/md5.c">md5.c</a></font>
</td>
</tr>
<tr bgcolor="#f8f8f8" valign="middle">
<td align="left">
<pre>/*
* RFC 1321 compliant MD5 implementation
*
* Copyright (C) 2001-2003 Christophe Devine
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include &lt;string.h&gt;
#include "md5.h"
#define GET_UINT32(n,b,i) \
{ \
(n) = ( (uint32) (b)[(i) ] ) \
| ( (uint32) (b)[(i) + 1] &lt;&lt; 8 ) \
| ( (uint32) (b)[(i) + 2] &lt;&lt; 16 ) \
| ( (uint32) (b)[(i) + 3] &lt;&lt; 24 ); \
}
#define PUT_UINT32(n,b,i) \
{ \
(b)[(i) ] = (uint8) ( (n) ); \
(b)[(i) + 1] = (uint8) ( (n) &gt;&gt; 8 ); \
(b)[(i) + 2] = (uint8) ( (n) &gt;&gt; 16 ); \
(b)[(i) + 3] = (uint8) ( (n) &gt;&gt; 24 ); \
}
void md5_starts( md5_context *ctx )
{
ctx-&gt;total[0] = 0;
ctx-&gt;total[1] = 0;
ctx-&gt;state[0] = 0x67452301;
ctx-&gt;state[1] = 0xEFCDAB89;
ctx-&gt;state[2] = 0x98BADCFE;
ctx-&gt;state[3] = 0x10325476;
}
void md5_process( md5_context *ctx, uint8 data[64] )
{
uint32 X[16], A, B, C, D;
GET_UINT32( X[0], data, 0 );
GET_UINT32( X[1], data, 4 );
GET_UINT32( X[2], data, 8 );
GET_UINT32( X[3], data, 12 );
GET_UINT32( X[4], data, 16 );
GET_UINT32( X[5], data, 20 );
GET_UINT32( X[6], data, 24 );
GET_UINT32( X[7], data, 28 );
GET_UINT32( X[8], data, 32 );
GET_UINT32( X[9], data, 36 );
GET_UINT32( X[10], data, 40 );
GET_UINT32( X[11], data, 44 );
GET_UINT32( X[12], data, 48 );
GET_UINT32( X[13], data, 52 );
GET_UINT32( X[14], data, 56 );
GET_UINT32( X[15], data, 60 );
#define S(x,n) ((x &lt;&lt; n) | ((x &amp; 0xFFFFFFFF) &gt;&gt; (32 - n)))
#define P(a,b,c,d,k,s,t) \
{ \
a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
}
A = ctx-&gt;state[0];
B = ctx-&gt;state[1];
C = ctx-&gt;state[2];
D = ctx-&gt;state[3];
#define F(x,y,z) (z ^ (x &amp; (y ^ z)))
P( A, B, C, D, 0, 7, 0xD76AA478 );
P( D, A, B, C, 1, 12, 0xE8C7B756 );
P( C, D, A, B, 2, 17, 0x242070DB );
P( B, C, D, A, 3, 22, 0xC1BDCEEE );
P( A, B, C, D, 4, 7, 0xF57C0FAF );
P( D, A, B, C, 5, 12, 0x4787C62A );
P( C, D, A, B, 6, 17, 0xA8304613 );
P( B, C, D, A, 7, 22, 0xFD469501 );
P( A, B, C, D, 8, 7, 0x698098D8 );
P( D, A, B, C, 9, 12, 0x8B44F7AF );
P( C, D, A, B, 10, 17, 0xFFFF5BB1 );
P( B, C, D, A, 11, 22, 0x895CD7BE );
P( A, B, C, D, 12, 7, 0x6B901122 );
P( D, A, B, C, 13, 12, 0xFD987193 );
P( C, D, A, B, 14, 17, 0xA679438E );
P( B, C, D, A, 15, 22, 0x49B40821 );
#undef F
#define F(x,y,z) (y ^ (z &amp; (x ^ y)))
P( A, B, C, D, 1, 5, 0xF61E2562 );
P( D, A, B, C, 6, 9, 0xC040B340 );
P( C, D, A, B, 11, 14, 0x265E5A51 );
P( B, C, D, A, 0, 20, 0xE9B6C7AA );
P( A, B, C, D, 5, 5, 0xD62F105D );
P( D, A, B, C, 10, 9, 0x02441453 );
P( C, D, A, B, 15, 14, 0xD8A1E681 );
P( B, C, D, A, 4, 20, 0xE7D3FBC8 );
P( A, B, C, D, 9, 5, 0x21E1CDE6 );
P( D, A, B, C, 14, 9, 0xC33707D6 );
P( C, D, A, B, 3, 14, 0xF4D50D87 );
P( B, C, D, A, 8, 20, 0x455A14ED );
P( A, B, C, D, 13, 5, 0xA9E3E905 );
P( D, A, B, C, 2, 9, 0xFCEFA3F8 );
P( C, D, A, B, 7, 14, 0x676F02D9 );
P( B, C, D, A, 12, 20, 0x8D2A4C8A );
#undef F
#define F(x,y,z) (x ^ y ^ z)
P( A, B, C, D, 5, 4, 0xFFFA3942 );
P( D, A, B, C, 8, 11, 0x8771F681 );
P( C, D, A, B, 11, 16, 0x6D9D6122 );
P( B, C, D, A, 14, 23, 0xFDE5380C );
P( A, B, C, D, 1, 4, 0xA4BEEA44 );
P( D, A, B, C, 4, 11, 0x4BDECFA9 );
P( C, D, A, B, 7, 16, 0xF6BB4B60 );
P( B, C, D, A, 10, 23, 0xBEBFBC70 );
P( A, B, C, D, 13, 4, 0x289B7EC6 );
P( D, A, B, C, 0, 11, 0xEAA127FA );
P( C, D, A, B, 3, 16, 0xD4EF3085 );
P( B, C, D, A, 6, 23, 0x04881D05 );
P( A, B, C, D, 9, 4, 0xD9D4D039 );
P( D, A, B, C, 12, 11, 0xE6DB99E5 );
P( C, D, A, B, 15, 16, 0x1FA27CF8 );
P( B, C, D, A, 2, 23, 0xC4AC5665 );
#undef F
#define F(x,y,z) (y ^ (x | ~z))
P( A, B, C, D, 0, 6, 0xF4292244 );
P( D, A, B, C, 7, 10, 0x432AFF97 );
P( C, D, A, B, 14, 15, 0xAB9423A7 );
P( B, C, D, A, 5, 21, 0xFC93A039 );
P( A, B, C, D, 12, 6, 0x655B59C3 );
P( D, A, B, C, 3, 10, 0x8F0CCC92 );
P( C, D, A, B, 10, 15, 0xFFEFF47D );
P( B, C, D, A, 1, 21, 0x85845DD1 );
P( A, B, C, D, 8, 6, 0x6FA87E4F );
P( D, A, B, C, 15, 10, 0xFE2CE6E0 );
P( C, D, A, B, 6, 15, 0xA3014314 );
P( B, C, D, A, 13, 21, 0x4E0811A1 );
P( A, B, C, D, 4, 6, 0xF7537E82 );
P( D, A, B, C, 11, 10, 0xBD3AF235 );
P( C, D, A, B, 2, 15, 0x2AD7D2BB );
P( B, C, D, A, 9, 21, 0xEB86D391 );
#undef F
ctx-&gt;state[0] += A;
ctx-&gt;state[1] += B;
ctx-&gt;state[2] += C;
ctx-&gt;state[3] += D;
}
void md5_update( md5_context *ctx, uint8 *input, uint32 length )
{
uint32 left, fill;
if( ! length ) return;
left = ctx-&gt;total[0] &amp; 0x3F;
fill = 64 - left;
ctx-&gt;total[0] += length;
ctx-&gt;total[0] &amp;= 0xFFFFFFFF;
if( ctx-&gt;total[0] &lt; length )
ctx-&gt;total[1]++;
if( left &amp;&amp; length &gt;= fill )
{
memcpy( (void *) (ctx-&gt;buffer + left),
(void *) input, fill );
md5_process( ctx, ctx-&gt;buffer );
length -= fill;
input += fill;
left = 0;
}
while( length &gt;= 64 )
{
md5_process( ctx, input );
length -= 64;
input += 64;
}
if( length )
{
memcpy( (void *) (ctx-&gt;buffer + left),
(void *) input, length );
}
}
static uint8 md5_padding[64] =
{
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
void md5_finish( md5_context *ctx, uint8 digest[16] )
{
uint32 last, padn;
uint32 high, low;
uint8 msglen[8];
high = ( ctx-&gt;total[0] &gt;&gt; 29 )
| ( ctx-&gt;total[1] &lt;&lt; 3 );
low = ( ctx-&gt;total[0] &lt;&lt; 3 );
PUT_UINT32( low, msglen, 0 );
PUT_UINT32( high, msglen, 4 );
last = ctx-&gt;total[0] &amp; 0x3F;
padn = ( last &lt; 56 ) ? ( 56 - last ) : ( 120 - last );
md5_update( ctx, md5_padding, padn );
md5_update( ctx, msglen, 8 );
PUT_UINT32( ctx-&gt;state[0], digest, 0 );
PUT_UINT32( ctx-&gt;state[1], digest, 4 );
PUT_UINT32( ctx-&gt;state[2], digest, 8 );
PUT_UINT32( ctx-&gt;state[3], digest, 12 );
}
#ifdef TEST
#include &lt;stdlib.h&gt;
#include &lt;stdio.h&gt;
/*
* those are the standard RFC 1321 test vectors
*/
static char *msg[] =
{
"",
"a",
"abc",
"message digest",
"abcdefghijklmnopqrstuvwxyz",
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
"12345678901234567890123456789012345678901234567890123456789012" \
"345678901234567890"
};
static char *val[] =
{
"d41d8cd98f00b204e9800998ecf8427e",
"0cc175b9c0f1b6a831c399e269772661",
"900150983cd24fb0d6963f7d28e17f72",
"f96b697d7cb7938d525a2f31aaf161d0",
"c3fcd3d76192e4007dfb496cca67e13b",
"d174ab98d277d9f5a5611c2c9f419d9f",
"57edf4a22be3c955ac49da2e2107b67a"
};
int main( int argc, char *argv[] )
{
FILE *f;
int i, j;
char output[33];
md5_context ctx;
unsigned char buf[1000];
unsigned char md5sum[16];
if( argc &lt; 2 )
{
printf( "\n MD5 Validation Tests:\n\n" );
for( i = 0; i &lt; 7; i++ )
{
printf( " Test %d ", i + 1 );
md5_starts( &amp;ctx );
md5_update( &amp;ctx, (uint8 *) msg[i], strlen( msg[i] ) );
md5_finish( &amp;ctx, md5sum );
for( j = 0; j &lt; 16; j++ )
{
sprintf( output + j * 2, "%02x", md5sum[j] );
}
if( memcmp( output, val[i], 32 ) )
{
printf( "failed!\n" );
return( 1 );
}
printf( "passed.\n" );
}
printf( "\n" );
}
else
{
if( ! ( f = fopen( argv[1], "rb" ) ) )
{
perror( "fopen" );
return( 1 );
}
md5_starts( &amp;ctx );
while( ( i = fread( buf, 1, sizeof( buf ), f ) ) &gt; 0 )
{
md5_update( &amp;ctx, buf, i );
}
md5_finish( &amp;ctx, md5sum );
for( j = 0; j &lt; 16; j++ )
{
printf( "%02x", md5sum[j] );
}
printf( " %s\n", argv[1] );
}
return( 0 );
}
#endif
</pre>
</td>
</tr>
</tbody></table>
</p><center>
<p><font size="-1"> 2001-2005 Christophe Devine</font></p>
<p><font size="-1">
<a href="http://validator.w3.org/check?uri=http%3A%2F%2Fwww.cr0.net%3A8040%2Fcode%2Fcrypto%2Fmd5%2F">Valid HTML 4.01</a> |
<a href="http://jigsaw.w3.org/css-validator/validator?uri=http%3A%2F%2Fwww.cr0.net%3A8040%2Fstyle.css">Valid CSS</a>
</font></p>
</center>
</td></tr>
</tbody></table>
</center>
</body></html>
\ No newline at end of file
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
<meta name="author" content="Christophe Devine">
<style type="text/css">
PRE { font-family: Courier New, Courier, monospace; }
TD { font-Family: Verdana, Arial, Helvetica, sans-serif; }
P { font-Family: Verdana, Arial, Helvetica, sans-serif; }
A:link { text-decoration: none; color: #0000CC; }
A:visited { text-decoration: none; color: #0000CC; }
A:hover { text-decoration: underline; color: #0000FF; }
A:active { text-decoration: underline; color: #0000FF; }
</style>
<title>SHA-1 Source Code</title></head>
<body bgcolor="#ffffff" text="#000000">
<center>
<table align="center" border="0" cellpadding="32" cellspacing="0">
<tbody><tr valign="top"><td align="left">
<center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/about/">About</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/"><b>Source Code</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/xnaima/">xNAIMA</a></td>
</tr></tbody></table>
</center>
<p>
</p><center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/"><b>Crypto</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/network/">Networking</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/opengl/">OpenGL</a></td>
</tr></tbody></table>
</center>
<p>
</p><center>
<table align="center" border="1" cellpadding="7" cellspacing="2">
<tbody><tr valign="middle">
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/des/">3DES</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/rc4/">RC4</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/aes/">AES</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/md5/">MD5</a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/sha1/"><b>SHA-1</b></a></td>
<td align="center"><a href="http://www.cr0.net:8040/code/crypto/sha256/">SHA-2</a></td>
</tr></tbody></table>
</center>
<p>
</p><center><b>SHA-1 Source Code</b></center>
<p>
</p><p>
This optimized SHA-1 implementation conforms to FIPS-180-1.
</p><p>
<table border="0" cellpadding="8" cellspacing="0">
<tbody><tr valign="middle">
<td align="left">
<font size="+1"><a href="http://www.cr0.net:8040/code/crypto/sha1/sha1.h">sha1.h</a></font>
</td>
</tr>
<tr bgcolor="#f8f8f8" valign="middle">
<td align="left">
<pre>#ifndef _SHA1_H
#define _SHA1_H
#ifndef uint8
#define uint8 unsigned char
#endif
#ifndef uint32
#define uint32 unsigned long int
#endif
typedef struct
{
uint32 total[2];
uint32 state[5];
uint8 buffer[64];
}
sha1_context;
void sha1_starts( sha1_context *ctx );
void sha1_update( sha1_context *ctx, uint8 *input, uint32 length );
void sha1_finish( sha1_context *ctx, uint8 digest[20] );
#endif /* sha1.h */
</pre>
</td>
</tr>
<tr valign="middle">
<td align="left">
<font size="+1"><a href="http://www.cr0.net:8040/code/crypto/sha1/sha1.c">sha1.c</a></font>
</td>
</tr>
<tr bgcolor="#f8f8f8" valign="middle">
<td align="left">
<pre>/*
* FIPS-180-1 compliant SHA-1 implementation
*
* Copyright (C) 2001-2003 Christophe Devine
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include &lt;string.h&gt;
#include "sha1.h"
#define GET_UINT32(n,b,i) \
{ \
(n) = ( (uint32) (b)[(i) ] &lt;&lt; 24 ) \
| ( (uint32) (b)[(i) + 1] &lt;&lt; 16 ) \
| ( (uint32) (b)[(i) + 2] &lt;&lt; 8 ) \
| ( (uint32) (b)[(i) + 3] ); \
}
#define PUT_UINT32(n,b,i) \
{ \
(b)[(i) ] = (uint8) ( (n) &gt;&gt; 24 ); \
(b)[(i) + 1] = (uint8) ( (n) &gt;&gt; 16 ); \
(b)[(i) + 2] = (uint8) ( (n) &gt;&gt; 8 ); \
(b)[(i) + 3] = (uint8) ( (n) ); \
}
void sha1_starts( sha1_context *ctx )
{
ctx-&gt;total[0] = 0;
ctx-&gt;total[1] = 0;
ctx-&gt;state[0] = 0x67452301;
ctx-&gt;state[1] = 0xEFCDAB89;
ctx-&gt;state[2] = 0x98BADCFE;
ctx-&gt;state[3] = 0x10325476;
ctx-&gt;state[4] = 0xC3D2E1F0;
}
void sha1_process( sha1_context *ctx, uint8 data[64] )
{
uint32 temp, W[16], A, B, C, D, E;
GET_UINT32( W[0], data, 0 );
GET_UINT32( W[1], data, 4 );
GET_UINT32( W[2], data, 8 );
GET_UINT32( W[3], data, 12 );
GET_UINT32( W[4], data, 16 );
GET_UINT32( W[5], data, 20 );
GET_UINT32( W[6], data, 24 );
GET_UINT32( W[7], data, 28 );
GET_UINT32( W[8], data, 32 );
GET_UINT32( W[9], data, 36 );
GET_UINT32( W[10], data, 40 );
GET_UINT32( W[11], data, 44 );
GET_UINT32( W[12], data, 48 );
GET_UINT32( W[13], data, 52 );