- * Copyright (c) 2010 Remko Tronçon

-#include <boost/numeric/conversion/cast.hpp>

-

-#include <algorithm>

-

-#include <Swiften/Base/Algorithm.h>

-namespace Swift {

-#pragma GCC diagnostic ignored "-Wold-style-cast"

- template<typename TargetType, typename SourceType>

- TargetType base64Encode(const SourceType& s) {

- int i;

- int len = s.size();

- char tbl[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";

- int a, b, c;

-

- TargetType p;

- p.resize((len+2)/3*4);

- int at = 0;

- for( i = 0; i < len; i += 3 ) {

- a = ((unsigned char) (s[i]) & 3) << 4;

- if(i + 1 < len) {

- a += (unsigned char) (s[i + 1]) >> 4;

- b = ((unsigned char) (s[i + 1]) & 0xF) << 2;

- if(i + 2 < len) {

- b += (unsigned char) (s[i + 2]) >> 6;

- c = (unsigned char) (s[i + 2]) & 0x3F;

- }

- else

- c = 64;

- }

- else {

- b = c = 64;

- }

- p[at++] = tbl[(unsigned char) (s[i]) >> 2];

- p[at++] = tbl[a];

- p[at++] = tbl[b];

- p[at++] = tbl[c];

- return p;

-std::string Base64::encode(const ByteArray &s) {

- return base64Encode<std::string, ByteArray>(s);

-SafeByteArray Base64::encode(const SafeByteArray &s) {

- return base64Encode<SafeByteArray, SafeByteArray>(s);

- std::string inputWithoutNewlines(input);

- erase(inputWithoutNewlines, '\n');

-

- const std::string& s = inputWithoutNewlines;

- ByteArray p;

-

- // -1 specifies invalid

- // 64 specifies eof

- // everything else specifies data

-

- char tbl[] = {

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,62,-1,-1,-1,63,

- 52,53,54,55,56,57,58,59,60,61,-1,-1,-1,64,-1,-1,

- -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,

- 15,16,17,18,19,20,21,22,23,24,25,-1,-1,-1,-1,-1,

- -1,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,

- 41,42,43,44,45,46,47,48,49,50,51,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,

- };

- // this should be a multiple of 4

- int len = s.size();

-

- if(len % 4) {

- return p;

-

- p.resize(len / 4 * 3);

-

- int i;

- int at = 0;

-

- int a, b, c, d;

- c = d = 0;

-

- for( i = 0; i < len; i += 4 ) {

- a = tbl[boost::numeric_cast<int>(s[i])];

- b = tbl[boost::numeric_cast<int>(s[i + 1])];

- c = tbl[boost::numeric_cast<int>(s[i + 2])];

- d = tbl[boost::numeric_cast<int>(s[i + 3])];

- if((a == 64 || b == 64) || (a < 0 || b < 0 || c < 0 || d < 0)) {

- p.resize(0);

- return p;

- p[at++] = ((a & 0x3F) << 2) | ((b >> 4) & 0x03);

- p[at++] = ((b & 0x0F) << 4) | ((c >> 2) & 0x0F);

- p[at++] = ((c & 0x03) << 6) | ((d >> 0) & 0x3F);

-

- if(c & 64)

- p.resize(at - 2);

- else if(d & 64)

- p.resize(at - 1);

-

- return p;

-}

-

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#include <Swiften/Base/SafeByteArray.h>

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/Base/Algorithm.h>

-#include <cassert>

-

-namespace Swift {

- namespace HMAC_Detail {

- template<typename KeyType> struct KeyWrapper;

- template<> struct KeyWrapper<ByteArray> {

- ByteArray wrap(const ByteArray& hash) const {

- return hash;

- }

- };

- template<> struct KeyWrapper<SafeByteArray> {

- SafeByteArray wrap(const ByteArray& hash) const {

- return createSafeByteArray(hash);

- }

- };

-

- template<typename Hash, typename KeyType, int BlockSize>

- static ByteArray getHMAC(const KeyType& key, const ByteArray& data) {

- Hash hash;

-

- // Create the padded key

- KeyType paddedKey(key.size() <= BlockSize ? key : KeyWrapper<KeyType>().wrap(hash(key)));

- paddedKey.resize(BlockSize, 0x0);

-

- // Create the first value

- KeyType x(paddedKey);

- for (unsigned int i = 0; i < x.size(); ++i) {

- x[i] ^= 0x36;

- }

- append(x, data);

-

- // Create the second value

- KeyType y(paddedKey);

- for (unsigned int i = 0; i < y.size(); ++i) {

- y[i] ^= 0x5c;

- }

- append(y, hash(x));

-

- return hash(y);

- }

- };

-

- template<typename Hash, int BlockSize>

- class HMAC {

- private:

-

- public:

- ByteArray operator()(const ByteArray& key, const ByteArray& data) const {

- return HMAC_Detail::getHMAC<Hash,ByteArray,BlockSize>(key, data);

- }

-

- ByteArray operator()(const SafeByteArray& key, const ByteArray& data) const {

- return HMAC_Detail::getHMAC<Hash,SafeByteArray,BlockSize>(key, data);

- }

- };

-}

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#include <Swiften/StringCodecs/HMAC.h>

-#include <Swiften/StringCodecs/SHA1.h>

-

-namespace Swift {

- typedef HMAC<SHA1, 64> HMAC_SHA1;

-}

-/*

- * Copyright (c) 2011 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#include <Swiften/StringCodecs/HMAC.h>

-#include <Swiften/StringCodecs/SHA256.h>

-

-namespace Swift {

- typedef HMAC<SHA256, 64> HMAC_SHA256;

-}

-ByteArray Hexify::unhexify(const std::string& hexstring) {

- if (hexstring.size() % 2) {

- ByteArray result = ByteArray(hexstring.size() / 2);

- for (size_t pos = 0; pos < hexstring.size() - 1; pos += 2) {

- char c;

- c = hexstring[pos];

- int a = (c>='0'&&c<='9') ? c-'0' : (c>='A'&&c<='Z') ? c-'A' + 10 : (c>='a'&&c<='z') ? c-'a' + 10 : -1;

- c = hexstring[pos+1];

- int b = (c>='0'&&c<='9') ? c-'0' : (c>='A'&&c<='Z') ? c-'A' + 10 : (c>='a'&&c<='z') ? c-'a' + 10 : -1;

- if (a == -1 || b == -1) return ByteArray(); // fail

- result[pos/2] = (a<<4) | b;

-/*

- * Copyright (c) 2010-2012 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-/*

- * This implementation is shamelessly copied from L. Peter Deutsch's

- * implementation, and altered to use our own defines and datastructures.

- * Original license below.

- *//*

- Copyright (C) 1999, 2002 Aladdin Enterprises. All rights reserved.

-

- This software is provided 'as-is', without any express or implied

- warranty. In no event will the authors be held liable for any damages

- arising from the use of this software.

-

- Permission is granted to anyone to use this software for any purpose,

- including commercial applications, and to alter it and redistribute it

- freely, subject to the following restrictions:

-

- 1. The origin of this software must not be misrepresented; you must not

- claim that you wrote the original software. If you use this software

- in a product, an acknowledgment in the product documentation would be

- appreciated but is not required.

- 2. Altered source versions must be plainly marked as such, and must not be

- misrepresented as being the original software.

- 3. This notice may not be removed or altered from any source distribution.

-

- L. Peter Deutsch

- ghost@aladdin.com

- */

-

-#pragma GCC diagnostic ignored "-Wold-style-cast"

-

-#include <Swiften/StringCodecs/MD5.h>

-

-#include <cassert>

-#include <string.h>

-

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/Base/Platform.h>

-

-#ifdef SWIFTEN_PLATFORM_WIN32

-#include <Swiften/Base/WindowsRegistry.h>

-#endif

-

-namespace Swift {

-

-typedef unsigned char md5_byte_t; /* 8-bit byte */

-typedef unsigned int md5_word_t; /* 32-bit word */

-

-/* Define the state of the MD5 Algorithm. */

-typedef struct md5_state_s {

- md5_word_t count[2]; /* message length in bits, lsw first */

- md5_word_t abcd[4]; /* digest buffer */

- md5_byte_t buf[64]; /* accumulate block */

-} md5_state_t;

-

-#define T_MASK ((md5_word_t)~0)

-#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)

-#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)

-#define T3 0x242070db

-#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)

-#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)

-#define T6 0x4787c62a

-#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)

-#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)

-#define T9 0x698098d8

-#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)

-#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)

-#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)

-#define T13 0x6b901122

-#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)

-#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)

-#define T16 0x49b40821

-#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)

-#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)

-#define T19 0x265e5a51

-#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)

-#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)

-#define T22 0x02441453

-#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)

-#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)

-#define T25 0x21e1cde6

-#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)

-#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)

-#define T28 0x455a14ed

-#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)

-#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)

-#define T31 0x676f02d9

-#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)

-#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)

-#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)

-#define T35 0x6d9d6122

-#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)

-#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)

-#define T38 0x4bdecfa9

-#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)

-#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)

-#define T41 0x289b7ec6

-#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)

-#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)

-#define T44 0x04881d05

-#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)

-#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)

-#define T47 0x1fa27cf8

-#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)

-#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)

-#define T50 0x432aff97

-#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)

-#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)

-#define T53 0x655b59c3

-#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)

-#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)

-#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)

-#define T57 0x6fa87e4f

-#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)

-#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)

-#define T60 0x4e0811a1

-#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)

-#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)

-#define T63 0x2ad7d2bb

-#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)

-

-

-static void md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/) {

- md5_word_t

- a = pms->abcd[0], b = pms->abcd[1],

- c = pms->abcd[2], d = pms->abcd[3];

- md5_word_t t;

-#ifdef SWIFTEN_LITTLE_ENDIAN

- /* Define storage for little-endian or both types of CPUs. */

- md5_word_t xbuf[16];

- const md5_word_t *X;

-#else

- /* Define storage only for big-endian CPUs. */

- md5_word_t X[16];

-#endif

-

- {

-#ifdef SWIFTEN_LITTLE_ENDIAN

- {

- /*

- * On little-endian machines, we can process properly aligned

- * data without copying it.

- */

- if (!((data - (const md5_byte_t *)0) & 3)) {

- /* data are properly aligned */

- X = (const md5_word_t *)data;

- } else {

- /* not aligned */

- memcpy(xbuf, data, 64);

- X = xbuf;

- }

- }

-#else

- {

- /*

- * On big-endian machines, we must arrange the bytes in the

- * right order.

- */

- const md5_byte_t *xp = data;

- int i;

-

- for (i = 0; i < 16; ++i, xp += 4)

- X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);

- }

-#endif

- }

-

-#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))

-

- /* Round 1. */

- /* Let [abcd k s i] denote the operation

- a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */

-#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))

-#define SET(a, b, c, d, k, s, Ti)\

- t = a + F(b,c,d) + X[k] + Ti;\

- a = ROTATE_LEFT(t, s) + b

- /* Do the following 16 operations. */

- SET(a, b, c, d, 0, 7, T1);

- SET(d, a, b, c, 1, 12, T2);

- SET(c, d, a, b, 2, 17, T3);

- SET(b, c, d, a, 3, 22, T4);

- SET(a, b, c, d, 4, 7, T5);

- SET(d, a, b, c, 5, 12, T6);

- SET(c, d, a, b, 6, 17, T7);

- SET(b, c, d, a, 7, 22, T8);

- SET(a, b, c, d, 8, 7, T9);

- SET(d, a, b, c, 9, 12, T10);

- SET(c, d, a, b, 10, 17, T11);

- SET(b, c, d, a, 11, 22, T12);

- SET(a, b, c, d, 12, 7, T13);

- SET(d, a, b, c, 13, 12, T14);

- SET(c, d, a, b, 14, 17, T15);

- SET(b, c, d, a, 15, 22, T16);

-#undef SET

-

- /* Round 2. */

- /* Let [abcd k s i] denote the operation

- a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */

-#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))

-#define SET(a, b, c, d, k, s, Ti)\

- t = a + G(b,c,d) + X[k] + Ti;\

- a = ROTATE_LEFT(t, s) + b

- /* Do the following 16 operations. */

- SET(a, b, c, d, 1, 5, T17);

- SET(d, a, b, c, 6, 9, T18);

- SET(c, d, a, b, 11, 14, T19);

- SET(b, c, d, a, 0, 20, T20);

- SET(a, b, c, d, 5, 5, T21);

- SET(d, a, b, c, 10, 9, T22);

- SET(c, d, a, b, 15, 14, T23);

- SET(b, c, d, a, 4, 20, T24);

- SET(a, b, c, d, 9, 5, T25);

- SET(d, a, b, c, 14, 9, T26);

- SET(c, d, a, b, 3, 14, T27);

- SET(b, c, d, a, 8, 20, T28);

- SET(a, b, c, d, 13, 5, T29);

- SET(d, a, b, c, 2, 9, T30);

- SET(c, d, a, b, 7, 14, T31);

- SET(b, c, d, a, 12, 20, T32);

-#undef SET

-

- /* Round 3. */

- /* Let [abcd k s t] denote the operation

- a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */

-#define H(x, y, z) ((x) ^ (y) ^ (z))

-#define SET(a, b, c, d, k, s, Ti)\

- t = a + H(b,c,d) + X[k] + Ti;\

- a = ROTATE_LEFT(t, s) + b

- /* Do the following 16 operations. */

- SET(a, b, c, d, 5, 4, T33);

- SET(d, a, b, c, 8, 11, T34);

- SET(c, d, a, b, 11, 16, T35);

- SET(b, c, d, a, 14, 23, T36);

- SET(a, b, c, d, 1, 4, T37);

- SET(d, a, b, c, 4, 11, T38);

- SET(c, d, a, b, 7, 16, T39);

- SET(b, c, d, a, 10, 23, T40);

- SET(a, b, c, d, 13, 4, T41);

- SET(d, a, b, c, 0, 11, T42);

- SET(c, d, a, b, 3, 16, T43);

- SET(b, c, d, a, 6, 23, T44);

- SET(a, b, c, d, 9, 4, T45);

- SET(d, a, b, c, 12, 11, T46);

- SET(c, d, a, b, 15, 16, T47);

- SET(b, c, d, a, 2, 23, T48);

-#undef SET

-

- /* Round 4. */

- /* Let [abcd k s t] denote the operation

- a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */

-#define I(x, y, z) ((y) ^ ((x) | ~(z)))

-#define SET(a, b, c, d, k, s, Ti)\

- t = a + I(b,c,d) + X[k] + Ti;\

- a = ROTATE_LEFT(t, s) + b

- /* Do the following 16 operations. */

- SET(a, b, c, d, 0, 6, T49);

- SET(d, a, b, c, 7, 10, T50);

- SET(c, d, a, b, 14, 15, T51);

- SET(b, c, d, a, 5, 21, T52);

- SET(a, b, c, d, 12, 6, T53);

- SET(d, a, b, c, 3, 10, T54);

- SET(c, d, a, b, 10, 15, T55);

- SET(b, c, d, a, 1, 21, T56);

- SET(a, b, c, d, 8, 6, T57);

- SET(d, a, b, c, 15, 10, T58);

- SET(c, d, a, b, 6, 15, T59);

- SET(b, c, d, a, 13, 21, T60);

- SET(a, b, c, d, 4, 6, T61);

- SET(d, a, b, c, 11, 10, T62);

- SET(c, d, a, b, 2, 15, T63);

- SET(b, c, d, a, 9, 21, T64);

-#undef SET

-

- /* Then perform the following additions. (That is increment each

- of the four registers by the value it had before this block

- was started.) */

- pms->abcd[0] += a;

- pms->abcd[1] += b;

- pms->abcd[2] += c;

- pms->abcd[3] += d;

-}

-

-void

-md5_init(md5_state_t *pms)

-{

- pms->count[0] = pms->count[1] = 0;

- pms->abcd[0] = 0x67452301;

- pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;

- pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;

- pms->abcd[3] = 0x10325476;

-}

-

-void

-md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)

-{

- const md5_byte_t *p = data;

- int left = nbytes;

- int offset = (pms->count[0] >> 3) & 63;

- md5_word_t nbits = (md5_word_t)(nbytes << 3);

-

- if (nbytes <= 0)

- return;

-

- /* Update the message length. */

- pms->count[1] += nbytes >> 29;

- pms->count[0] += nbits;

- if (pms->count[0] < nbits)

- pms->count[1]++;

-

- /* Process an initial partial block. */

- if (offset) {

- int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);

-

- memcpy(pms->buf + offset, p, copy);

- if (offset + copy < 64)

- return;

- p += copy;

- left -= copy;

- md5_process(pms, pms->buf);

- }

-

- /* Process full blocks. */

- for (; left >= 64; p += 64, left -= 64)

- md5_process(pms, p);

-

- /* Process a final partial block. */

- if (left)

- memcpy(pms->buf, p, left);

-}

-

-void

-md5_finish(md5_state_t *pms, md5_byte_t digest[16])

-{

- static const md5_byte_t pad[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

- };

- md5_byte_t data[8];

- int i;

-

- /* Save the length before padding. */

- for (i = 0; i < 8; ++i)

- data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));

- /* Pad to 56 bytes mod 64. */

- md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);

- /* Append the length. */

- md5_append(pms, data, 8);

- for (i = 0; i < 16; ++i)

- digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));

-}

