Skip to content
Snippets Groups Projects
Commit 92f971db authored by Adam Edward Barton's avatar Adam Edward Barton
Browse files

Merge branch 'md5.CxxUtils-20170901' into 'master' 

CxxUtils: Replace MD5 implementation with a public-domain version.

See merge request !4362
parents 7e909731 8c7de172
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
Control/CxxUtils/CMakeLists.txt
+ 4
− 0
View file @ 92f971db
......@@ -66,6 +66,10 @@ atlas_add_test( stacktrace_test
SOURCES test/stacktrace_test.cxx
LINK_LIBRARIES CxxUtils dl )
atlas_add_test( MD5_test
SOURCES test/MD5_test.cxx
LINK_LIBRARIES CxxUtils )
atlas_add_test( bitscan_test_portable
SOURCES test/bitscan_test.cxx
LINK_LIBRARIES CxxUtils )
......
Control/CxxUtils/CxxUtils/MD5.h
+ 41
− 144
View file @ 92f971db
/**
* @file CxxUtils/MD5.h
* @author scott snyder <snyder@bnl.gov>, from public domain code.
* @date Aug 2017
* @brief solar's public-domain MD5, wrapped for C++.
*/
#ifndef CXXUTILS_MD5_H
#define CXXUTILS_MD5_H 1
// MD5.CC - source code for the C++/object oriented translation and
// modification of MD5.
// Translation and modification (c) 1995 by Mordechai T. Abzug
// This translation/ modification is provided "as is," without express or
// implied warranty of any kind.
// The translator/ modifier does not claim (1) that MD5 will do what you think
// it does; (2) that this translation/ modification is accurate; or (3) that
// this software is "merchantible." (Language for this disclaimer partially
// copied from the disclaimer below).
/* based on:
MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
MDDRIVER.C - test driver for MD2, MD4 and MD5
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
rights reserved.
License to copy and use this software is granted provided that it
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
Algorithm" in all material mentioning or referencing this software
or this function.
License is also granted to make and use derivative works provided
that such works are identified as "derived from the RSA Data
Security, Inc. MD5 Message-Digest Algorithm" in all material
mentioning or referencing the derived work.
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.
#ifndef CXXUTILS_MD5_H
#define CXXUTILS_MD5_H
These notices must be retained in any copies of any part of this
documentation and/or software.
*/
#include <string>
// Constants for MD5Transform routine.
// Although we could use C++ style constants, defines are actually better,
// since they let us easily evade scope clashes.
#define S11 7
#define S12 12
#define S13 17
#define S14 22
#define S21 5
#define S22 9
#define S23 14
#define S24 20
#define S31 4
#define S32 11
#define S33 16
#define S34 23
#define S41 6
#define S42 10
#define S43 15
#define S44 21
class MD5 {
public:
MD5 (const unsigned char* buffer, unsigned long len);
MD5 ();
void update (const unsigned char *input, unsigned int input_length);
// Finalize MD5 check-sum
void finalize ();
void raw_digest (unsigned char *buff) const;
std::string hex_digest () const;
private:
// next, the private data:
unsigned int m_state[4];
unsigned int m_count[2]; // number of *bits*, mod 2^64
unsigned char m_buffer[64]; // input buffer
unsigned char m_digest[16];
unsigned char m_finalized;
// last, the private methods, mostly static:
void init (); // called by all constructors
void transform (const unsigned char *buffer); // does the real update work. Note
// that length is implied to be 64.
static void encode (unsigned char *dest, const unsigned int *src, unsigned int length);
static void decode (unsigned int *dest, const unsigned char *src, unsigned int length);
// ROTATE_LEFT rotates x left n bits.
static inline unsigned int rotate_left (unsigned int x, unsigned int n)
{ return (x << n) | (x >> (32-n)); }
// F, G, H and I are basic MD5 functions.
static inline unsigned int F(unsigned int x, unsigned int y, unsigned int z)
{ return (x & y) | (~x & z); }
static inline unsigned int G(unsigned int x, unsigned int y, unsigned int z)
{ return (x & z) | (y & ~z); }
static inline unsigned int H(unsigned int x, unsigned int y, unsigned int z)
{ return x ^ y ^ z; }
static inline unsigned int I(unsigned int x, unsigned int y, unsigned int z)
{ return y ^ (x | ~z); }
// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
// Rotation is separate from addition to prevent recomputation.
static inline void FF (unsigned int& a, unsigned int b, unsigned int c, unsigned int d, unsigned int x, unsigned int s, unsigned int ac)
{
a += F(b, c, d) + x + ac;
a = rotate_left(a, s) + b;
}
static inline void GG (unsigned int& a, unsigned int b, unsigned int c, unsigned int d, unsigned int x, unsigned int s, unsigned int ac)
{
a += G(b, c, d) + x + ac;
a = rotate_left(a, s) + b;
}
static inline void HH (unsigned int& a, unsigned int b, unsigned int c, unsigned int d, unsigned int x, unsigned int s, unsigned int ac)
{
a += H(b, c, d) + x + ac;
a = rotate_left(a, s) + b;
}
static inline void II (unsigned int& a, unsigned int b, unsigned int c, unsigned int d, unsigned int x, unsigned int s, unsigned int ac)
{
a += I(b, c, d) + x + ac;
a = rotate_left(a, s) + b;
}
#include <cstdlib>
#include <cstdint>
#include <uuid/uuid.h>
class MD5
{
public:
MD5 (const unsigned char* buffer, unsigned long len);
MD5 (const char* buffer, size_t len);
MD5 (const std::string& buffer);
void raw_digest (unsigned char* s) const; // 16-byte buffer
void uuid_digest (uuid_t& uuid) const;
std::string hex_digest() const;
private:
typedef uint32_t MD5_u32plus;
struct Context {
MD5_u32plus lo, hi;
MD5_u32plus a, b, c, d;
unsigned char buffer[64];
MD5_u32plus block[16];
};
Context m_ctx;
unsigned char m_digest[16];
void init();
void update (const void* data, size_t size);
void digest (unsigned char* result);
const void* body (const void* data, size_t size);
};
struct MD5_digest {
unsigned long long val[2];
MD5_digest() {};
MD5_digest( const std::string& msg ) {
MD5 checkSum( (unsigned char*)(msg.c_str()), msg.length());
checkSum.raw_digest( (unsigned char*) &val );
}
bool operator< (const MD5_digest& rhs) const {
if (val[0] == rhs.val[0]) {
return (val[1] < rhs.val[1]);
} else {
return (val[0] < rhs.val[0]);
}
}
};
#endif
#endif // not CXXUTILS_MD5_H
Control/CxxUtils/Root/MD5.cxx
+ 323
− 195
View file @ 92f971db
// $Id$
/**
* @file CxxUtils/Root/MD5.cxx
* @author scott snyder <snyder@bnl.gov>, from public domain code.
* @date Aug 2017
* @brief solar's public-domain MD5, wrapped for C++.
*/
/*
Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
* This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
* MD5 Message-Digest Algorithm (RFC 1321).
*
* Homepage:
* http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
*
* Author:
* Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
*
* This software was written by Alexander Peslyak in 2001. No copyright is
* claimed, and the software is hereby placed in the public domain.
* In case this attempt to disclaim copyright and place the software in the
* public domain is deemed null and void, then the software is
* Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
* general public under the following terms:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted.
*
* There's ABSOLUTELY NO WARRANTY, express or implied.
*
* (This is a heavily cut-down "BSD license".)
*
* This differs from Colin Plumb's older public domain implementation in that
* no exactly 32-bit integer data type is required (any 32-bit or wider
* unsigned integer data type will do), there's no compile-time endianness
* configuration, and the function prototypes match OpenSSL's. No code from
* Colin Plumb's implementation has been reused; this comment merely compares
* the properties of the two independent implementations.
*
* The primary goals of this implementation are portability and ease of use.
* It is meant to be fast, but not as fast as possible. Some known
* optimizations are not included to reduce source code size and avoid
* compile-time configuration.
*/
//#ifndef HAVE_OPENSSL
#include <string.h>
#include "CxxUtils/MD5.h"
#include <cassert>
#include <string>
#include <cstdio>
#include <iostream>
#include <string.h>
// C++ wrapper functions.
// MD5 simple initialization method
MD5::MD5() {
MD5::MD5 (const unsigned char* buffer, unsigned long len)
{
init();
memset (m_buffer, 0, sizeof(m_buffer));
memset (m_digest, 0, sizeof(m_digest));
update (buffer, len);
digest (m_digest);
}
// MD5 simple initialization method
MD5::MD5(const unsigned char* buffer, unsigned long len) {
MD5::MD5 (const char* buffer, size_t len)
{
init();
update(buffer, len);
finalize();
update (buffer, len);
digest (m_digest);
}
// MD5 block update operation. Continues an MD5 message-digest
// operation, processing another message block, and updating the
// context.
void MD5::update (const unsigned char *input, unsigned int input_length) {
unsigned int idx, index, space;
if ( m_finalized ) { // so we can't update!
std::cerr << "MD5::update: Can't update a finalized digest!" << std::endl;
return;
}
// Compute number of bytes mod 64
index = (unsigned int)((m_count[0] >> 3) & 0x3F);
// Update number of bits
if ( (m_count[0] += ((unsigned int) input_length << 3))<((unsigned int) input_length << 3) )
m_count[1]++;
m_count[1] += ((unsigned int)input_length >> 29);
space = 64 - index; // how much space is left in buffer
// Transform as many times as possible.
if (input_length >= space) { // ie. we have enough to fill the buffer
// fill the rest of the buffer and transform
memcpy (m_buffer + index, input, space);
transform (m_buffer);
// now, transform each 64-byte piece of the input, bypassing the buffer
for (idx = space; idx + 63 < input_length; idx += 64)
transform (input+idx);
index = 0; // so we can buffer remaining
}
else {
idx = 0; // so we can buffer the whole input
}
// and here we do the buffering:
memcpy(m_buffer+index, input+idx, input_length-idx);
MD5::MD5 (const std::string& s)
{
init();
update (s.c_str(), s.size());
digest (m_digest);
}
// MD5 finalization. Ends an MD5 message-digest operation, writing the
// the message digest and zeroizing the context.
void MD5::finalize () {
unsigned char bits[8];
unsigned int index, padLen;
static const unsigned char 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
};
if (m_finalized){
std::cerr << "MD5::finalize: Already finalized this digest!" << std::endl;
return;
}
// Save number of bits
encode (bits, m_count, 8);
// Pad out to 56 mod 64.
index = (unsigned int) ((m_count[0] >> 3) & 0x3f);
padLen = (index < 56) ? (56 - index) : (120 - index);
update (PADDING, padLen);
// Append length (before padding)
update (bits, 8);
// Store state in digest
encode (m_digest, m_state, 16);
// Zeroize sensitive information
memset (m_buffer, 0, sizeof(*m_buffer));
m_finalized=1;
void MD5::raw_digest (unsigned char* s) const
{
memcpy (s, m_digest, 16);
}
void MD5::raw_digest(unsigned char *s) const {
if (m_finalized){
memcpy(s, m_digest, 16);
return;
}
std::cerr << "MD5::raw_digest: Can't get digest if you haven't "<<
"finalized the digest!" << std::endl;
void MD5::uuid_digest (uuid_t& uuid) const
{
memcpy (&uuid, m_digest, 16);
}
std::string MD5::hex_digest() const {
std::string MD5::hex_digest() const
{
char s[33];
if (!m_finalized){
std::cerr << "MD5::hex_digest: Can't get digest if you haven't "<<
"finalized the digest!" <<std::endl;
return "";
for (int i = 0; i < 16; i++) {
snprintf (s+i*2, 3, "%02x", m_digest[i]);
}
for (int i=0; i<16; i++)
sprintf(s+i*2, "%02x", m_digest[i]);
s[32]='\0';
s[32] = '\0';
return s;
}
// PRIVATE METHODS:
void MD5::init(){
m_finalized=0; // we just started!
// Nothing counted, so count=0
m_count[0] = 0;
m_count[1] = 0;
// Load magic initialization constants.
m_state[0] = 0x67452301;
m_state[1] = 0xefcdab89;
m_state[2] = 0x98badcfe;
m_state[3] = 0x10325476;
/*
* The basic MD5 functions.
*
* F and G are optimized compared to their RFC 1321 definitions for
* architectures that lack an AND-NOT instruction, just like in Colin Plumb's
* implementation.
*/
#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
#define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
#define H(x, y, z) (((x) ^ (y)) ^ (z))
#define H2(x, y, z) ((x) ^ ((y) ^ (z)))
#define I(x, y, z) ((y) ^ ((x) | ~(z)))
/*
* The MD5 transformation for all four rounds.
*/
#define STEP(f, a, b, c, d, x, t, s) \
(a) += f((b), (c), (d)) + (x) + (t); \
(a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
(a) += (b);
/*
* SET reads 4 input bytes in little-endian byte order and stores them in a
* properly aligned word in host byte order.
*
* The check for little-endian architectures that tolerate unaligned memory
* accesses is just an optimization. Nothing will break if it fails to detect
* a suitable architecture.
*
* Unfortunately, this optimization may be a C strict aliasing rules violation
* if the caller's data buffer has effective type that cannot be aliased by
* MD5_u32plus. In practice, this problem may occur if these MD5 routines are
* inlined into a calling function, or with future and dangerously advanced
* link-time optimizations. For the time being, keeping these MD5 routines in
* their own translation unit avoids the problem.
*/
#if defined(__i386__) || defined(__x86_64__) || defined(__vax__)
#define SET(n) \
(*(MD5_u32plus *)&ptr[(n) * 4])
#define GET(n) \
SET(n)
#else
#define SET(n) \
(ctx->block[(n)] = \
(MD5_u32plus)ptr[(n) * 4] | \
((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \
((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \
((MD5_u32plus)ptr[(n) * 4 + 3] << 24))
#define GET(n) \
(ctx->block[(n)])
#endif
/*
* This processes one or more 64-byte data blocks, but does NOT update the bit
* counters. There are no alignment requirements.
*/
const void* MD5::body (const void *data, size_t size)
{
const unsigned char *ptr;
MD5_u32plus a, b, c, d;
MD5_u32plus saved_a, saved_b, saved_c, saved_d;
Context* ctx = &m_ctx;
ptr = (const unsigned char *)data;
a = ctx->a;
b = ctx->b;
c = ctx->c;
d = ctx->d;
do {
saved_a = a;
saved_b = b;
saved_c = c;
saved_d = d;
/* Round 1 */
STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7)
STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12)
STEP(F, c, d, a, b, SET(2), 0x242070db, 17)
STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22)
STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7)
STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12)
STEP(F, c, d, a, b, SET(6), 0xa8304613, 17)
STEP(F, b, c, d, a, SET(7), 0xfd469501, 22)
STEP(F, a, b, c, d, SET(8), 0x698098d8, 7)
STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12)
STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17)
STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22)
STEP(F, a, b, c, d, SET(12), 0x6b901122, 7)
STEP(F, d, a, b, c, SET(13), 0xfd987193, 12)
STEP(F, c, d, a, b, SET(14), 0xa679438e, 17)
STEP(F, b, c, d, a, SET(15), 0x49b40821, 22)
/* Round 2 */
STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5)
STEP(G, d, a, b, c, GET(6), 0xc040b340, 9)
STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14)
STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20)
STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5)
STEP(G, d, a, b, c, GET(10), 0x02441453, 9)
STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14)
STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20)
STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5)
STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9)
STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14)
STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20)
STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5)
STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9)
STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14)
STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20)
/* Round 3 */
STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4)
STEP(H2, d, a, b, c, GET(8), 0x8771f681, 11)
STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16)
STEP(H2, b, c, d, a, GET(14), 0xfde5380c, 23)
STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4)
STEP(H2, d, a, b, c, GET(4), 0x4bdecfa9, 11)
STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16)
STEP(H2, b, c, d, a, GET(10), 0xbebfbc70, 23)
STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4)
STEP(H2, d, a, b, c, GET(0), 0xeaa127fa, 11)
STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16)
STEP(H2, b, c, d, a, GET(6), 0x04881d05, 23)
STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4)
STEP(H2, d, a, b, c, GET(12), 0xe6db99e5, 11)
STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16)
STEP(H2, b, c, d, a, GET(2), 0xc4ac5665, 23)
/* Round 4 */
STEP(I, a, b, c, d, GET(0), 0xf4292244, 6)
STEP(I, d, a, b, c, GET(7), 0x432aff97, 10)
STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15)
STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21)
STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6)
STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10)
STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15)
STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21)
STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6)
STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10)
STEP(I, c, d, a, b, GET(6), 0xa3014314, 15)
STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21)
STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6)
STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10)
STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15)
STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21)
a += saved_a;
b += saved_b;
c += saved_c;
d += saved_d;
ptr += 64;
} while (size -= 64);
ctx->a = a;
ctx->b = b;
ctx->c = c;
ctx->d = d;
return ptr;
}
// MD5 basic transformation. Transforms state based on block.
void MD5::transform (const unsigned char* block){
unsigned int a = m_state[0], b = m_state[1], c = m_state[2], d = m_state[3], x[16];
decode (x, block, 64);
assert(!m_finalized); // not just a user error, since the method is private
/* Round 1 */
FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
/* Round 2 */
GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
/* Round 3 */
HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
/* Round 4 */
II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
m_state[0] += a;
m_state[1] += b;
m_state[2] += c;
m_state[3] += d;
// Zeroize sensitive information.
memset ( (unsigned char *) x, 0, sizeof(x));
void MD5::init()
{
Context* ctx = &m_ctx;
ctx->a = 0x67452301;
ctx->b = 0xefcdab89;
ctx->c = 0x98badcfe;
ctx->d = 0x10325476;
ctx->lo = 0;
ctx->hi = 0;
}
// Encodes input (unsigned int) into output (unsigned char). Assumes len is
// a multiple of 4.
void MD5::encode (unsigned char *output, const unsigned int *input, unsigned int len) {
for (unsigned int i = 0, j = 0; j < len; i++, j += 4) {
output[j] = (unsigned char) (input[i] & 0xff);
output[j+1] = (unsigned char) ((input[i] >> 8) & 0xff);
output[j+2] = (unsigned char) ((input[i] >> 16) & 0xff);
output[j+3] = (unsigned char) ((input[i] >> 24) & 0xff);
}
void MD5::update (const void *data, size_t size)
{
MD5_u32plus saved_lo;
unsigned long used, available;
Context* ctx = &m_ctx;
saved_lo = ctx->lo;
if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo)
ctx->hi++;
ctx->hi += size >> 29;
used = saved_lo & 0x3f;
if (used) {
available = 64 - used;
if (size < available) {
memcpy(&ctx->buffer[used], data, size);
return;
}
memcpy(&ctx->buffer[used], data, available);
data = (const unsigned char *)data + available;
size -= available;
body(ctx->buffer, 64);
}
if (size >= 64) {
data = body(data, size & ~(unsigned long)0x3f);
size &= 0x3f;
}
memcpy(ctx->buffer, data, size);
}
// Decodes input (unsigned char) into output (unsigned int). Assumes len is
// a multiple of 4.
void MD5::decode (unsigned int *output, const unsigned char *input, unsigned int len){
for (unsigned int i = 0, j = 0; j < len; i++, j += 4)
output[i] = ((unsigned int)input[j]) | (((unsigned int)input[j+1]) << 8) |
(((unsigned int)input[j+2]) << 16) | (((unsigned int)input[j+3]) << 24);
#define OUT(dst, src) \
(dst)[0] = (unsigned char)(src); \
(dst)[1] = (unsigned char)((src) >> 8); \
(dst)[2] = (unsigned char)((src) >> 16); \
(dst)[3] = (unsigned char)((src) >> 24);
void MD5::digest (unsigned char *result)
{
unsigned long used, available;
Context* ctx = &m_ctx;
used = ctx->lo & 0x3f;
ctx->buffer[used++] = 0x80;
available = 64 - used;
if (available < 8) {
memset(&ctx->buffer[used], 0, available);
body(ctx->buffer, 64);
used = 0;
available = 64;
}
memset(&ctx->buffer[used], 0, available - 8);
ctx->lo <<= 3;
OUT(&ctx->buffer[56], ctx->lo)
OUT(&ctx->buffer[60], ctx->hi)
body(ctx->buffer, 64);
OUT(&result[0], ctx->a)
OUT(&result[4], ctx->b)
OUT(&result[8], ctx->c)
OUT(&result[12], ctx->d)
memset(ctx, 0, sizeof(*ctx));
}
//#endif
Control/CxxUtils/share/MD5_test.ref 0 → 100644
+ 1
− 0
View file @ 92f971db
test1
Control/CxxUtils/test/MD5_test.cxx 0 → 100644
+ 56
− 0
View file @ 92f971db
/*
* Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration.
*/
// $Id$
/**
* @file CxxUtils/test/MDt5_test.cxx
* @author scott snyder
* @date Aug 2017
* @brief Regression tests for MD5
*/
#undef NDEBUG
#include "CxxUtils/MD5.h"
#include <iostream>
#include <cassert>
// Test vectors from
// <https://www.nist.gov/itl/ssd/software-quality-group/nsrl-test-data>
void test1()
{
std::cout << "test1\n";
{
MD5 md5 ((const unsigned char*)"abc", 3);
assert (md5.hex_digest() == "900150983cd24fb0d6963f7d28e17f72");
unsigned char buf[16];
md5.raw_digest (buf);
const unsigned char exp[16] = {
0x90, 0x01, 0x50, 0x98, 0x3c, 0xd2, 0x4f, 0xb0,
0xd6, 0x96, 0x3f, 0x7d, 0x28, 0xe1, 0x7f, 0x72,
};
for (int i = 0; i < 16; i++) {
assert (buf[i] == exp[i]);
}
}
{
MD5 md5 ((const unsigned char*)"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
assert (md5.hex_digest() == "8215ef0796a20bcaaae116d3876c664a");
}
{
std::string s (1000000, 'a');
MD5 md5 ((const unsigned char*)s.c_str(), s.size());
assert (md5.hex_digest() == "7707d6ae4e027c70eea2a935c2296f21");
}
}
int main()
{
test1();
return 0;
}
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment