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

+

+#include "Swiften/StringCodecs/Base64.h"

+

+namespace Swift {

+

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

+

+String Base64::encode(const ByteArray &s) {

+ int i;

+ int len = s.getSize();

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

+ int a, b, c;

+

+ std::string 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;

+}

+

+ByteArray Base64::decode(const String& input) {

+ String inputWithoutNewlines(input);

+ inputWithoutNewlines.removeAll('\n');

+

+ const std::string& s = inputWithoutNewlines.getUTF8String();

+ 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;

+}

+

+}

+#pragma once

+

+#include <vector>

+

+#include "Swiften/Base/String.h"

+#include "Swiften/Base/ByteArray.h"

+

+namespace Swift {

+ class Base64 {

+ public:

+ static String encode(const ByteArray& s);

+ static ByteArray decode(const String &s);

+ };

+}

+#include "Swiften/StringCodecs/HMACSHA1.h"

+

+#include <cassert>

+

+#include "Swiften/StringCodecs/SHA1.h"

+#include "Swiften/Base/ByteArray.h"

+

+namespace Swift {

+

+static const unsigned int B = 64;

+

+ByteArray HMACSHA1::getResult(const ByteArray& key, const ByteArray& data) {

+ assert(key.getSize() <= B);

+

+ // Create the padded key

+ ByteArray paddedKey(key);

+ paddedKey.resize(B);

+ for (unsigned int i = key.getSize(); i < paddedKey.getSize(); ++i) {

+ paddedKey[i] = 0x0;

+ }

+

+ // Create the first value

+ ByteArray x(paddedKey);

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

+ x[i] ^= 0x36;

+ }

+ x += data;

+

+ // Create the second value

+ ByteArray y(paddedKey);

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

+ y[i] ^= 0x5c;

+ }

+ y += SHA1::getHash(x);

+

+ return SHA1::getHash(y);

+}

+

+}

+#pragma once

+

+namespace Swift {

+ class ByteArray;

+

+ class HMACSHA1 {

+ public:

+ static ByteArray getResult(const ByteArray& key, const ByteArray& data);

+ };

+}

+#include "Swiften/StringCodecs/Hexify.h"

+

+#include <sstream>

+#include <iomanip>

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

+

+#include "Swiften/Base/String.h"

+#include "Swiften/Base/ByteArray.h"

+

+namespace Swift {

+

+String Hexify::hexify(const ByteArray& data) {

+ std::ostringstream result;

+ result << std::hex;

+

+ for (unsigned int i = 0; i < data.getSize(); ++i) {

+ result << std::setw(2) << std::setfill('0') << boost::numeric_cast<unsigned int>(static_cast<unsigned char>(data[i]));

+ }

+ return String(result.str());

+}

+

+}

+#pragma once

+

+namespace Swift {

+ class String;

+ class ByteArray;

+

+ class Hexify {

+ public:

+ static String hexify(const ByteArray& data);

+ };

+}

+/*

+ * 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

+ */

+

+#include "Swiften/StringCodecs/MD5.h"

+

+#include <cassert>

+

+#include "Swiften/Base/ByteArray.h"

+#include "Swiften/Base/Platform.h"

+

+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_BIG_ENDIAN

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

+ md5_word_t X[16];

+#else

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

+ md5_word_t xbuf[16];

+ const md5_word_t *X;

+#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));

+}

+

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

+ ByteArray digest;

+ digest.resize(16);

+

+ md5_state_t state;

+ md5_init(&state);

+ md5_append(&state, reinterpret_cast<const md5_byte_t*>(data.getData()), data.getSize());

+ md5_finish(&state, reinterpret_cast<md5_byte_t*>(digest.getData()));

+

+ return digest;

+}

+

+}

+#pragma once

+

+namespace Swift {

+ class ByteArray;

+

+ class MD5 {

+ public:

+ static ByteArray getHash(const ByteArray& data);

+ };

+}

+#include "Swiften/StringCodecs/PBKDF2.h"

+#include "Swiften/StringCodecs/HMACSHA1.h"

+