-

-namespace {

- template<typename SourceType>

- ByteArray getMD5Hash(const SourceType& data) {

- ByteArray digest;

- digest.resize(16);

-

- md5_state_t state;

- md5_init(&state);

- md5_append(&state, reinterpret_cast<const md5_byte_t*>(vecptr(data)), data.size());

- md5_finish(&state, reinterpret_cast<md5_byte_t*>(vecptr(digest)));

-

- return digest;

- }

-}

-

-MD5::MD5() {

- state = new md5_state_t;

- md5_init(state);

-}

-

-MD5::~MD5() {

- delete state;

-}

-

-MD5& MD5::update(const std::vector<unsigned char>& input) {

- md5_append(state, reinterpret_cast<const md5_byte_t*>(vecptr(input)), input.size());

- return *this;

-}

-

-std::vector<unsigned char> MD5::getHash() {

- ByteArray digest;

- digest.resize(16);

- md5_finish(state, reinterpret_cast<md5_byte_t*>(vecptr(digest)));

- return digest;

-}

-

-ByteArray MD5::getHash(const ByteArray& data) {

- return getMD5Hash(data);

-}

-

-ByteArray MD5::getHash(const SafeByteArray& data) {

- return getMD5Hash(data);

-}

-

-bool MD5::isAllowedForCrypto() {

-#ifdef SWIFTEN_PLATFORM_WIN32

- return !WindowsRegistry::isFIPSEnabled();

-#else

- return true;

-#endif

-}

