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

Now making use of passwords of arbitrary length

Browse Source
This commit is contained in:
Leonetienne 2021-12-05 19:26:58 +01:00
parent 7213f02a01
commit d07840711e
1 changed files with 15 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
main.cpp
View File

@ -23,6 +23,9 @@ std::pair<Halfblock, Halfblock> FeistelSplit(const Block& block);
// Combine two half blocks (L and R) into a regular data block // Combine two half blocks (L and R) into a regular data block
Block FeistelCombine(const Halfblock& l, const Halfblock& r); Block FeistelCombine(const Halfblock& l, const Halfblock& r);
// Creates a key of size key-size from a password of arbitrary length.
Block PasswordToKey(const std::string& in);
// Will generate a keyset from a seed-key // Will generate a keyset from a seed-key
Keyset GenerateRoundkeys(const Block& seedKey); Keyset GenerateRoundkeys(const Block& seedKey);
@ -77,7 +80,7 @@ std::string DebugPrint(const std::string& asciiMessage)
{ {
Block message = StringToBits(asciiMessage); Block message = StringToBits(asciiMessage);
const Block seedKey = StringToBits("Ich bin ein PASSWORT-SCHLÜSSEL!"); const Block seedKey = PasswordToKey("Ich bin ein PASSWORT-SCHLÜSSEL!");
Keyset roundkeys = GenerateRoundkeys(seedKey); Keyset roundkeys = GenerateRoundkeys(seedKey);
//std::cout << "Keys: " << std::endl; //std::cout << "Keys: " << std::endl;
@ -309,3 +312,14 @@ std::bitset<T> Shiftr(const std::bitset<T>& bits, std::size_t amount)
return std::bitset<T>(ss.str()); return std::bitset<T>(ss.str());
} }
Block PasswordToKey(const std::string& in)
{
Block b;
// Segment the password in segments of key-size, and xor them together.
for (std::size_t i = 0; i < in.size(); i += BLOCK_SIZE / 8)
b ^= StringToBits(in.substr(i, BLOCK_SIZE / 8));
return b;
}