/**
* Calculate the 'proof-of-work' hash (an expensive hash).
*
+ * @param salt salt to use in pow calculation
* @param buf data to hash
* @param buf_len number of bytes in @a buf
* @param result where to write the resulting hash
*/
void
-GNUNET_CRYPTO_pow_hash (const void *buf,
+GNUNET_CRYPTO_pow_hash (const char *salt,
+ const void *buf,
size_t buf_len,
struct GNUNET_HashCode *result);
GNUNET_memcpy (&buf[sizeof(val)],
pkey,
sizeof(struct GNUNET_CRYPTO_EddsaPublicKey));
- GNUNET_CRYPTO_pow_hash (buf, sizeof(buf), &result);
+ GNUNET_CRYPTO_pow_hash ("gnunet-nse-proof-of-work",
+ buf,
+ sizeof(buf),
+ &result);
return (count_leading_zeroes (&result) >= nse_work_required) ? GNUNET_YES
: GNUNET_NO;
}
while ((counter != UINT64_MAX) && (i < ROUND_SIZE))
{
GNUNET_memcpy (buf, &counter, sizeof(uint64_t));
- GNUNET_CRYPTO_pow_hash (buf, sizeof(buf), &result);
+ GNUNET_CRYPTO_pow_hash ("gnunet-nse-proof-of-work",
+ buf,
+ sizeof(buf),
+ &result);
if (nse_work_required <= count_leading_zeroes (&result))
{
my_proof = counter;
#include <gauger.h>
-/**
- * Calculate the 'proof-of-work' hash (an expensive hash).
- *
- * @param buf data to hash
- * @param buf_len number of bytes in 'buf'
- * @param result where to write the resulting hash
- */
-static void
-pow_hash (const void *buf,
- size_t buf_len,
- struct GNUNET_HashCode *result)
-{
- GNUNET_break (0 ==
- gcry_kdf_derive (buf, buf_len,
- GCRY_KDF_SCRYPT,
- 1 /* subalgo */,
- "gnunet-proof-of-work", strlen (
- "gnunet-proof-of-work"),
- 2 /* iterations; keep cost of individual op small */,
- sizeof(struct GNUNET_HashCode), result));
-}
-
-
static void
perfHash ()
{
struct GNUNET_HashCode hc;
- unsigned int i;
char buf[64];
memset (buf, 1, sizeof(buf));
- for (i = 0; i < 1024; i++)
- pow_hash (buf, sizeof(buf), &hc);
+ for (unsigned int i = 0; i < 1024; i++)
+ GNUNET_CRYPTO_pow_hash ("gnunet-proof-of-work",
+ buf,
+ sizeof(buf),
+ &hc);
}
}
-/**
- * Calculate the 'proof-of-work' hash (an expensive hash).
- *
- * @param buf data to hash
- * @param buf_len number of bytes in @a buf
- * @param result where to write the resulting hash
- */
-static void
-pow_hash (const void *buf,
- size_t buf_len,
- struct GNUNET_HashCode *result)
-{
- GNUNET_break (0 ==
- gcry_kdf_derive (buf, buf_len,
- GCRY_KDF_SCRYPT,
- 1 /* subalgo */,
- "gnunet-revocation-proof-of-work",
- strlen ("gnunet-revocation-proof-of-work"),
- 2 /* iterations; keep cost of individual op small */,
- sizeof(struct GNUNET_HashCode), result));
-}
-
-
/**
* Count the leading zeroes in hash.
*
GNUNET_memcpy (buf, &pow, sizeof(pow));
GNUNET_memcpy (&buf[sizeof(pow)], key,
sizeof(struct GNUNET_CRYPTO_EcdsaPublicKey));
- pow_hash (buf, sizeof(buf), &result);
+ GNUNET_CRYPTO_pow_hash ("gnunet-revocation-proof-of-work",
+ buf,
+ sizeof(buf),
+ &result);
return (count_leading_zeroes (&result) >=
matching_bits) ? GNUNET_YES : GNUNET_NO;
}
* We're using a non-standard formula to avoid issues with
* ASICs appearing (see #3795).
*
+ * @param salt salt for the hash
* @param buf data to hash
* @param buf_len number of bytes in @a buf
* @param result where to write the resulting hash
*/
void
-GNUNET_CRYPTO_pow_hash (const void *buf, size_t buf_len, struct
- GNUNET_HashCode *result)
+GNUNET_CRYPTO_pow_hash (const char *salt,
+ const void *buf,
+ size_t buf_len,
+ struct GNUNET_HashCode *result)
{
#if NEW_CRYPTO
struct GNUNET_CRYPTO_SymmetricInitializationVector iv;
buf_len,
GCRY_KDF_SCRYPT,
1 /* subalgo */,
- "gnunet-proof-of-work-1",
- strlen ("gnunet-proof-of-work-1"),
+ salt,
+ strlen (salt),
2 /* iterations; keep cost of individual op small */,
sizeof(skey),
&skey));
&skey,
"gnunet-proof-of-work-iv",
strlen ("gnunet-proof-of-work-iv"),
+ salt,
+ strlen (salt),
NULL, 0);
GNUNET_CRYPTO_symmetric_encrypt (buf,
buf_len,
buf_len,
GCRY_KDF_SCRYPT,
1 /* subalgo */,
- "gnunet-proof-of-work-2",
- strlen ("gnunet-proof-of-work-2"),
+ salt,
+ strlen (salt),
2 /* iterations; keep cost of individual op small */,
sizeof(struct GNUNET_HashCode),
result));
buf_len,
GCRY_KDF_SCRYPT,
1 /* subalgo */,
- "gnunet-proof-of-work",
- strlen ("gnunet-proof-of-work"),
+ salt,
+ strlen (salt),
2 /* iterations; keep cost of individual op small */,
sizeof(struct GNUNET_HashCode),
result));
while ((counter != UINT64_MAX) && (i < ROUND_SIZE))
{
GNUNET_memcpy (buf, &counter, sizeof(uint64_t));
- GNUNET_CRYPTO_pow_hash (buf, sizeof(buf), &result);
+ GNUNET_CRYPTO_pow_hash ("gnunet-nse-proof-of-work",
+ buf,
+ sizeof(buf),
+ &result);
if (nse_work_required <= count_leading_zeroes (&result))
{
proof = counter;