-

-}

-/*

- * Copyright (c) 2010-2012 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#include <Swiften/Base/API.h>

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/Base/SafeByteArray.h>

-

-namespace Swift {

- struct md5_state_s;

-

- class SWIFTEN_API MD5 {

- public:

- MD5();

- ~MD5();

-

- MD5& update(const std::vector<unsigned char>& data);

- std::vector<unsigned char> getHash();

-

- static ByteArray getHash(const ByteArray& data);

- static ByteArray getHash(const SafeByteArray& data);

- static bool isAllowedForCrypto();

-

- private:

- md5_state_s* state;

- };

-}

- * Copyright (c) 2010 Remko Tronçon

- template<typename PRF>

- static ByteArray encode(const SafeByteArray& password, const ByteArray& salt, int iterations) {

- PRF prf;

- ByteArray u = prf(password, concat(salt, createByteArray("\0\0\0\1", 4)));

- u = prf(password, u);

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/StringCodecs/SHA1.h>

-

-#include <Swiften/Base/Platform.h>

-

-#pragma GCC diagnostic ignored "-Wold-style-cast"

-

-using namespace Swift;

-

-/*

-SHA-1 in C

-By Steve Reid <steve@edmweb.com>

-100% Public Domain

-

-Test Vectors (from FIPS PUB 180-1)

-"abc"

- A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D

-"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"

- 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1

-A million repetitions of "a"

- 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F

-*/

