leonetienne/GCrypt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implemented a key class

Browse Source
This commit is contained in:
Leonetienne
2022-05-22 13:43:23 +02:00
parent bb76cbb2d7
commit 9fdc642bd6
13 changed files with 100 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
GCryptLib/src/Feistel.cpp
View File

@@ -5,7 +5,7 @@
namespace Leonetienne::GCrypt {
Feistel::Feistel(const Block& key) {
Feistel::Feistel(const Key& key) {
SetKey(key);
return;
}
@@ -16,7 +16,7 @@ namespace Leonetienne::GCrypt {
return;
}
void Feistel::SetKey(const Block& key) {
void Feistel::SetKey(const Key& key) {
GenerateRoundKeys(key);
return;
}
@@ -59,7 +59,7 @@ namespace Leonetienne::GCrypt {
return FeistelCombine(r, l);
}
Halfblock Feistel::F(Halfblock m, const Block& key) {
Halfblock Feistel::F(Halfblock m, const Key& key) {
// Made-up F function
// Expand to full bitwidth
@@ -174,7 +174,7 @@ namespace Leonetienne::GCrypt {
return subMap[in];
}
void Feistel::GenerateRoundKeys(const Block& seedKey) {
void Feistel::GenerateRoundKeys(const Key& seedKey) {
// Clear initial key memory
ZeroKeyMemory();
roundKeys = Keyset();
@@ -234,7 +234,7 @@ namespace Leonetienne::GCrypt {
Halfblock halfkey1 = F(halfkeys.first, roundKeys[i - 2]);
Halfblock halfkey2 = halfkeys.second ^ halfkey1; // I know this is reversible, but it helps to diffuse future round keys.
roundKeys[i] = FeistelCombine(halfkey1, halfkey2);
roundKeys[i] = Key(FeistelCombine(halfkey1, halfkey2));
}
return;
@@ -248,7 +248,7 @@ namespace Leonetienne::GCrypt {
#pragma GCC optimize ("O0")
#endif
void Feistel::ZeroKeyMemory() {
for (Block& key : roundKeys) {
for (Key& key : roundKeys) {
key.reset();
}