taigrr/arduinolibs
1
0
Fork 0
mirror of https://github.com/taigrr/arduinolibs synced 2025-01-18 04:33:12 -08:00
Code Issues Projects Releases Wiki Activity

Simplify the hashing API by removing the need to remember the final hash

Browse Source
This commit is contained in:
Rhys Weatherley
2015-03-14 15:36:40 +10:00
parent e7175a80f3
commit 0c52bf0d50
17 changed files with 94 additions and 196 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
libraries/Crypto/examples/TestBLAKE2b/TestBLAKE2b.ino
View File

@@ -98,17 +98,7 @@ bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc)
size_t posn, len;
uint8_t value[HASH_SIZE];
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)
len = inc;
hash->update(test->data + posn, len);
}
hash->finalize(value, sizeof(value));
if (memcmp(value, test->hash, sizeof(value)) != 0)
return false;
// Try again to make sure the hash resets.
hash->reset();
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)

12
libraries/Crypto/examples/TestBLAKE2s/TestBLAKE2s.ino
View File

@@ -82,17 +82,7 @@ bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc)
size_t posn, len;
uint8_t value[HASH_SIZE];
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)
len = inc;
hash->update(test->data + posn, len);
}
hash->finalize(value, sizeof(value));
if (memcmp(value, test->hash, sizeof(value)) != 0)
return false;
// Try again to make sure the hash resets.
hash->reset();
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)

12
libraries/Crypto/examples/TestSHA1/TestSHA1.ino
View File

@@ -62,17 +62,7 @@ bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc)
size_t posn, len;
uint8_t value[HASH_SIZE];
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)
len = inc;
hash->update(test->data + posn, len);
}
hash->finalize(value, sizeof(value));
if (memcmp(value, test->hash, sizeof(value)) != 0)
return false;
// Try again to make sure the hash resets.
hash->reset();
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)

12
libraries/Crypto/examples/TestSHA256/TestSHA256.ino
View File

@@ -64,17 +64,7 @@ bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc)
size_t posn, len;
uint8_t value[HASH_SIZE];
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)
len = inc;
hash->update(test->data + posn, len);
}
hash->finalize(value, sizeof(value));
if (memcmp(value, test->hash, sizeof(value)) != 0)
return false;
// Try again to make sure the hash resets.
hash->reset();
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)

12
libraries/Crypto/examples/TestSHA512/TestSHA512.ino
View File

@@ -85,17 +85,7 @@ bool testHash_N(Hash *hash, const struct TestHashVector *test, size_t inc)
size_t posn, len;
uint8_t value[HASH_SIZE];
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)
len = inc;
hash->update(test->data + posn, len);
}
hash->finalize(value, sizeof(value));
if (memcmp(value, test->hash, sizeof(value)) != 0)
return false;
// Try again to make sure the hash resets.
hash->reset();
for (posn = 0; posn < size; posn += inc) {
len = size - posn;
if (len > inc)