-

-/* #define LITTLE_ENDIAN * This should be #define'd if true. */

-/* #define SHA1HANDSOFF * Copies data before messing with it. */

-

-#include <stdio.h>

-#include <string.h>

-

-#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))

-

-/* blk0() and blk() perform the initial expand. */

-/* I got the idea of expanding during the round function from SSLeay */

-#ifdef SWIFTEN_LITTLE_ENDIAN

-#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \

- |(rol(block->l[i],8)&0x00FF00FF))

-#else

-#define blk0(i) block->l[i]

-#endif

-#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \

- ^block->l[(i+2)&15]^block->l[i&15],1))

-

-/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */

-#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);

-#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);

-#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);

-#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);

-#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);

-

-

-/* Hash a single 512-bit block. This is the core of the algorithm. */

-

-void SHA1::Transform(boost::uint32_t state[5], boost::uint8_t buffer[64])

-{

-boost::uint32_t a, b, c, d, e;

-typedef union {

- boost::uint8_t c[64];

- boost::uint32_t l[16];

-} CHAR64LONG16;

-CHAR64LONG16* block;

-#ifdef SHA1HANDSOFF

-static boost::uint8_t workspace[64];

- block = (CHAR64LONG16*)workspace;

- memcpy(block, buffer, 64);

-#else

- block = reinterpret_cast<CHAR64LONG16*>(buffer);

-#endif

- /* Copy context->state[] to working vars */

- a = state[0];

- b = state[1];

- c = state[2];

- d = state[3];

- e = state[4];

- /* 4 rounds of 20 operations each. Loop unrolled. */

- R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);

- R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);

- R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);

- R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);

- R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);

- R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);

- R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);

- R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);

- R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);

- R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);

- R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);

- R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);

- R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);

- R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);

- R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);

- R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);

- R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);

- R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);

- R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);

- R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);

- /* Add the working vars back into context.state[] */

- state[0] += a;

- state[1] += b;

- state[2] += c;

- state[3] += d;

- state[4] += e;

- /* Wipe variables */

- a = b = c = d = e = 0;

-}

-

-

-/* SHA1Init - Initialize new context */

-

-void SHA1::Init(SHA1::CTX* context)

-{

- /* SHA1 initialization constants */

- context->state[0] = 0x67452301;

- context->state[1] = 0xEFCDAB89;

- context->state[2] = 0x98BADCFE;

- context->state[3] = 0x10325476;

- context->state[4] = 0xC3D2E1F0;

- context->count[0] = context->count[1] = 0;

-}

-

-

-/* Run your data through this. */

-

-void SHA1::Update(SHA1::CTX* context, boost::uint8_t* data, unsigned int len)

-{

-unsigned int i, j;

-

- j = (context->count[0] >> 3) & 63;

- if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;

- context->count[1] += (len >> 29);

- if ((j + len) > 63) {

- memcpy(&context->buffer[j], data, (i = 64-j));

- Transform(context->state, context->buffer);

- for ( ; i + 63 < len; i += 64) {

- Transform(context->state, &data[i]);

- }

- j = 0;

- }

- else i = 0;

- memcpy(&context->buffer[j], &data[i], len - i);

-}

-

-

-/* Add padding and return the message digest. */

-

-void SHA1::Final(boost::uint8_t digest[20], SHA1::CTX* context)

-{

-boost::uint32_t i, j;

-boost::uint8_t finalcount[8];

-

- for (i = 0; i < 8; i++) {

- finalcount[i] = (boost::uint8_t) ((context->count[(i >= 4 ? 0 : 1)]

- >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */

- }

- Update(context, (boost::uint8_t *)("\200"), 1);

- while ((context->count[0] & 504) != 448) {

- Update(context, (boost::uint8_t *)("\0"), 1);

- }

- Update(context, finalcount, 8); /* Should cause a SHA1Transform() */

- for (i = 0; i < 20; i++) {

- digest[i] = (boost::uint8_t)

- ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);

- }

- /* Wipe variables */

- i = j = 0;

- memset(context->buffer, 0, 64);

- memset(context->state, 0, 20);

- memset(context->count, 0, 8);

- memset(&finalcount, 0, 8);

-#ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */

- Transform(context->state, context->buffer);

-#endif

-}

-

-// -----------------------------------------------------------------------------

-

-namespace Swift {

-

-SHA1::SHA1() {

- Init(&context);

-}

-

-SHA1& SHA1::update(const std::vector<unsigned char>& input) {

- std::vector<unsigned char> inputCopy(input);

- Update(&context, (boost::uint8_t*) vecptr(inputCopy), inputCopy.size());

- return *this;

-}

-

-std::vector<unsigned char> SHA1::getHash() const {

- std::vector<unsigned char> digest;

- digest.resize(20);

- CTX contextCopy(context);

- Final((boost::uint8_t*) vecptr(digest), &contextCopy);

- return digest;

-}

-

-template<typename Container>

-ByteArray SHA1::getHashInternal(const Container& input) {

- CTX context;

- Init(&context);

-

- Container inputCopy(input);

- Update(&context, (boost::uint8_t*) vecptr(inputCopy), inputCopy.size());

-

- ByteArray digest;

- digest.resize(20);

- Final((boost::uint8_t*) vecptr(digest), &context);

-

- return digest;

-}

-

-ByteArray SHA1::getHash(const ByteArray& input) {

- return getHashInternal(input);

-}

-

-ByteArray SHA1::getHash(const SafeByteArray& input) {

- return getHashInternal(input);

-}

-

-

-}

-/*

- * Copyright (c) 2010-2012 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#ifdef SWIFTEN_PLATFORM_WIN32

-#include "SHA1_Windows.h"

-#else

-

-#include <vector>

-#include <boost/cstdint.hpp>

-

-#include <Swiften/Base/API.h>

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/Base/SafeByteArray.h>

-

-namespace Swift {

- class SWIFTEN_API SHA1 {

- public:

- SHA1();

-

- SHA1& update(const std::vector<unsigned char>& data);

- std::vector<unsigned char> getHash() const;

-

- /**

- * Equivalent of:

- * SHA1().update(data),getHash(), but slightly more efficient and

- * convenient.

- */

- static ByteArray getHash(const ByteArray& data);

- static ByteArray getHash(const SafeByteArray& data);

-

- ByteArray operator()(const SafeByteArray& data) {

- return getHash(data);

- }

-

- ByteArray operator()(const ByteArray& data) {

- return getHash(data);

- }

-

- private:

- typedef struct {

- boost::uint32_t state[5];

- boost::uint32_t count[2];

- boost::uint8_t buffer[64];

- } CTX;

- static void Init(CTX* context);

- static void Transform(boost::uint32_t state[5], boost::uint8_t buffer[64]);

- static void Update(CTX* context, boost::uint8_t* data, unsigned int len);

- static void Final(boost::uint8_t digest[20], CTX* context);

-

- template<typename Container> static ByteArray getHashInternal(const Container& input);

-

- private:

- CTX context;

- };

