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

More streamlined naming scheme for digestion method of ghash

Browse Source
This commit is contained in:
Leonetienne 2022-05-26 19:57:14 +02:00
parent f246e3a5ef
commit 75c4b0a0d9
No known key found for this signature in database
GPG Key ID: C33879CD92E9708C
4 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
GCryptLib/exec/visualize-hashing-distribution.cpp
View File

@ -11,7 +11,7 @@ using namespace Leonetienne::Eule;
void HashAndVisualize(const Block& b, const std::string filename) {
GHash hasher;
hasher.DigestBlock(b);
hasher.Digest(b);
VisualizeBlock(hasher.GetHashsum(), filename);
}

2
GCryptLib/include/GCrypt/GHash.h
View File

@ -16,7 +16,7 @@ namespace Leonetienne::GCrypt {
//! WARNING: If you compute hashes using this digestive method,
//! you REALLY REALLY should add a trailing block just containing the cleartext size!
//! You MOST LIKELY just want to use the wrapper function GHash::CalculateHashsum(Flexblock const&) instead!
void DigestBlock(const Block& data);
void Digest(const Block& data);
//! Will return the current hashsum
const Block& GetHashsum() const;

6
GCryptLib/src/GHash.cpp
View File

@ -24,7 +24,7 @@ namespace Leonetienne::GCrypt {
return;
}
void GHash::DigestBlock(const Block& data) {
void GHash::Digest(const Block& data) {
// Set the cipher key to the current data to be hashed
cipher.SetKey(data);
@ -50,7 +50,7 @@ namespace Leonetienne::GCrypt {
// Digest all blocks
for (const Block& block : data) {
hasher.DigestBlock(block);
hasher.Digest(block);
}
// Add an additional block, containing the length of the input
@ -75,7 +75,7 @@ namespace Leonetienne::GCrypt {
lengthBlock.FromTextString(ss.str());
// Digest the length block
hasher.DigestBlock(lengthBlock);
hasher.Digest(lengthBlock);
// Return the total hashsum
return hasher.GetHashsum();

6
GCryptLib/src/GPrng.cpp
View File

@ -5,7 +5,7 @@ namespace Leonetienne::GCrypt {
GPrng::GPrng(const Block& seed) {
this->seed = seed;
hasher.DigestBlock(seed);
hasher.Digest(seed);
}
GPrng::GPrng() {
@ -14,7 +14,7 @@ namespace Leonetienne::GCrypt {
void GPrng::Seed(const Block& seed) {
hasher = GHash();
this->seed = seed;
hasher.DigestBlock(seed);
hasher.Digest(seed);
return;
}
@ -37,7 +37,7 @@ namespace Leonetienne::GCrypt {
// state of the hash function, unless the seed is known.
// Advance the block (Add the current hashsum XOR seed to the hasher)
hasher.DigestBlock(Block(hasher.GetHashsum() ^ seed));
hasher.Digest(Block(hasher.GetHashsum() ^ seed));
// Reset the pointer
nextBit = 0;