+namespace Swift {

+

+ByteArray PBKDF2::encode(const ByteArray& password, const ByteArray& salt, int iterations) {

+ ByteArray u = HMACSHA1::getResult(password, salt + ByteArray("\0\0\0\1", 4));

+ ByteArray result = u;

+ int i = 1;

+ while (i < iterations) {

+ u = HMACSHA1::getResult(password, u);

+ for (unsigned int j = 0; j < u.getSize(); ++j) {

+ result[j] ^= u[j];

+ }

+ ++i;

+ }

+ return result;

+}

+

+}

+#pragma once

+

+#include "Swiften/Base/ByteArray.h"

+

+namespace Swift {

+ class PBKDF2 {

+ public:

+ static ByteArray encode(const ByteArray& password, const ByteArray& salt, int iterations);

+ };

+}

+#include "Swiften/Base/Platform.h"

+

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

+

+/*

+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 <boost/cstdint.hpp>

+#include <stdio.h>

+#include <string.h>

+

+typedef struct {

+ boost::uint32_t state[5];

+ boost::uint32_t count[2];

+ boost::uint8_t buffer[64];

+} SHA1_CTX;

+

+void SHA1Transform(boost::uint32_t state[5], boost::uint8_t buffer[64]);

+void SHA1Init(SHA1_CTX* context);

+void SHA1Update(SHA1_CTX* context, boost::uint8_t* data, unsigned int len);

+void SHA1Final(boost::uint8_t digest[20], SHA1_CTX* context);

+

+#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 SHA1Transform(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 SHA1Init(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 SHA1Update(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));

+ SHA1Transform(context->state, context->buffer);

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

+ SHA1Transform(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 SHA1Final(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 */

+ }

+ SHA1Update(context, (boost::uint8_t *)("\200"), 1);

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

+ SHA1Update(context, (boost::uint8_t *)("\0"), 1);

+ }

+ SHA1Update(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 */

+ SHA1Transform(context->state, context->buffer);

+#endif

+}

+

+// -----------------------------------------------------------------------------

+

+#include "Swiften/StringCodecs/SHA1.h"

+

+namespace Swift {

+

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

+ ByteArray inputCopy(input);

+ ByteArray digest;

+ digest.resize(20);

+ SHA1_CTX context;

+ SHA1Init(&context);

+ SHA1Update(&context, (boost::uint8_t*) inputCopy.getData(), inputCopy.getSize());

+ SHA1Final((boost::uint8_t*) digest.getData(), &context);

+ return digest;

+}

+

+}

+#pragma once

+

+#include "Swiften/Base/ByteArray.h"

+

+namespace Swift {

+ class SHA1 {

+ public:

+ static ByteArray getHash(const ByteArray& data);

+ };

+}

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

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

+

+#include "Swiften/StringCodecs/Base64.h"

+

+using namespace Swift;

+