-}

-

-#endif

-/*

- * Copyright (c) 2011 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/StringCodecs/SHA256.h>

-

-#include <cassert>

-#include <algorithm>

-#include <string.h>

-

-#pragma GCC diagnostic ignored "-Wold-style-cast"

-

-using namespace Swift;

-

-// Copied & adapted from LibTomCrypt, by Tom St Denis, tomstdenis@gmail.com, http://libtom.org

-// Substituted some macros by the platform-independent (slower) variants

-

-#include <stdlib.h>

-

-#define CRYPT_OK 0

-#define CRYPT_INVALID_ARG -1

-#define LTC_ARGCHK assert

-

-#define ROR(x, y) ( ((((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)((y)&31)) | ((unsigned long)(x)<<(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)

-#define RORc(x, y) ( ((((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)((y)&31)) | ((unsigned long)(x)<<(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)

-

-#define LOAD32H(x, y) \

- { x = ((unsigned long)((y)[0] & 255)<<24) | \

- ((unsigned long)((y)[1] & 255)<<16) | \

- ((unsigned long)((y)[2] & 255)<<8) | \

- ((unsigned long)((y)[3] & 255)); }

-

-#define STORE32H(x, y) \

- { (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \

- (y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); }

-

-#define STORE64H(x, y) \

- { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \

- (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \

- (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \

- (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); }

-

-/* a simple macro for making hash "process" functions */

-#define HASH_PROCESS(func_name, compress_name, state_var, block_size) \

-int func_name (State * md, const unsigned char *in, unsigned int inlen) \

-{ \

- unsigned long n; \

- int err; \

- LTC_ARGCHK(md != NULL); \

- LTC_ARGCHK(in != NULL || inlen == 0); \

- if (md-> curlen > sizeof(md->buf)) { \

- return CRYPT_INVALID_ARG; \

- } \

- while (inlen > 0) { \

- if (md->curlen == 0 && inlen >= block_size) { \

- if ((err = compress_name (md, (unsigned char *)in)) != CRYPT_OK) { \

- return err; \

- } \

- md-> length += block_size * 8; \

- in += block_size; \

- inlen -= block_size; \

- } else { \

- n = std::min(inlen, (block_size - md-> curlen)); \

- memcpy(md-> buf + md-> curlen, in, (size_t)n); \

- md-> curlen += n; \

- in += n; \

- inlen -= n; \

- if (md-> curlen == block_size) { \

- if ((err = compress_name (md, md-> buf)) != CRYPT_OK) { \

- return err; \

- } \

- md-> length += 8*block_size; \

- md-> curlen = 0; \

- } \

- } \

- } \

- return CRYPT_OK; \

-}

-

-#ifdef LTC_SMALL_CODE

-/* the K array */

-static const boost::uint32_t K[64] = {

- 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL, 0x3956c25bUL,

- 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL, 0xd807aa98UL, 0x12835b01UL,

- 0x243185beUL, 0x550c7dc3UL, 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL,

- 0xc19bf174UL, 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,

- 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL, 0x983e5152UL,

- 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL, 0xc6e00bf3UL, 0xd5a79147UL,

- 0x06ca6351UL, 0x14292967UL, 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL,

- 0x53380d13UL, 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,

- 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL, 0xd192e819UL,

- 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL, 0x19a4c116UL, 0x1e376c08UL,

- 0x2748774cUL, 0x34b0bcb5UL, 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL,

- 0x682e6ff3UL, 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,

- 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL

-};

-#endif

-

-/* Various logical functions */

-#define Ch(x,y,z) (z ^ (x & (y ^ z)))

-#define Maj(x,y,z) (((x | y) & z) | (x & y))

-#define S(x, n) RORc((x),(n))

-#define R(x, n) (((x)&0xFFFFFFFFUL)>>(n))

-#define Sigma0(x) (S(x, 2) ^ S(x, 13) ^ S(x, 22))

-#define Sigma1(x) (S(x, 6) ^ S(x, 11) ^ S(x, 25))

-#define Gamma0(x) (S(x, 7) ^ S(x, 18) ^ R(x, 3))

-#define Gamma1(x) (S(x, 17) ^ S(x, 19) ^ R(x, 10))

-

-#ifdef LTC_CLEAN_STACK

-int SHA256::_compress(State * md, unsigned char *buf)

-#else

-int SHA256::compress(State * md, unsigned char *buf)

-#endif

-{

- boost::uint32_t S[8], W[64], t0, t1;

-#ifdef LTC_SMALL_CODE

- boost::uint32_t t;

-#endif

- int i;

-

- /* copy state into S */

- for (i = 0; i < 8; i++) {

- S[i] = md->state[i];

- }

-

- /* copy the state into 512-bits into W[0..15] */

- for (i = 0; i < 16; i++) {

- LOAD32H(W[i], buf + (4*i));

- }

-

- /* fill W[16..63] */

- for (i = 16; i < 64; i++) {

- W[i] = Gamma1(W[i - 2]) + W[i - 7] + Gamma0(W[i - 15]) + W[i - 16];

- }

-

- /* Compress */

-#ifdef LTC_SMALL_CODE

-#define RND(a,b,c,d,e,f,g,h,i) \

- t0 = h + Sigma1(e) + Ch(e, f, g) + K[i] + W[i]; \

- t1 = Sigma0(a) + Maj(a, b, c); \

- d += t0; \

- h = t0 + t1;

-

- for (i = 0; i < 64; ++i) {

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],i);

