KiCad PCB EDA Suite
md5_hash.cpp
Go to the documentation of this file.
1 // Code by: B-Con (http://b-con.us)
2 // Released under the GNU GPL
3 // MD5 Hash Digest implementation (little endian byte order)
4 
5 
6 #include <cstring>
7 #include <cstdio>
8 
9 #include <md5_hash.h>
10 
11 // DBL_INT_ADD treats two unsigned ints a and b as one 64-bit integer and adds c to it
12 #define DBL_INT_ADD(a,b,c) if (a > 0xffffffff - c) ++b; a += c;
13 #define ROTLEFT(a,b) ((a << b) | (a >> (32-b)))
14 
15 #define F(x,y,z) ((x & y) | (~x & z))
16 #define G(x,y,z) ((x & z) | (y & ~z))
17 #define H(x,y,z) (x ^ y ^ z)
18 #define I(x,y,z) (y ^ (x | ~z))
19 
20 #define FF(a,b,c,d,m,s,t) { a += F(b,c,d) + m + t; \
21  a = b + ROTLEFT(a,s); }
22 #define GG(a,b,c,d,m,s,t) { a += G(b,c,d) + m + t; \
23  a = b + ROTLEFT(a,s); }
24 #define HH(a,b,c,d,m,s,t) { a += H(b,c,d) + m + t; \
25  a = b + ROTLEFT(a,s); }
26 #define II(a,b,c,d,m,s,t) { a += I(b,c,d) + m + t; \
27  a = b + ROTLEFT(a,s); }
28 
29 
30 
31 
33 {
34  Init();
35 }
36 
37 MD5_HASH::MD5_HASH( const MD5_HASH& aOther )
38 {
39  m_valid = aOther.m_valid;
40  m_ctx = aOther.m_ctx;
41  memcpy( m_hash, aOther.m_hash, 16 );
42 }
43 
45 {
46 
47 }
48 
50 {
51  m_valid = aOther.m_valid;
52  m_ctx = aOther.m_ctx;
53  memcpy( m_hash, aOther.m_hash, 16 );
54 
55  return *this;
56 }
57 
58 
60 {
61  //printf("%p init\n", this);
62  m_valid = false;
63  md5_init(&m_ctx);
64 }
65 
66 void MD5_HASH::Hash ( uint8_t *data, uint32_t length )
67 {
68  md5_update(&m_ctx, data, length);
69 }
70 
71 void MD5_HASH::Hash ( int value )
72 {
73  md5_update(&m_ctx, (uint8_t*) &value, sizeof(int) );
74 }
75 
77 {
78  //printf("%p final\n", this);
80  m_valid = true;
81 
82 }
83 
84 bool MD5_HASH::operator==( const MD5_HASH& aOther ) const
85 {
86  return ( memcmp( m_hash, aOther.m_hash, 16 ) == 0 );
87 }
88 
89 bool MD5_HASH::operator!=( const MD5_HASH& aOther ) const
90 {
91  return ( memcmp( m_hash, aOther.m_hash, 16 ) != 0 );
92 }
93 
94 
95 std::string MD5_HASH::Format()
96 {
97  std::string data;
98 
99  // Build a hexadecimal string from the 16 bytes of MD5_HASH:
100  for( int ii = 0; ii < 16; ++ii )
101  {
102  char lsb = ( m_hash[ii] & 0x0F ) + '0';
103 
104  if( lsb > '9' )
105  lsb += 'A'-'9';
106 
107  char msb = ( ( m_hash[ii] >> 4 ) & 0x0F ) + '0';
108 
109  if( msb > '9' )
110  msb += 'A'-'9';
111 
112  data += msb;
113  data += lsb;
114  data += ' ';
115  }
116 
117  return data;
118 }
119 
120 
121 void MD5_HASH::md5_transform(MD5_CTX *ctx, uint8_t data[])
122 {
123  uint32_t a,b,c,d,m[16],i,j;
124 
125  // MD5 specifies big endian byte order, but this implementation assumes a little
126  // endian byte order CPU. Reverse all the bytes upon input, and re-reverse them
127  // on output (in md5_final()).
128  for (i=0,j=0; i < 16; ++i, j += 4)
129  m[i] = (data[j]) + (data[j+1] << 8) + (data[j+2] << 16) + (data[j+3] << 24);
130 
131  a = ctx->state[0];
132  b = ctx->state[1];
133  c = ctx->state[2];
134  d = ctx->state[3];
135 
136  FF(a,b,c,d,m[0], 7,0xd76aa478);
137  FF(d,a,b,c,m[1], 12,0xe8c7b756);
138  FF(c,d,a,b,m[2], 17,0x242070db);
139  FF(b,c,d,a,m[3], 22,0xc1bdceee);
140  FF(a,b,c,d,m[4], 7,0xf57c0faf);
141  FF(d,a,b,c,m[5], 12,0x4787c62a);
142  FF(c,d,a,b,m[6], 17,0xa8304613);
143  FF(b,c,d,a,m[7], 22,0xfd469501);
144  FF(a,b,c,d,m[8], 7,0x698098d8);
145  FF(d,a,b,c,m[9], 12,0x8b44f7af);
146  FF(c,d,a,b,m[10],17,0xffff5bb1);
147  FF(b,c,d,a,m[11],22,0x895cd7be);
148  FF(a,b,c,d,m[12], 7,0x6b901122);
149  FF(d,a,b,c,m[13],12,0xfd987193);
150  FF(c,d,a,b,m[14],17,0xa679438e);
151  FF(b,c,d,a,m[15],22,0x49b40821);
152 
153  GG(a,b,c,d,m[1], 5,0xf61e2562);
154  GG(d,a,b,c,m[6], 9,0xc040b340);
155  GG(c,d,a,b,m[11],14,0x265e5a51);
156  GG(b,c,d,a,m[0], 20,0xe9b6c7aa);
157  GG(a,b,c,d,m[5], 5,0xd62f105d);
158  GG(d,a,b,c,m[10], 9,0x02441453);
159  GG(c,d,a,b,m[15],14,0xd8a1e681);
160  GG(b,c,d,a,m[4], 20,0xe7d3fbc8);
161  GG(a,b,c,d,m[9], 5,0x21e1cde6);
162  GG(d,a,b,c,m[14], 9,0xc33707d6);
163  GG(c,d,a,b,m[3], 14,0xf4d50d87);
164  GG(b,c,d,a,m[8], 20,0x455a14ed);
165  GG(a,b,c,d,m[13], 5,0xa9e3e905);
166  GG(d,a,b,c,m[2], 9,0xfcefa3f8);
167  GG(c,d,a,b,m[7], 14,0x676f02d9);
168  GG(b,c,d,a,m[12],20,0x8d2a4c8a);
169 
170  HH(a,b,c,d,m[5], 4,0xfffa3942);
171  HH(d,a,b,c,m[8], 11,0x8771f681);
172  HH(c,d,a,b,m[11],16,0x6d9d6122);
173  HH(b,c,d,a,m[14],23,0xfde5380c);
174  HH(a,b,c,d,m[1], 4,0xa4beea44);
175  HH(d,a,b,c,m[4], 11,0x4bdecfa9);
176  HH(c,d,a,b,m[7], 16,0xf6bb4b60);
177  HH(b,c,d,a,m[10],23,0xbebfbc70);
178  HH(a,b,c,d,m[13], 4,0x289b7ec6);
179  HH(d,a,b,c,m[0], 11,0xeaa127fa);
180  HH(c,d,a,b,m[3], 16,0xd4ef3085);
181  HH(b,c,d,a,m[6], 23,0x04881d05);
182  HH(a,b,c,d,m[9], 4,0xd9d4d039);
183  HH(d,a,b,c,m[12],11,0xe6db99e5);
184  HH(c,d,a,b,m[15],16,0x1fa27cf8);
185  HH(b,c,d,a,m[2], 23,0xc4ac5665);
186 
187  II(a,b,c,d,m[0], 6,0xf4292244);
188  II(d,a,b,c,m[7], 10,0x432aff97);
189  II(c,d,a,b,m[14],15,0xab9423a7);
190  II(b,c,d,a,m[5], 21,0xfc93a039);
191  II(a,b,c,d,m[12], 6,0x655b59c3);
192  II(d,a,b,c,m[3], 10,0x8f0ccc92);
193  II(c,d,a,b,m[10],15,0xffeff47d);
194  II(b,c,d,a,m[1], 21,0x85845dd1);
195  II(a,b,c,d,m[8], 6,0x6fa87e4f);
196  II(d,a,b,c,m[15],10,0xfe2ce6e0);
197  II(c,d,a,b,m[6], 15,0xa3014314);
198  II(b,c,d,a,m[13],21,0x4e0811a1);
199  II(a,b,c,d,m[4], 6,0xf7537e82);
200  II(d,a,b,c,m[11],10,0xbd3af235);
201  II(c,d,a,b,m[2], 15,0x2ad7d2bb);
202  II(b,c,d,a,m[9], 21,0xeb86d391);
203 
204  ctx->state[0] += a;
205  ctx->state[1] += b;
206  ctx->state[2] += c;
207  ctx->state[3] += d;
208 }
209 
211 {
212  ctx->datalen = 0;
213  ctx->bitlen[0] = 0;
214  ctx->bitlen[1] = 0;
215  ctx->state[0] = 0x67452301;
216  ctx->state[1] = 0xEFCDAB89;
217  ctx->state[2] = 0x98BADCFE;
218  ctx->state[3] = 0x10325476;
219 }
220 
221 void MD5_HASH::md5_update(MD5_CTX *ctx, uint8_t data[], uint32_t len)
222 {
223  uint32_t i;
224 
225  for (i=0; i < len; ++i) {
226  ctx->data[ctx->datalen] = data[i];
227  ctx->datalen++;
228  if (ctx->datalen == 64) {
229  md5_transform(ctx,ctx->data);
230  DBL_INT_ADD(ctx->bitlen[0],ctx->bitlen[1],512);
231  ctx->datalen = 0;
232  }
233  }
234 }
235 
236 void MD5_HASH::md5_final(MD5_CTX *ctx, uint8_t hash[])
237 {
238  uint32_t i;
239 
240  i = ctx->datalen;
241 
242  // Pad whatever data is left in the buffer.
243  if (ctx->datalen < 56) {
244  ctx->data[i++] = 0x80;
245  while (i < 56)
246  ctx->data[i++] = 0x00;
247  }
248  else if (ctx->datalen >= 56) {
249  ctx->data[i++] = 0x80;
250  while (i < 64)
251  ctx->data[i++] = 0x00;
252  md5_transform(ctx,ctx->data);
253  memset(ctx->data,0,56);
254  }
255 
256  // Append to the padding the total message's length in bits and transform.
257  DBL_INT_ADD(ctx->bitlen[0],ctx->bitlen[1],8 * ctx->datalen);
258  ctx->data[56] = ctx->bitlen[0];
259  ctx->data[57] = ctx->bitlen[0] >> 8;
260  ctx->data[58] = ctx->bitlen[0] >> 16;
261  ctx->data[59] = ctx->bitlen[0] >> 24;
262  ctx->data[60] = ctx->bitlen[1];
263  ctx->data[61] = ctx->bitlen[1] >> 8;
264  ctx->data[62] = ctx->bitlen[1] >> 16;
265  ctx->data[63] = ctx->bitlen[1] >> 24;
266  md5_transform(ctx,ctx->data);
267 
268  // Since this implementation uses little endian byte ordering and MD uses big endian,
269  // reverse all the bytes when copying the final state to the output hash.
270  for (i=0; i < 4; ++i) {
271  hash[i] = (ctx->state[0] >> (i*8)) & 0x000000ff;
272  hash[i+4] = (ctx->state[1] >> (i*8)) & 0x000000ff;
273  hash[i+8] = (ctx->state[2] >> (i*8)) & 0x000000ff;
274  hash[i+12] = (ctx->state[3] >> (i*8)) & 0x000000ff;
275  }
276 }
MD5_HASH()
Definition: md5_hash.cpp:32
#define FF(a, b, c, d, m, s, t)
Definition: md5_hash.cpp:20
uint32_t bitlen[2]
Definition: md5_hash.h:42
bool operator!=(const MD5_HASH &aOther) const
Definition: md5_hash.cpp:89
void md5_final(MD5_CTX *ctx, uint8_t hash[])
Definition: md5_hash.cpp:236
#define GG(a, b, c, d, m, s, t)
Definition: md5_hash.cpp:22
#define II(a, b, c, d, m, s, t)
Definition: md5_hash.cpp:26
std::string Format()
Definition: md5_hash.cpp:95
void Hash(uint8_t *data, uint32_t length)
Definition: md5_hash.cpp:66
void md5_init(MD5_CTX *ctx)
Definition: md5_hash.cpp:210
#define HH(a, b, c, d, m, s, t)
Definition: md5_hash.cpp:24
bool m_valid
Definition: md5_hash.h:51
uint32_t state[4]
Definition: md5_hash.h:43
void md5_update(MD5_CTX *ctx, uint8_t data[], uint32_t len)
Definition: md5_hash.cpp:221
uint32_t datalen
Definition: md5_hash.h:41
void md5_transform(MD5_CTX *ctx, uint8_t data[])
Definition: md5_hash.cpp:121
uint8_t m_hash[16]
Definition: md5_hash.h:53
uint8_t data[64]
Definition: md5_hash.h:40
bool operator==(const MD5_HASH &aOther) const
Definition: md5_hash.cpp:84
void Init()
Definition: md5_hash.cpp:59
#define DBL_INT_ADD(a, b, c)
Definition: md5_hash.cpp:12
void Finalize()
Definition: md5_hash.cpp:76
MD5_CTX m_ctx
Definition: md5_hash.h:52
MD5_HASH & operator=(const MD5_HASH &aOther)
Definition: md5_hash.cpp:49
~MD5_HASH()
Definition: md5_hash.cpp:44