aboutsummaryrefslogtreecommitdiff
path: root/src/util/crypto_hash.c
diff options
context:
space:
mode:
authorChristian Grothoff <christian@grothoff.org>2013-09-05 08:06:15 +0000
committerChristian Grothoff <christian@grothoff.org>2013-09-05 08:06:15 +0000
commit8c52b877f3d8787395386b939b89cb9741c317f0 (patch)
treee052839fe22d99118333120a62a659ff19b0a6bd /src/util/crypto_hash.c
parent69a409b107c52744b637a5115300b93ef53190e3 (diff)
downloadgnunet-8c52b877f3d8787395386b939b89cb9741c317f0.tar.gz
gnunet-8c52b877f3d8787395386b939b89cb9741c317f0.zip
-only use x for ECDH
Diffstat (limited to 'src/util/crypto_hash.c')
-rw-r--r--src/util/crypto_hash.c2
1 files changed, 2 insertions, 0 deletions
diff --git a/src/util/crypto_hash.c b/src/util/crypto_hash.c
index c1d82abae..a5b97148b 100644
--- a/src/util/crypto_hash.c
+++ b/src/util/crypto_hash.c
@@ -290,6 +290,8 @@ GNUNET_CRYPTO_hash_from_string2 (const char *enc, size_t enclen,
290 290
291 291
292/** 292/**
293 * @ingroup hash
294 *
293 * Compute the distance between 2 hashcodes. The computation must be 295 * Compute the distance between 2 hashcodes. The computation must be
294 * fast, not involve bits[0] or bits[4] (they're used elsewhere), and be 296 * fast, not involve bits[0] or bits[4] (they're used elsewhere), and be
295 * somewhat consistent. And of course, the result should be a positive 297 * somewhat consistent. And of course, the result should be a positive