- t = S[7]; S[7] = S[6]; S[6] = S[5]; S[5] = S[4];

- S[4] = S[3]; S[3] = S[2]; S[2] = S[1]; S[1] = S[0]; S[0] = t;

- }

-#else

-#define RND(a,b,c,d,e,f,g,h,i,ki) \

- t0 = h + Sigma1(e) + Ch(e, f, g) + ki + W[i]; \

- t1 = Sigma0(a) + Maj(a, b, c); \

- d += t0; \

- h = t0 + t1;

-

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],0,0x428a2f98);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],1,0x71374491);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],2,0xb5c0fbcf);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],3,0xe9b5dba5);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],4,0x3956c25b);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],5,0x59f111f1);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],6,0x923f82a4);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],7,0xab1c5ed5);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],8,0xd807aa98);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],9,0x12835b01);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],10,0x243185be);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],11,0x550c7dc3);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],12,0x72be5d74);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],13,0x80deb1fe);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],14,0x9bdc06a7);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],15,0xc19bf174);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],16,0xe49b69c1);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],17,0xefbe4786);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],18,0x0fc19dc6);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],19,0x240ca1cc);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],20,0x2de92c6f);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],21,0x4a7484aa);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],22,0x5cb0a9dc);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],23,0x76f988da);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],24,0x983e5152);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],25,0xa831c66d);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],26,0xb00327c8);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],27,0xbf597fc7);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],28,0xc6e00bf3);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],29,0xd5a79147);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],30,0x06ca6351);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],31,0x14292967);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],32,0x27b70a85);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],33,0x2e1b2138);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],34,0x4d2c6dfc);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],35,0x53380d13);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],36,0x650a7354);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],37,0x766a0abb);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],38,0x81c2c92e);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],39,0x92722c85);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],40,0xa2bfe8a1);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],41,0xa81a664b);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],42,0xc24b8b70);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],43,0xc76c51a3);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],44,0xd192e819);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],45,0xd6990624);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],46,0xf40e3585);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],47,0x106aa070);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],48,0x19a4c116);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],49,0x1e376c08);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],50,0x2748774c);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],51,0x34b0bcb5);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],52,0x391c0cb3);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],53,0x4ed8aa4a);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],54,0x5b9cca4f);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],55,0x682e6ff3);

- RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],56,0x748f82ee);

- RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],57,0x78a5636f);

- RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],58,0x84c87814);

- RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],59,0x8cc70208);

- RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],60,0x90befffa);

- RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],61,0xa4506ceb);

- RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],62,0xbef9a3f7);

- RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],63,0xc67178f2);

-

-#undef RND

-

-#endif

-

- /* feedback */

- for (i = 0; i < 8; i++) {

- md->state[i] = md->state[i] + S[i];

- }

- return CRYPT_OK;

-}

-

-#ifdef LTC_CLEAN_STACK

-int SHA256::compress(State * md, unsigned char *buf)

-{

- int err;

- err = SHA256::_compress(md, buf);

- burn_stack(sizeof(boost::uint32_t) * 74);

- return err;

-}

-#endif

-

-/**

- Initialize the hash state

- @param md The hash state you wish to initialize

- @return CRYPT_OK if successful

-*/

-int SHA256::init(State * md)

-{

- LTC_ARGCHK(md != NULL);

-

- md->curlen = 0;

- md->length = 0;

- md->state[0] = 0x6A09E667UL;

- md->state[1] = 0xBB67AE85UL;

- md->state[2] = 0x3C6EF372UL;

- md->state[3] = 0xA54FF53AUL;

- md->state[4] = 0x510E527FUL;

- md->state[5] = 0x9B05688CUL;

- md->state[6] = 0x1F83D9ABUL;

- md->state[7] = 0x5BE0CD19UL;

- return CRYPT_OK;

-}

-

-/**

- Process a block of memory though the hash

- @param md The hash state

- @param in The data to hash

- @param inlen The length of the data (octets)

- @return CRYPT_OK if successful

-*/

-HASH_PROCESS(SHA256::process, SHA256::compress, sha256, 64)

-

-/**

- Terminate the hash to get the digest

- @param md The hash state

- @param out [out] The destination of the hash (32 bytes)

- @return CRYPT_OK if successful

-*/

-int SHA256::done(State * md, unsigned char *out)

-{

- int i;

-

- LTC_ARGCHK(md != NULL);

- LTC_ARGCHK(out != NULL);

-

- if (md->curlen >= sizeof(md->buf)) {

- return CRYPT_INVALID_ARG;

- }

-

-

- /* increase the length of the message */

- md->length += md->curlen * 8;

-

- /* append the '1' bit */

- md->buf[md->curlen++] = (unsigned char)0x80;

-

- /* if the length is currently above 56 bytes we append zeros

- * then compress. Then we can fall back to padding zeros and length

- * encoding like normal.

- */

- if (md->curlen > 56) {

- while (md->curlen < 64) {

- md->buf[md->curlen++] = (unsigned char)0;

- }

- SHA256::compress(md, md->buf);

- md->curlen = 0;

- }

-

- /* pad upto 56 bytes of zeroes */

- while (md->curlen < 56) {

- md->buf[md->curlen++] = (unsigned char)0;

- }

-

- /* store length */

- STORE64H(md->length, md->buf+56);

- SHA256::compress(md, md->buf);

-

- /* copy output */

- for (i = 0; i < 8; i++) {

- STORE32H(md->state[i], out+(4*i));

- }

-#ifdef LTC_CLEAN_STACK

- zeromem(md, sizeof(State));

-#endif

- return CRYPT_OK;

-}

-

-// End copied code

-