+class Base64Test : public CppUnit::TestFixture {

+ CPPUNIT_TEST_SUITE(Base64Test);

+ CPPUNIT_TEST(testEncode);

+ CPPUNIT_TEST(testEncode_NonAscii);

+ CPPUNIT_TEST(testEncode_NoData);

+ CPPUNIT_TEST(testDecode);

+ CPPUNIT_TEST(testDecode_NoData);

+ CPPUNIT_TEST_SUITE_END();

+

+ public:

+ void testEncode() {

+ String result(Base64::encode("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890"));

+ CPPUNIT_ASSERT_EQUAL(String("QUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVphYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ejEyMzQ1Njc4OTA="), result);

+ }

+

+ void testEncode_NonAscii() {

+ String result(Base64::encode(ByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed")));

+ CPPUNIT_ASSERT_EQUAL(String("QgayPKawpkPSDYmwT/WM94uAlu0="), result);

+ }

+

+ void testEncode_NoData() {

+ String result(Base64::encode(ByteArray()));

+ CPPUNIT_ASSERT_EQUAL(String(""), result);

+ }

+

+ void testDecode() {

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

+ CPPUNIT_ASSERT_EQUAL(ByteArray("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890"), result);

+ }

+

+ void testDecode_NoData() {

+ ByteArray result(Base64::decode(""));

+ CPPUNIT_ASSERT_EQUAL(ByteArray(), result);

+ }

+};

+

+CPPUNIT_TEST_SUITE_REGISTRATION(Base64Test);

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

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

+

+#include "Swiften/Base/ByteArray.h"

+#include "Swiften/StringCodecs/HMACSHA1.h"

+

+using namespace Swift;

+

+class HMACSHA1Test : public CppUnit::TestFixture {

+ CPPUNIT_TEST_SUITE(HMACSHA1Test);

+ CPPUNIT_TEST(testGetResult);

+ CPPUNIT_TEST_SUITE_END();

+

+ public:

+ void testGetResult() {

+ ByteArray result(HMACSHA1::getResult("foo", "foobar"));

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

+ }

+};

+

+CPPUNIT_TEST_SUITE_REGISTRATION(HMACSHA1Test);

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

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

+

+#include "Swiften/StringCodecs/Hexify.h"

+#include "Swiften/Base/String.h"

+#include "Swiften/Base/ByteArray.h"

+

+using namespace Swift;

+

+class HexifyTest : public CppUnit::TestFixture {

+ CPPUNIT_TEST_SUITE(HexifyTest);

+ CPPUNIT_TEST(testHexify);

+ CPPUNIT_TEST_SUITE_END();

+

+ public:

+ void testHexify() {

+ CPPUNIT_ASSERT_EQUAL(String("4206b23ca6b0a643d20d89b04ff58cf78b8096ed"), Hexify::hexify(ByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed")));

+ }

+};

+

+CPPUNIT_TEST_SUITE_REGISTRATION(HexifyTest);

+#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_SUITE_END();

+

+ public:

+ void testGetHash_Empty() {

+ ByteArray result(MD5::getHash(""));

+

+ CPPUNIT_ASSERT_EQUAL(ByteArray("\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("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"));

+

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

+ }

+};

+

+CPPUNIT_TEST_SUITE_REGISTRATION(MD5Test);

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

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

+

+#include "Swiften/Base/ByteArray.h"

+#include "Swiften/StringCodecs/PBKDF2.h"

+

+using namespace Swift;

+

+class PBKDF2Test : public CppUnit::TestFixture {

+ CPPUNIT_TEST_SUITE(PBKDF2Test);

+ CPPUNIT_TEST(testGetResult_I1);

+ CPPUNIT_TEST(testGetResult_I2);

+ CPPUNIT_TEST(testGetResult_I4096);

+ CPPUNIT_TEST_SUITE_END();

+

+ public:

+ void testGetResult_I1() {

+ ByteArray result(PBKDF2::encode("password", "salt", 1));

+

+ CPPUNIT_ASSERT_EQUAL(ByteArray("\x0c\x60\xc8\x0f\x96\x1f\x0e\x71\xf3\xa9\xb5\x24\xaf\x60\x12\x06\x2f\xe0\x37\xa6"), result);

+ }

+

+ void testGetResult_I2() {

+ ByteArray result(PBKDF2::encode("password", "salt", 2));

+

+ CPPUNIT_ASSERT_EQUAL(ByteArray("\xea\x6c\x1\x4d\xc7\x2d\x6f\x8c\xcd\x1e\xd9\x2a\xce\x1d\x41\xf0\xd8\xde\x89\x57"), result);

+ }

+

+ void testGetResult_I4096() {

+ ByteArray result(PBKDF2::encode("password", "salt", 4096));

+

+ CPPUNIT_ASSERT_EQUAL(ByteArray("\x4b\x00\x79\x1\xb7\x65\x48\x9a\xbe\xad\x49\xd9\x26\xf7\x21\xd0\x65\xa4\x29\xc1", 20), result);

+ }

+};

+

+CPPUNIT_TEST_SUITE_REGISTRATION(PBKDF2Test);

+#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_Twice);

+ CPPUNIT_TEST(testGetHash_NoData);

+ CPPUNIT_TEST_SUITE_END();

+

+ public:

+ void testGetHash() {

+ ByteArray result(SHA1::getHash("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(ByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), result);

+ }

+

+

+ void testGetHash_Twice() {

+ ByteArray input("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(ByteArray("\x42\x06\xb2\x3c\xa6\xb0\xa6\x43\xd2\x0d\x89\xb0\x4f\xf5\x8c\xf7\x8b\x80\x96\xed"), result);

+ }

+

+ void testGetHash_NoData() {

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

+

+ CPPUNIT_ASSERT_EQUAL(ByteArray("\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);