2022-05-16 00:21:01 +02:00
|
|
|
#include <unordered_map>
|
2022-05-16 22:35:28 +02:00
|
|
|
#include "GCrypt/Feistel.h"
|
|
|
|
#include "GCrypt/Util.h"
|
|
|
|
#include "GCrypt/Config.h"
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
namespace Leonetienne::GCrypt {
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-22 13:43:23 +02:00
|
|
|
Feistel::Feistel(const Key& key) {
|
2022-05-22 17:32:54 +02:00
|
|
|
SetKey(key);
|
|
|
|
return;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
Feistel::~Feistel() {
|
2022-05-22 17:32:54 +02:00
|
|
|
ZeroKeyMemory();
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
return;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-22 13:43:23 +02:00
|
|
|
void Feistel::SetKey(const Key& key) {
|
2022-05-22 17:32:54 +02:00
|
|
|
GenerateRoundKeys(key);
|
|
|
|
return;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
Block Feistel::Encipher(const Block& data) {
|
2022-05-22 17:32:54 +02:00
|
|
|
return Run(data, false);
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
Block Feistel::Decipher(const Block& data) {
|
2022-05-22 17:32:54 +02:00
|
|
|
return Run(data, true);
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Block Feistel::Run(const Block& data, bool reverseKeys) {
|
2022-05-22 17:32:54 +02:00
|
|
|
const auto splitData = FeistelSplit(data);
|
|
|
|
Halfblock l = splitData.first;
|
|
|
|
Halfblock r = splitData.second;
|
|
|
|
|
|
|
|
Halfblock tmp;
|
|
|
|
|
|
|
|
for (std::size_t i = 0; i < N_ROUNDS; i++) {
|
|
|
|
// Calculate key index
|
|
|
|
std::size_t keyIndex;
|
|
|
|
if (reverseKeys) {
|
|
|
|
keyIndex = N_ROUNDS - i - 1;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-22 17:32:54 +02:00
|
|
|
else {
|
|
|
|
keyIndex = i;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do a feistel round
|
|
|
|
tmp = r;
|
|
|
|
r = l ^ F(r, roundKeys[keyIndex]);
|
|
|
|
l = tmp;
|
|
|
|
}
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
// Block has finished de*ciphering.
|
|
|
|
// Let's generate a new set of round keys.
|
2022-05-22 20:13:41 +02:00
|
|
|
GenerateRoundKeys((Key)roundKeys.back());
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
return FeistelCombine(r, l);
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
2022-05-22 13:43:23 +02:00
|
|
|
Halfblock Feistel::F(Halfblock m, const Key& key) {
|
2022-05-22 20:13:41 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
// Made-up F function
|
|
|
|
// Expand to full bitwidth
|
|
|
|
Block m_expanded = ExpansionFunction(m);
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-25 13:05:25 +02:00
|
|
|
// Mix up the block a bit
|
|
|
|
m_expanded.ShiftCellsRightInplace();
|
|
|
|
m_expanded.ShiftRowsUpInplace();
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-25 13:05:25 +02:00
|
|
|
// Matrix-mult with key (this is irreversible)
|
2022-05-24 01:02:06 +02:00
|
|
|
m_expanded *= key;
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-25 13:05:25 +02:00
|
|
|
// Now do a bitshift
|
|
|
|
m_expanded.ShiftBitsLeftInplace();
|
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
// Non-linearly apply subsitution boxes
|
|
|
|
std::stringstream ss;
|
2022-05-24 01:02:06 +02:00
|
|
|
const std::string m_str = m_expanded.ToString();
|
2022-05-26 00:55:24 +02:00
|
|
|
for (std::size_t i = 0; i < Block::BLOCK_SIZE_BITS; i += 4) {
|
2022-05-22 17:32:54 +02:00
|
|
|
ss << SBox(m_str.substr(i, 4));
|
|
|
|
}
|
|
|
|
m_expanded = Block(ss.str());
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 20:13:41 +02:00
|
|
|
// Return the compressed version, shifted by 3
|
2022-05-24 01:02:06 +02:00
|
|
|
//return Shiftl(CompressionFunction(m_expanded), 3);
|
|
|
|
return (CompressionFunction(m_expanded));
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
std::pair<Halfblock, Halfblock> Feistel::FeistelSplit(const Block& block) {
|
2022-05-24 01:02:06 +02:00
|
|
|
const std::string bits = block.ToString();
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
Halfblock l(bits.substr(0, bits.size() / 2));
|
|
|
|
Halfblock r(bits.substr(bits.size() / 2));
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
return std::make_pair(l, r);
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Block Feistel::FeistelCombine(const Halfblock& l, const Halfblock& r) {
|
2022-05-26 00:55:24 +02:00
|
|
|
return Block(l.ToString() + r.ToString());
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Block Feistel::ExpansionFunction(const Halfblock& block) {
|
2022-05-22 17:32:54 +02:00
|
|
|
std::stringstream ss;
|
2022-05-26 00:55:24 +02:00
|
|
|
const std::string bits = block.ToString();
|
2022-05-22 17:32:54 +02:00
|
|
|
|
|
|
|
std::unordered_map<std::string, std::string> expansionMap;
|
|
|
|
expansionMap["00"] = "1101";
|
|
|
|
expansionMap["01"] = "1000";
|
|
|
|
expansionMap["10"] = "0010";
|
|
|
|
expansionMap["11"] = "0111";
|
|
|
|
|
|
|
|
// We have to double the bits!
|
2022-05-26 00:55:24 +02:00
|
|
|
for (std::size_t i = 0; i < Halfblock::BLOCK_SIZE_BITS; i += 2) {
|
2022-05-22 17:32:54 +02:00
|
|
|
const std::string sub = bits.substr(i, 2);
|
|
|
|
ss << expansionMap[sub];
|
|
|
|
}
|
|
|
|
|
|
|
|
return Block(ss.str());
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Halfblock Feistel::CompressionFunction(const Block& block) {
|
2022-05-22 17:32:54 +02:00
|
|
|
std::stringstream ss;
|
2022-05-24 01:02:06 +02:00
|
|
|
const std::string bits = block.ToString();
|
2022-05-22 17:32:54 +02:00
|
|
|
|
|
|
|
std::unordered_map<std::string, std::string> compressionMap;
|
|
|
|
compressionMap["0000"] = "10";
|
|
|
|
compressionMap["0001"] = "01";
|
2022-05-22 20:13:41 +02:00
|
|
|
compressionMap["0010"] = "11";
|
2022-05-22 17:32:54 +02:00
|
|
|
compressionMap["0011"] = "10";
|
|
|
|
compressionMap["0100"] = "11";
|
|
|
|
compressionMap["0101"] = "01";
|
|
|
|
compressionMap["0110"] = "00";
|
2022-05-22 20:13:41 +02:00
|
|
|
compressionMap["0111"] = "01";
|
|
|
|
compressionMap["1000"] = "11";
|
2022-05-22 17:32:54 +02:00
|
|
|
compressionMap["1001"] = "00";
|
|
|
|
compressionMap["1010"] = "11";
|
|
|
|
compressionMap["1011"] = "00";
|
|
|
|
compressionMap["1100"] = "11";
|
|
|
|
compressionMap["1101"] = "10";
|
|
|
|
compressionMap["1110"] = "00";
|
|
|
|
compressionMap["1111"] = "01";
|
|
|
|
|
|
|
|
// We have to half the bits!
|
2022-05-26 00:55:24 +02:00
|
|
|
for (std::size_t i = 0; i < Block::BLOCK_SIZE_BITS; i += 4) {
|
2022-05-22 17:32:54 +02:00
|
|
|
const std::string sub = bits.substr(i, 4);
|
|
|
|
ss << compressionMap[sub];
|
|
|
|
}
|
|
|
|
|
|
|
|
return Halfblock(ss.str());
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
std::string Feistel::SBox(const std::string& in) {
|
2022-05-22 17:32:54 +02:00
|
|
|
static std::unordered_map<std::string, std::string> subMap;
|
|
|
|
static bool mapInitialized = false;
|
|
|
|
if (!mapInitialized) {
|
|
|
|
subMap["0000"] = "1100";
|
|
|
|
subMap["0001"] = "1000";
|
|
|
|
subMap["0010"] = "0001";
|
|
|
|
subMap["0011"] = "0111";
|
|
|
|
subMap["0100"] = "1011";
|
|
|
|
subMap["0101"] = "0011";
|
|
|
|
subMap["0110"] = "1101";
|
|
|
|
subMap["0111"] = "1111";
|
|
|
|
subMap["1000"] = "0000";
|
|
|
|
subMap["1001"] = "1010";
|
|
|
|
subMap["1010"] = "0100";
|
|
|
|
subMap["1011"] = "1001";
|
|
|
|
subMap["1100"] = "0010";
|
|
|
|
subMap["1101"] = "1110";
|
|
|
|
subMap["1110"] = "0101";
|
|
|
|
subMap["1111"] = "0110";
|
|
|
|
mapInitialized = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return subMap[in];
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
2022-05-22 13:43:23 +02:00
|
|
|
void Feistel::GenerateRoundKeys(const Key& seedKey) {
|
2022-05-22 17:32:54 +02:00
|
|
|
// Clear initial key memory
|
|
|
|
ZeroKeyMemory();
|
|
|
|
roundKeys = Keyset();
|
|
|
|
|
2022-05-25 13:05:25 +02:00
|
|
|
// Derive all round keys with simple matrix operations
|
|
|
|
roundKeys[0] = seedKey;
|
2022-05-22 17:32:54 +02:00
|
|
|
|
2022-05-25 13:05:25 +02:00
|
|
|
for (std::size_t i = 1; i < roundKeys.size(); i++) {
|
2022-05-22 17:32:54 +02:00
|
|
|
// Initialize new round key with last round key
|
2022-05-25 13:05:25 +02:00
|
|
|
const Key& lastKey = roundKeys[i - 1];
|
|
|
|
roundKeys[i] = lastKey;
|
|
|
|
|
|
|
|
// Stir it good
|
|
|
|
roundKeys[i].ShiftRowsUpInplace();
|
|
|
|
|
|
|
|
// Bitshift and matrix-mult 3 times
|
|
|
|
// (each time jumbles it up pretty good)
|
|
|
|
// This is irreversible
|
|
|
|
roundKeys[i].ShiftBitsRightInplace();
|
|
|
|
roundKeys[i] *= lastKey;
|
|
|
|
roundKeys[i].ShiftBitsRightInplace();
|
|
|
|
roundKeys[i] *= lastKey;
|
|
|
|
roundKeys[i].ShiftBitsRightInplace();
|
|
|
|
roundKeys[i] *= lastKey;
|
|
|
|
|
|
|
|
// Lastly, do apply some cell shifting, and other mutations
|
|
|
|
roundKeys[i].ShiftCellsRightInplace();
|
|
|
|
roundKeys[i] += lastKey;
|
|
|
|
roundKeys[i].ShiftColumnsRightInplace();
|
|
|
|
roundKeys[i] ^= lastKey;
|
2022-05-22 17:32:54 +02:00
|
|
|
}
|
2022-05-16 22:15:34 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
return;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|
2022-05-22 16:54:40 +02:00
|
|
|
void Feistel::operator=(const Feistel& other) {
|
|
|
|
roundKeys = other.roundKeys;
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
// These pragmas only work for MSVC and g++, as far as i know. Beware!!!
|
2022-05-16 00:21:01 +02:00
|
|
|
#if defined _WIN32 || defined _WIN64
|
|
|
|
#pragma optimize("", off )
|
|
|
|
#elif defined __GNUG__
|
|
|
|
#pragma GCC push_options
|
|
|
|
#pragma GCC optimize ("O0")
|
|
|
|
#endif
|
2022-05-16 22:15:34 +02:00
|
|
|
void Feistel::ZeroKeyMemory() {
|
2022-05-22 17:32:54 +02:00
|
|
|
for (Key& key : roundKeys) {
|
2022-05-24 01:02:06 +02:00
|
|
|
key.Reset();
|
2022-05-22 17:32:54 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
|
2022-05-22 17:32:54 +02:00
|
|
|
return;
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
2022-05-16 00:21:01 +02:00
|
|
|
#if defined _WIN32 || defined _WIN64
|
|
|
|
#pragma optimize("", on )
|
|
|
|
#elif defined __GNUG__
|
|
|
|
#pragma GCC pop_options
|
|
|
|
#endif
|
2022-05-16 22:01:52 +02:00
|
|
|
|
2022-05-16 22:15:34 +02:00
|
|
|
}
|
|
|
|
|