-namespace Swift {

-

-SHA256::SHA256() {

- init(&state);

-}

-

-SHA256& SHA256::update(const std::vector<unsigned char>& input) {

- std::vector<unsigned char> inputCopy(input);

- process(&state, (boost::uint8_t*) vecptr(inputCopy), inputCopy.size());

- return *this;

-}

-

-std::vector<unsigned char> SHA256::getHash() const {

- std::vector<unsigned char> digest;

- digest.resize(256/8);

- State contextCopy(state);

- done(&contextCopy, (boost::uint8_t*) vecptr(digest));

- return digest;

-}

-

-template<typename Container>

-ByteArray SHA256::getHashInternal(const Container& input) {

- State context;

- init(&context);

-

- Container inputCopy(input);

- process(&context, (boost::uint8_t*) vecptr(inputCopy), inputCopy.size());

-

- ByteArray digest;

- digest.resize(256/8);

- done(&context, (boost::uint8_t*) vecptr(digest));

-

- return digest;

-}

-

-ByteArray SHA256::getHash(const ByteArray& input) {

- return getHashInternal(input);

-}

-

-ByteArray SHA256::getHash(const SafeByteArray& input) {

- return getHashInternal(input);

-}

-

-}

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#pragma once

-

-#include <vector>

-#include <boost/cstdint.hpp>

-

-#include <Swiften/Base/API.h>

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/Base/SafeByteArray.h>

-

-namespace Swift {

- class SWIFTEN_API SHA256 {

- public:

- SHA256();

-

- SHA256& update(const std::vector<unsigned char>& data);

- std::vector<unsigned char> getHash() const;

-

- /**

- * Equivalent of:

- * SHA256().update(data),getHash(), but slightly more efficient and

- * convenient.

- */

- static ByteArray getHash(const ByteArray& data);

- static ByteArray getHash(const SafeByteArray& data);

-

- ByteArray operator()(const SafeByteArray& data) {

- return getHash(data);

- }

-

- ByteArray operator()(const ByteArray& data) {

- return getHash(data);

- }

-

- private:

- struct State {

- boost::uint64_t length;

- boost::uint32_t state[8], curlen;

- unsigned char buf[64];

- };

-

- static int init(State *md);

- static int process(State * md, const unsigned char *in, unsigned int inlen);

- static int compress(State *md, unsigned char *buf);

- static int done(State * md, unsigned char *out);

-

- template<typename Container> static ByteArray getHashInternal(const Container& input);

-

- private:

- State state;

- };

-}

- CPPUNIT_TEST(testEncode);

- CPPUNIT_TEST(testEncode_NonAscii);

- CPPUNIT_TEST(testDecode);

