eichi kowata / Mbed 2 deprecated geiger

http://http://diytec.web.fc2.com/mark2r2/

Dependencies:   EthernetNetIf NTPClient_NetServices mbed ConfigFile

md5.c@0:08a4d61cd84c, 2011-09-20 (annotated)

Committer:
mark2r2
Date:
Tue Sep 20 12:46:26 2011 +0000
Revision:
0:08a4d61cd84c
V1.0

Who changed what in which revision?

UserRevisionLine numberNew contents of line
mark2r2 0:08a4d61cd84c 1 /* MD5
mark2r2 0:08a4d61cd84c 2 converted to C++ class by Frank Thilo (thilo@unix-ag.org)
mark2r2 0:08a4d61cd84c 3 for bzflag (http://www.bzflag.org)
mark2r2 0:08a4d61cd84c 4
mark2r2 0:08a4d61cd84c 5 based on:
mark2r2 0:08a4d61cd84c 6
mark2r2 0:08a4d61cd84c 7 md5.h and md5.c
mark2r2 0:08a4d61cd84c 8 reference implemantion of RFC 1321
mark2r2 0:08a4d61cd84c 9
mark2r2 0:08a4d61cd84c 10 Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
mark2r2 0:08a4d61cd84c 11 rights reserved.
mark2r2 0:08a4d61cd84c 12
mark2r2 0:08a4d61cd84c 13 License to copy and use this software is granted provided that it
mark2r2 0:08a4d61cd84c 14 is identified as the "RSA Data Security, Inc. MD5 Message-Digest
mark2r2 0:08a4d61cd84c 15 Algorithm" in all material mentioning or referencing this software
mark2r2 0:08a4d61cd84c 16 or this function.
mark2r2 0:08a4d61cd84c 17
mark2r2 0:08a4d61cd84c 18 License is also granted to make and use derivative works provided
mark2r2 0:08a4d61cd84c 19 that such works are identified as "derived from the RSA Data
mark2r2 0:08a4d61cd84c 20 Security, Inc. MD5 Message-Digest Algorithm" in all material
mark2r2 0:08a4d61cd84c 21 mentioning or referencing the derived work.
mark2r2 0:08a4d61cd84c 22
mark2r2 0:08a4d61cd84c 23 RSA Data Security, Inc. makes no representations concerning either
mark2r2 0:08a4d61cd84c 24 the merchantability of this software or the suitability of this
mark2r2 0:08a4d61cd84c 25 software for any particular purpose. It is provided "as is"
mark2r2 0:08a4d61cd84c 26 without express or implied warranty of any kind.
mark2r2 0:08a4d61cd84c 27
mark2r2 0:08a4d61cd84c 28 These notices must be retained in any copies of any part of this
mark2r2 0:08a4d61cd84c 29 documentation and/or software.
mark2r2 0:08a4d61cd84c 30
mark2r2 0:08a4d61cd84c 31 */
mark2r2 0:08a4d61cd84c 32
mark2r2 0:08a4d61cd84c 33 /* interface header */
mark2r2 0:08a4d61cd84c 34 #include "md5.h"
mark2r2 0:08a4d61cd84c 35
mark2r2 0:08a4d61cd84c 36 /* system implementation headers */
mark2r2 0:08a4d61cd84c 37 #include <stdio.h>
mark2r2 0:08a4d61cd84c 38 #include <string.h>
mark2r2 0:08a4d61cd84c 39
mark2r2 0:08a4d61cd84c 40
mark2r2 0:08a4d61cd84c 41 // Constants for MD5Transform routine.
mark2r2 0:08a4d61cd84c 42 #define S11 7
mark2r2 0:08a4d61cd84c 43 #define S12 12
mark2r2 0:08a4d61cd84c 44 #define S13 17
mark2r2 0:08a4d61cd84c 45 #define S14 22
mark2r2 0:08a4d61cd84c 46 #define S21 5
mark2r2 0:08a4d61cd84c 47 #define S22 9
mark2r2 0:08a4d61cd84c 48 #define S23 14
mark2r2 0:08a4d61cd84c 49 #define S24 20
mark2r2 0:08a4d61cd84c 50 #define S31 4
mark2r2 0:08a4d61cd84c 51 #define S32 11
mark2r2 0:08a4d61cd84c 52 #define S33 16
mark2r2 0:08a4d61cd84c 53 #define S34 23
mark2r2 0:08a4d61cd84c 54 #define S41 6
mark2r2 0:08a4d61cd84c 55 #define S42 10
mark2r2 0:08a4d61cd84c 56 #define S43 15
mark2r2 0:08a4d61cd84c 57 #define S44 21
mark2r2 0:08a4d61cd84c 58
mark2r2 0:08a4d61cd84c 59 ///////////////////////////////////////////////
mark2r2 0:08a4d61cd84c 60
mark2r2 0:08a4d61cd84c 61 // F, G, H and I are basic MD5 functions.
mark2r2 0:08a4d61cd84c 62 inline MD5::uint4 MD5::F(uint4 x, uint4 y, uint4 z) {
mark2r2 0:08a4d61cd84c 63 return x&y | ~x&z;
mark2r2 0:08a4d61cd84c 64 }
mark2r2 0:08a4d61cd84c 65
mark2r2 0:08a4d61cd84c 66 inline MD5::uint4 MD5::G(uint4 x, uint4 y, uint4 z) {
mark2r2 0:08a4d61cd84c 67 return x&z | y&~z;
mark2r2 0:08a4d61cd84c 68 }
mark2r2 0:08a4d61cd84c 69
mark2r2 0:08a4d61cd84c 70 inline MD5::uint4 MD5::H(uint4 x, uint4 y, uint4 z) {
mark2r2 0:08a4d61cd84c 71 return x^y^z;
mark2r2 0:08a4d61cd84c 72 }
mark2r2 0:08a4d61cd84c 73
mark2r2 0:08a4d61cd84c 74 inline MD5::uint4 MD5::I(uint4 x, uint4 y, uint4 z) {
mark2r2 0:08a4d61cd84c 75 return y ^ (x | ~z);
mark2r2 0:08a4d61cd84c 76 }
mark2r2 0:08a4d61cd84c 77
mark2r2 0:08a4d61cd84c 78 // rotate_left rotates x left n bits.
mark2r2 0:08a4d61cd84c 79 inline MD5::uint4 MD5::rotate_left(uint4 x, int n) {
mark2r2 0:08a4d61cd84c 80 return (x << n) | (x >> (32-n));
mark2r2 0:08a4d61cd84c 81 }
mark2r2 0:08a4d61cd84c 82
mark2r2 0:08a4d61cd84c 83 // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
mark2r2 0:08a4d61cd84c 84 // Rotation is separate from addition to prevent recomputation.
mark2r2 0:08a4d61cd84c 85 inline void MD5::FF(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {
mark2r2 0:08a4d61cd84c 86 a = rotate_left(a+ F(b,c,d) + x + ac, s) + b;
mark2r2 0:08a4d61cd84c 87 }
mark2r2 0:08a4d61cd84c 88
mark2r2 0:08a4d61cd84c 89 inline void MD5::GG(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {
mark2r2 0:08a4d61cd84c 90 a = rotate_left(a + G(b,c,d) + x + ac, s) + b;
mark2r2 0:08a4d61cd84c 91 }
mark2r2 0:08a4d61cd84c 92
mark2r2 0:08a4d61cd84c 93 inline void MD5::HH(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {
mark2r2 0:08a4d61cd84c 94 a = rotate_left(a + H(b,c,d) + x + ac, s) + b;
mark2r2 0:08a4d61cd84c 95 }
mark2r2 0:08a4d61cd84c 96
mark2r2 0:08a4d61cd84c 97 inline void MD5::II(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {
mark2r2 0:08a4d61cd84c 98 a = rotate_left(a + I(b,c,d) + x + ac, s) + b;
mark2r2 0:08a4d61cd84c 99 }
mark2r2 0:08a4d61cd84c 100
mark2r2 0:08a4d61cd84c 101 //////////////////////////////////////////////
mark2r2 0:08a4d61cd84c 102
mark2r2 0:08a4d61cd84c 103 // default ctor, just initailize
mark2r2 0:08a4d61cd84c 104 MD5::MD5()
mark2r2 0:08a4d61cd84c 105 {
mark2r2 0:08a4d61cd84c 106 init();
mark2r2 0:08a4d61cd84c 107 }
mark2r2 0:08a4d61cd84c 108
mark2r2 0:08a4d61cd84c 109 //////////////////////////////////////////////
mark2r2 0:08a4d61cd84c 110
mark2r2 0:08a4d61cd84c 111 // nifty shortcut ctor, compute MD5 for string and finalize it right away
mark2r2 0:08a4d61cd84c 112 MD5::MD5(const std::string &text)
mark2r2 0:08a4d61cd84c 113 {
mark2r2 0:08a4d61cd84c 114 init();
mark2r2 0:08a4d61cd84c 115 update(text.c_str(), text.length());
mark2r2 0:08a4d61cd84c 116 finalize();
mark2r2 0:08a4d61cd84c 117 }
mark2r2 0:08a4d61cd84c 118
mark2r2 0:08a4d61cd84c 119 //////////////////////////////
mark2r2 0:08a4d61cd84c 120
mark2r2 0:08a4d61cd84c 121 void MD5::init()
mark2r2 0:08a4d61cd84c 122 {
mark2r2 0:08a4d61cd84c 123 finalized=false;
mark2r2 0:08a4d61cd84c 124
mark2r2 0:08a4d61cd84c 125 count[0] = 0;
mark2r2 0:08a4d61cd84c 126 count[1] = 0;
mark2r2 0:08a4d61cd84c 127
mark2r2 0:08a4d61cd84c 128 // load magic initialization constants.
mark2r2 0:08a4d61cd84c 129 state[0] = 0x67452301;
mark2r2 0:08a4d61cd84c 130 state[1] = 0xefcdab89;
mark2r2 0:08a4d61cd84c 131 state[2] = 0x98badcfe;
mark2r2 0:08a4d61cd84c 132 state[3] = 0x10325476;
mark2r2 0:08a4d61cd84c 133 }
mark2r2 0:08a4d61cd84c 134
mark2r2 0:08a4d61cd84c 135 //////////////////////////////
mark2r2 0:08a4d61cd84c 136
mark2r2 0:08a4d61cd84c 137 // decodes input (unsigned char) into output (uint4). Assumes len is a multiple of 4.
mark2r2 0:08a4d61cd84c 138 void MD5::decode(uint4 output[], const uint1 input[], size_type len)
mark2r2 0:08a4d61cd84c 139 {
mark2r2 0:08a4d61cd84c 140 for (unsigned int i = 0, j = 0; j < len; i++, j += 4)
mark2r2 0:08a4d61cd84c 141 output[i] = ((uint4)input[j]) | (((uint4)input[j+1]) << 8) |
mark2r2 0:08a4d61cd84c 142 (((uint4)input[j+2]) << 16) | (((uint4)input[j+3]) << 24);
mark2r2 0:08a4d61cd84c 143 }
mark2r2 0:08a4d61cd84c 144
mark2r2 0:08a4d61cd84c 145 //////////////////////////////
mark2r2 0:08a4d61cd84c 146
mark2r2 0:08a4d61cd84c 147 // encodes input (uint4) into output (unsigned char). Assumes len is
mark2r2 0:08a4d61cd84c 148 // a multiple of 4.
mark2r2 0:08a4d61cd84c 149 void MD5::encode(uint1 output[], const uint4 input[], size_type len)
mark2r2 0:08a4d61cd84c 150 {
mark2r2 0:08a4d61cd84c 151 for (size_type i = 0, j = 0; j < len; i++, j += 4) {
mark2r2 0:08a4d61cd84c 152 output[j] = input[i] & 0xff;
mark2r2 0:08a4d61cd84c 153 output[j+1] = (input[i] >> 8) & 0xff;
mark2r2 0:08a4d61cd84c 154 output[j+2] = (input[i] >> 16) & 0xff;
mark2r2 0:08a4d61cd84c 155 output[j+3] = (input[i] >> 24) & 0xff;
mark2r2 0:08a4d61cd84c 156 }
mark2r2 0:08a4d61cd84c 157 }
mark2r2 0:08a4d61cd84c 158
mark2r2 0:08a4d61cd84c 159 //////////////////////////////
mark2r2 0:08a4d61cd84c 160
mark2r2 0:08a4d61cd84c 161 // apply MD5 algo on a block
mark2r2 0:08a4d61cd84c 162 void MD5::transform(const uint1 block[blocksize])
mark2r2 0:08a4d61cd84c 163 {
mark2r2 0:08a4d61cd84c 164 uint4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
mark2r2 0:08a4d61cd84c 165 decode (x, block, blocksize);
mark2r2 0:08a4d61cd84c 166
mark2r2 0:08a4d61cd84c 167 /* Round 1 */
mark2r2 0:08a4d61cd84c 168 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
mark2r2 0:08a4d61cd84c 169 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
mark2r2 0:08a4d61cd84c 170 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
mark2r2 0:08a4d61cd84c 171 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
mark2r2 0:08a4d61cd84c 172 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
mark2r2 0:08a4d61cd84c 173 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
mark2r2 0:08a4d61cd84c 174 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
mark2r2 0:08a4d61cd84c 175 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
mark2r2 0:08a4d61cd84c 176 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
mark2r2 0:08a4d61cd84c 177 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
mark2r2 0:08a4d61cd84c 178 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
mark2r2 0:08a4d61cd84c 179 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
mark2r2 0:08a4d61cd84c 180 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
mark2r2 0:08a4d61cd84c 181 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
mark2r2 0:08a4d61cd84c 182 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
mark2r2 0:08a4d61cd84c 183 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
mark2r2 0:08a4d61cd84c 184
mark2r2 0:08a4d61cd84c 185 /* Round 2 */
mark2r2 0:08a4d61cd84c 186 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
mark2r2 0:08a4d61cd84c 187 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
mark2r2 0:08a4d61cd84c 188 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
mark2r2 0:08a4d61cd84c 189 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
mark2r2 0:08a4d61cd84c 190 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
mark2r2 0:08a4d61cd84c 191 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
mark2r2 0:08a4d61cd84c 192 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
mark2r2 0:08a4d61cd84c 193 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
mark2r2 0:08a4d61cd84c 194 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
mark2r2 0:08a4d61cd84c 195 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
mark2r2 0:08a4d61cd84c 196 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
mark2r2 0:08a4d61cd84c 197 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
mark2r2 0:08a4d61cd84c 198 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
mark2r2 0:08a4d61cd84c 199 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
mark2r2 0:08a4d61cd84c 200 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
mark2r2 0:08a4d61cd84c 201 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
mark2r2 0:08a4d61cd84c 202
mark2r2 0:08a4d61cd84c 203 /* Round 3 */
mark2r2 0:08a4d61cd84c 204 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
mark2r2 0:08a4d61cd84c 205 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
mark2r2 0:08a4d61cd84c 206 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
mark2r2 0:08a4d61cd84c 207 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
mark2r2 0:08a4d61cd84c 208 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
mark2r2 0:08a4d61cd84c 209 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
mark2r2 0:08a4d61cd84c 210 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
mark2r2 0:08a4d61cd84c 211 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
mark2r2 0:08a4d61cd84c 212 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
mark2r2 0:08a4d61cd84c 213 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
mark2r2 0:08a4d61cd84c 214 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
mark2r2 0:08a4d61cd84c 215 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
mark2r2 0:08a4d61cd84c 216 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
mark2r2 0:08a4d61cd84c 217 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
mark2r2 0:08a4d61cd84c 218 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
mark2r2 0:08a4d61cd84c 219 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
mark2r2 0:08a4d61cd84c 220
mark2r2 0:08a4d61cd84c 221 /* Round 4 */
mark2r2 0:08a4d61cd84c 222 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
mark2r2 0:08a4d61cd84c 223 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
mark2r2 0:08a4d61cd84c 224 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
mark2r2 0:08a4d61cd84c 225 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
mark2r2 0:08a4d61cd84c 226 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
mark2r2 0:08a4d61cd84c 227 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
mark2r2 0:08a4d61cd84c 228 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
mark2r2 0:08a4d61cd84c 229 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
mark2r2 0:08a4d61cd84c 230 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
mark2r2 0:08a4d61cd84c 231 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
mark2r2 0:08a4d61cd84c 232 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
mark2r2 0:08a4d61cd84c 233 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
mark2r2 0:08a4d61cd84c 234 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
mark2r2 0:08a4d61cd84c 235 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
mark2r2 0:08a4d61cd84c 236 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
mark2r2 0:08a4d61cd84c 237 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
mark2r2 0:08a4d61cd84c 238
mark2r2 0:08a4d61cd84c 239 state[0] += a;
mark2r2 0:08a4d61cd84c 240 state[1] += b;
mark2r2 0:08a4d61cd84c 241 state[2] += c;
mark2r2 0:08a4d61cd84c 242 state[3] += d;
mark2r2 0:08a4d61cd84c 243
mark2r2 0:08a4d61cd84c 244 // Zeroize sensitive information.
mark2r2 0:08a4d61cd84c 245 memset(x, 0, sizeof x);
mark2r2 0:08a4d61cd84c 246 }
mark2r2 0:08a4d61cd84c 247
mark2r2 0:08a4d61cd84c 248 //////////////////////////////
mark2r2 0:08a4d61cd84c 249
mark2r2 0:08a4d61cd84c 250 // MD5 block update operation. Continues an MD5 message-digest
mark2r2 0:08a4d61cd84c 251 // operation, processing another message block
mark2r2 0:08a4d61cd84c 252 void MD5::update(const unsigned char input[], size_type length)
mark2r2 0:08a4d61cd84c 253 {
mark2r2 0:08a4d61cd84c 254 // compute number of bytes mod 64
mark2r2 0:08a4d61cd84c 255 size_type index = count[0] / 8 % blocksize;
mark2r2 0:08a4d61cd84c 256
mark2r2 0:08a4d61cd84c 257 // Update number of bits
mark2r2 0:08a4d61cd84c 258 if ((count[0] += (length << 3)) < (length << 3))
mark2r2 0:08a4d61cd84c 259 count[1]++;
mark2r2 0:08a4d61cd84c 260 count[1] += (length >> 29);
mark2r2 0:08a4d61cd84c 261
mark2r2 0:08a4d61cd84c 262 // number of bytes we need to fill in buffer
mark2r2 0:08a4d61cd84c 263 size_type firstpart = 64 - index;
mark2r2 0:08a4d61cd84c 264
mark2r2 0:08a4d61cd84c 265 size_type i;
mark2r2 0:08a4d61cd84c 266
mark2r2 0:08a4d61cd84c 267 // transform as many times as possible.
mark2r2 0:08a4d61cd84c 268 if (length >= firstpart)
mark2r2 0:08a4d61cd84c 269 {
mark2r2 0:08a4d61cd84c 270 // fill buffer first, transform
mark2r2 0:08a4d61cd84c 271 memcpy(&buffer[index], input, firstpart);
mark2r2 0:08a4d61cd84c 272 transform(buffer);
mark2r2 0:08a4d61cd84c 273
mark2r2 0:08a4d61cd84c 274 // transform chunks of blocksize (64 bytes)
mark2r2 0:08a4d61cd84c 275 for (i = firstpart; i + blocksize <= length; i += blocksize)
mark2r2 0:08a4d61cd84c 276 transform(&input[i]);
mark2r2 0:08a4d61cd84c 277
mark2r2 0:08a4d61cd84c 278 index = 0;
mark2r2 0:08a4d61cd84c 279 }
mark2r2 0:08a4d61cd84c 280 else
mark2r2 0:08a4d61cd84c 281 i = 0;
mark2r2 0:08a4d61cd84c 282
mark2r2 0:08a4d61cd84c 283 // buffer remaining input
mark2r2 0:08a4d61cd84c 284 memcpy(&buffer[index], &input[i], length-i);
mark2r2 0:08a4d61cd84c 285 }
mark2r2 0:08a4d61cd84c 286
mark2r2 0:08a4d61cd84c 287 //////////////////////////////
mark2r2 0:08a4d61cd84c 288
mark2r2 0:08a4d61cd84c 289 // for convenience provide a verson with signed char
mark2r2 0:08a4d61cd84c 290 void MD5::update(const char input[], size_type length)
mark2r2 0:08a4d61cd84c 291 {
mark2r2 0:08a4d61cd84c 292 update((const unsigned char*)input, length);
mark2r2 0:08a4d61cd84c 293 }
mark2r2 0:08a4d61cd84c 294
mark2r2 0:08a4d61cd84c 295 //////////////////////////////
mark2r2 0:08a4d61cd84c 296
mark2r2 0:08a4d61cd84c 297 // MD5 finalization. Ends an MD5 message-digest operation, writing the
mark2r2 0:08a4d61cd84c 298 // the message digest and zeroizing the context.
mark2r2 0:08a4d61cd84c 299 MD5& MD5::finalize()
mark2r2 0:08a4d61cd84c 300 {
mark2r2 0:08a4d61cd84c 301 static unsigned char padding[64] = {
mark2r2 0:08a4d61cd84c 302 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
mark2r2 0:08a4d61cd84c 303 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
mark2r2 0:08a4d61cd84c 304 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
mark2r2 0:08a4d61cd84c 305 };
mark2r2 0:08a4d61cd84c 306
mark2r2 0:08a4d61cd84c 307 if (!finalized) {
mark2r2 0:08a4d61cd84c 308 // Save number of bits
mark2r2 0:08a4d61cd84c 309 unsigned char bits[8];
mark2r2 0:08a4d61cd84c 310 encode(bits, count, 8);
mark2r2 0:08a4d61cd84c 311
mark2r2 0:08a4d61cd84c 312 // pad out to 56 mod 64.
mark2r2 0:08a4d61cd84c 313 size_type index = count[0] / 8 % 64;
mark2r2 0:08a4d61cd84c 314 size_type padLen = (index < 56) ? (56 - index) : (120 - index);
mark2r2 0:08a4d61cd84c 315 update(padding, padLen);
mark2r2 0:08a4d61cd84c 316
mark2r2 0:08a4d61cd84c 317 // Append length (before padding)
mark2r2 0:08a4d61cd84c 318 update(bits, 8);
mark2r2 0:08a4d61cd84c 319
mark2r2 0:08a4d61cd84c 320 // Store state in digest
mark2r2 0:08a4d61cd84c 321 encode(digest, state, 16);
mark2r2 0:08a4d61cd84c 322
mark2r2 0:08a4d61cd84c 323 // Zeroize sensitive information.
mark2r2 0:08a4d61cd84c 324 memset(buffer, 0, sizeof buffer);
mark2r2 0:08a4d61cd84c 325 memset(count, 0, sizeof count);
mark2r2 0:08a4d61cd84c 326
mark2r2 0:08a4d61cd84c 327 finalized=true;
mark2r2 0:08a4d61cd84c 328 }
mark2r2 0:08a4d61cd84c 329
mark2r2 0:08a4d61cd84c 330 return *this;
mark2r2 0:08a4d61cd84c 331 }
mark2r2 0:08a4d61cd84c 332
mark2r2 0:08a4d61cd84c 333 //////////////////////////////
mark2r2 0:08a4d61cd84c 334
mark2r2 0:08a4d61cd84c 335 // return hex representation of digest as string
mark2r2 0:08a4d61cd84c 336 std::string MD5::hexdigest() const
mark2r2 0:08a4d61cd84c 337 {
mark2r2 0:08a4d61cd84c 338 if (!finalized)
mark2r2 0:08a4d61cd84c 339 return "";
mark2r2 0:08a4d61cd84c 340
mark2r2 0:08a4d61cd84c 341 char buf[33];
mark2r2 0:08a4d61cd84c 342 for (int i=0; i<16; i++)
mark2r2 0:08a4d61cd84c 343 sprintf(buf+i*2, "%02x", digest[i]);
mark2r2 0:08a4d61cd84c 344 buf[32]=0;
mark2r2 0:08a4d61cd84c 345
mark2r2 0:08a4d61cd84c 346 return std::string(buf);
mark2r2 0:08a4d61cd84c 347 }
mark2r2 0:08a4d61cd84c 348
mark2r2 0:08a4d61cd84c 349 //////////////////////////////
mark2r2 0:08a4d61cd84c 350
mark2r2 0:08a4d61cd84c 351 std::string md5(const std::string str)
mark2r2 0:08a4d61cd84c 352 {
mark2r2 0:08a4d61cd84c 353 MD5 md5 = MD5(str);
mark2r2 0:08a4d61cd84c 354
mark2r2 0:08a4d61cd84c 355 return md5.hexdigest();
mark2r2 0:08a4d61cd84c 356 }