101 lines
2.4 KiB
C++
101 lines
2.4 KiB
C++
/*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* Copyright 2015-2018 Danny Robson <danny@nerdcruft.net>
|
|
*/
|
|
|
|
#include "xxtea.hpp"
|
|
|
|
#include <cstring>
|
|
|
|
// test vectors: http://www.cix.co.uk/~klockstone/teavect.htm
|
|
|
|
using cruft::crypto::block::XXTEA;
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
static const u32 MAGIC = 0x9E3779B9;
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
static constexpr
|
|
u32
|
|
mix (u32 Z,
|
|
u32 Y,
|
|
u32 S,
|
|
std::size_t E,
|
|
std::size_t P,
|
|
const u32 *restrict K)
|
|
{
|
|
return ((Z >> 5 ^ Y << 2) + (Y >> 3 ^ Z << 4)) ^ ((S ^ Y) + (K[(P & 3) ^ E] ^ Z));
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
XXTEA::XXTEA (key_t _key):
|
|
m_key (_key)
|
|
{ ; }
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
void
|
|
XXTEA::encrypt (cruft::view<word_t*> data)
|
|
{
|
|
if (data.size () < 2)
|
|
throw std::invalid_argument ("minimum blocksize is 64 bits");
|
|
|
|
auto const count = data.size ();
|
|
uint32_t sum = 0;
|
|
uint32_t z = data[count - 1];
|
|
uint32_t y, p;
|
|
|
|
unsigned rounds = 6 + 52 / count;
|
|
|
|
do {
|
|
sum += MAGIC;
|
|
uint32_t e = (sum >> 2) & 3;
|
|
|
|
for (p = 0; p < count - 1; p++) {
|
|
y = data[p + 1];
|
|
z = data[p] += ::mix (z, y, sum, e, p, m_key.data ());
|
|
}
|
|
|
|
y = data[0];
|
|
z = data[count - 1] += ::mix (z, y, sum, e, p, m_key.data ());
|
|
} while (--rounds);
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
void
|
|
XXTEA::decrypt (cruft::view<word_t*> data)
|
|
{
|
|
if (data.size () < 2)
|
|
throw std::invalid_argument ("minimum blocksize is 64 bits");
|
|
|
|
auto const count = data.size ();
|
|
uint32_t y, z, sum;
|
|
uint32_t rounds;
|
|
size_t p;
|
|
|
|
rounds = 6 + 52 / count;
|
|
sum = rounds * MAGIC;
|
|
y = data[0];
|
|
|
|
do {
|
|
uint32_t e = (sum >> 2) & 3;
|
|
|
|
for (p = count - 1; p > 0; p--) {
|
|
z = data[p - 1];
|
|
y = data[p ] -= ::mix (z, y, sum, e, p, m_key.data ());
|
|
}
|
|
|
|
z = data[count - 1];
|
|
y = data[ 0] -= ::mix (z, y, sum, e, p, m_key.data ());
|
|
|
|
sum -= MAGIC;
|
|
} while (--rounds);
|
|
}
|