- void testEncode() {

- std::string result(Base64::encode(createByteArray("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890")));

- CPPUNIT_ASSERT_EQUAL(std::string("QUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVphYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ejEyMzQ1Njc4OTA="), result);

- void testEncode_NonAscii() {

- std::string result(Base64::encode(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed")));

- CPPUNIT_ASSERT_EQUAL(std::string("QgayPKawpkPSDYmwT/WM94uAlu0="), result);

- void testDecode() {

- ByteArray result(Base64::decode("QUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVphYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ejEyMzQ1Njc4OTA="));

- CPPUNIT_ASSERT_EQUAL(createByteArray("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890"), result);

- }

-

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/Base/ByteArray.h>

-#include <QA/Checker/IO.h>

-

-#include <cppunit/extensions/HelperMacros.h>

-#include <cppunit/extensions/TestFactoryRegistry.h>

-

-#include <Swiften/Base/ByteArray.h>

-#include <Swiften/StringCodecs/HMAC_SHA1.h>

-#include <Swiften/StringCodecs/HMAC_SHA256.h>

-

-using namespace Swift;

-

-class HMACTest : public CppUnit::TestFixture {

- CPPUNIT_TEST_SUITE(HMACTest);

- CPPUNIT_TEST(testGetResult);

- CPPUNIT_TEST(testGetResult_KeyLongerThanBlockSize);

- CPPUNIT_TEST(testGetResult_RFC4231_1);

- CPPUNIT_TEST(testGetResult_RFC4231_7);

- CPPUNIT_TEST_SUITE_END();

-

- public:

- void testGetResult() {

- ByteArray result(HMAC_SHA1()(createSafeByteArray("foo"), createByteArray("foobar")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xa4\xee\xba\x8e\x63\x3d\x77\x88\x69\xf5\x68\xd0\x5a\x1b\x3d\xc7\x2b\xfd\x4\xdd"), result);

- }

-

- void testGetResult_KeyLongerThanBlockSize() {

- ByteArray result(HMAC_SHA1()(createSafeByteArray("---------|---------|---------|---------|---------|----------|---------|"), createByteArray("foobar")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xd6""n""\x8f""P|1""\xd3"",""\x6"" ""\xb9\xe3""gg""\x8e\xcf"" ]+""\xa"), result);

- }

-

- void testGetResult_RFC4231_1() {

- ByteArray result(HMAC_SHA256()(createSafeByteArray("\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b", 20), createByteArray("Hi There")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xb0\x34\x4c\x61\xd8\xdb\x38\x53\x5c\xa8\xaf\xce\xaf\x0b\xf1\x2b\x88\x1d\xc2\x00\xc9\x83\x3d\xa7\x26\xe9\x37\x6c\x2e\x32\xcf\xf7", 32), result);

- }

-

- void testGetResult_RFC4231_7() {

- ByteArray result(HMAC_SHA256()(createSafeByteArray("\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa", 131), createByteArray("This is a test using a larger than block-size key and a larger than block-size data. The key needs to be hashed before being used by the HMAC algorithm.")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x9b\x09\xff\xa7\x1b\x94\x2f\xcb\x27\x63\x5f\xbc\xd5\xb0\xe9\x44\xbf\xdc\x63\x64\x4f\x07\x13\x93\x8a\x7f\x51\x53\x5c\x3a\x35\xe2", 32), result);

- }

-};

-

-CPPUNIT_TEST_SUITE_REGISTRATION(HMACTest);

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/Base/ByteArray.h>

-#include <QA/Checker/IO.h>

-

-#include <cppunit/extensions/HelperMacros.h>

-#include <cppunit/extensions/TestFactoryRegistry.h>

-

-#include <Swiften/StringCodecs/MD5.h>

-#include <Swiften/Base/ByteArray.h>

-

-using namespace Swift;

-

-class MD5Test : public CppUnit::TestFixture {

- CPPUNIT_TEST_SUITE(MD5Test);

- CPPUNIT_TEST(testGetHash_Empty);

- CPPUNIT_TEST(testGetHash_Alphabet);

- CPPUNIT_TEST(testIncrementalTest);

- CPPUNIT_TEST_SUITE_END();

-

- public:

- void testGetHash_Empty() {

- ByteArray result(MD5::getHash(createByteArray("")));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xd4\x1d\x8c\xd9\x8f\x00\xb2\x04\xe9\x80\x09\x98\xec\xf8\x42\x7e", 16), result);

- }

-

- void testGetHash_Alphabet() {

- ByteArray result(MD5::getHash(createByteArray("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789")));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xd1\x74\xab\x98\xd2\x77\xd9\xf5\xa5\x61\x1c\x2c\x9f\x41\x9d\x9f", 16), result);

- }

-

- void testIncrementalTest() {

- MD5 testling;

- testling.update(createByteArray("ABCDEFGHIJKLMNOPQRSTUVWXYZ"));

- testling.update(createByteArray("abcdefghijklmnopqrstuvwxyz0123456789"));

-

- ByteArray result = testling.getHash();

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xd1\x74\xab\x98\xd2\x77\xd9\xf5\xa5\x61\x1c\x2c\x9f\x41\x9d\x9f", 16), result);

- }

-};

-

-CPPUNIT_TEST_SUITE_REGISTRATION(MD5Test);

- * Copyright (c) 2010 Remko Tronçon

-#include <Swiften/StringCodecs/HMAC_SHA1.h>

- ByteArray result(PBKDF2::encode<HMAC_SHA1 >(createSafeByteArray("password"), createByteArray("salt"), 1));

- ByteArray result(PBKDF2::encode<HMAC_SHA1 >(createSafeByteArray("password"), createByteArray("salt"), 2));

- ByteArray result(PBKDF2::encode<HMAC_SHA1 >(createSafeByteArray("password"), createByteArray("salt"), 4096));

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/Base/ByteArray.h>

-#include <QA/Checker/IO.h>

-

-#include <cppunit/extensions/HelperMacros.h>

-#include <cppunit/extensions/TestFactoryRegistry.h>

-

-#include <Swiften/StringCodecs/SHA1.h>

-

-using namespace Swift;

-

-class SHA1Test : public CppUnit::TestFixture {

- CPPUNIT_TEST_SUITE(SHA1Test);

- CPPUNIT_TEST(testGetHash);

- CPPUNIT_TEST(testGetHash_TwoUpdates);

- //CPPUNIT_TEST(testGetHash_TwoGetHash);

- CPPUNIT_TEST(testGetHash_NoData);

- //CPPUNIT_TEST(testGetHash_InterleavedUpdate);

- CPPUNIT_TEST(testGetHashStatic);

- CPPUNIT_TEST(testGetHashStatic_Twice);

- CPPUNIT_TEST(testGetHashStatic_NoData);

- CPPUNIT_TEST_SUITE_END();

-

- public:

- void testGetHash() {

- SHA1 sha;

- sha.update(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<"));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), sha.getHash());

- }

-

- void testGetHash_TwoUpdates() {

- SHA1 sha;

- sha.update(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<"));

- sha.update(createByteArray("http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<"));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), sha.getHash());

- }

-

- void testGetHash_TwoGetHash() {

- SHA1 sha;

- sha.update(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<"));

-

- sha.getHash();

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), sha.getHash());

- }

-

- void testGetHash_InterleavedUpdate() {

- SHA1 sha;

-

- sha.update(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<"));

- sha.getHash();

- sha.update(createByteArray("http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<"));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), sha.getHash());

- }

-

-

- void testGetHash_NoData() {

- SHA1 sha;

- sha.update(std::vector<unsigned char>());

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xda\x39\xa3\xee\x5e\x6b\x4b\x0d\x32\x55\xbf\xef\x95\x60\x18\x90\xaf\xd8\x07\x09"), sha.getHash());

- }

-

- void testGetHashStatic() {

- ByteArray result(SHA1::getHash(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), result);

- }

-

-

- void testGetHashStatic_Twice() {

- ByteArray input(createByteArray("client/pc//Exodus 0.9.1<http://jabber.org/protocol/caps<http://jabber.org/protocol/disco#info<http://jabber.org/protocol/disco#items<http://jabber.org/protocol/muc<"));

- SHA1::getHash(input);

- ByteArray result(SHA1::getHash(input));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), result);

- }

-

- void testGetHashStatic_NoData() {

- ByteArray result(SHA1::getHash(ByteArray()));

-

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xda\x39\xa3\xee\x5e\x6b\x4b\x0d\x32\x55\xbf\xef\x95\x60\x18\x90\xaf\xd8\x07\x09"), result);

- }

-};

-

-CPPUNIT_TEST_SUITE_REGISTRATION(SHA1Test);

-/*

- * Copyright (c) 2010 Remko Tronçon

- * Licensed under the GNU General Public License v3.

- * See Documentation/Licenses/GPLv3.txt for more information.

- */

-

-#include <Swiften/Base/ByteArray.h>

-#include <QA/Checker/IO.h>

-

-#include <cppunit/extensions/HelperMacros.h>

-#include <cppunit/extensions/TestFactoryRegistry.h>

-

-#include <Swiften/StringCodecs/SHA256.h>

-

-using namespace Swift;

-

-class SHA256Test : public CppUnit::TestFixture {

- CPPUNIT_TEST_SUITE(SHA256Test);

- CPPUNIT_TEST(testGetHashStatic_Empty);

- CPPUNIT_TEST(testGetHashStatic_Small);

- CPPUNIT_TEST(testGetHashStatic_Large);

- CPPUNIT_TEST_SUITE_END();

-

- public:

- void testGetHashStatic_Empty() {

- ByteArray result(SHA256::getHash(createByteArray("")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xe3\xb0\xc4" "B" "\x98\xfc\x1c\x14\x9a\xfb\xf4\xc8\x99" "o" "\xb9" "$'" "\xae" "A" "\xe4" "d" "\x9b\x93" "L" "\xa4\x95\x99\x1b" "xR" "\xb8" "U", 32), result);

- }

-

- void testGetHashStatic_Small() {

- ByteArray result(SHA256::getHash(createByteArray("abc")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\xba\x78\x16\xbf\x8f\x01\xcf\xea\x41\x41\x40\xde\x5d\xae\x22\x23\xb0\x03\x61\xa3\x96\x17\x7a\x9c\xb4\x10\xff\x61\xf2\x00\x15\xad", 32), result);

- }

-

- void testGetHashStatic_Large() {

- ByteArray result(SHA256::getHash(createByteArray("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq")));

- CPPUNIT_ASSERT_EQUAL(createByteArray("\x24\x8d\x6a\x61\xd2\x06\x38\xb8\xe5\xc0\x26\x93\x0c\x3e\x60\x39\xa3\x3c\xe4\x59\x64\xff\x21\x67\xf6\xec\xed\xd4\x19\xdb\x06\xc1", 32), result);

- }

-};

-

-CPPUNIT_TEST_SUITE_REGISTRATION(SHA256Test);