[GNUnet-SVN] r31255 - gnunet-java

[gnunet]

Author: dold
Date: 2013-12-10 12:56:52 +0100 (Tue, 10 Dec 2013)
New Revision: 31255

Modified:
   gnunet-java/ISSUES
Log:
issues

Modified: gnunet-java/ISSUES
===================================================================
--- gnunet-java/ISSUES  2013-12-10 11:14:22 UTC (rev 31254)
+++ gnunet-java/ISSUES  2013-12-10 11:56:52 UTC (rev 31255)
@@ -1,16 +1,11 @@
 crypto:
- * I've started to implement montgomery addition in gnunet-java based on
-   the somewhat well hidden paper by dbj I sent to Werner
-  * but I don't really understand how it works yet ...
- * GNUnet crypto does not verify against ECDHE with ed25519.py
-  * see the script
-  * gnunet-java verifies
-  * problem already starts at key generation
-  * equivalent for other EC cryptosystems in GNUnet (I just happened to test 
ECDHE first)
- * endianess in the libgcrypt bit fiddling?
- * what about montgomery vs. twisted edwards performance now?
+ * after werner's fix, the results from libgcrypt / ecdhe-keygen.c do check 
out with ed25519.py
+ * what about Montgomery Addition ... should I finish implementing it in java?
+  * implementation would be based on the python code in the NaCl paper
+ * private key is big endian, public key is little endian ...
+ * ECDHE and EdDSA now work
+ * I still have some problems with ECDSA in java, needs more debugging ...
 
-set: any issues?
 
 consensus / deadlines:
  * I'm not sure anymore if the deadline should be relative or absolute time.
@@ -19,19 +14,35 @@
     in sync (modulo clock skew)
   * relative time makes computation of subrounds that do consensus easier
 
-scalarproduct:
- * both scalarproduct and secretsharing use paillier crypto, might make sense 
to share implementation
- * I think scalarproduct uses relatively complicated key generation
-  * see Wikipedia or Introduction to Modern Cryptography: Principles and 
Protocols for easier way
- * what does this do (in encrypt_element):
-     while (0 >= gcry_mpi_cmp_ui (tmp, 1)) {
-       gcry_mpi_randomize (tmp, KEYBITS / 3, GCRY_WEAK_RANDOM);
-       // r must be 1 < r < n
-     }
-  * why the division by 3?
-  
+paillier in scalarproduct: I think it's wrong
+ * can libgcrypt's random return a negative value
+ * should we check for a 0-value that has p>2^{-1024}? I'd say no ...
+ * scalarproduct uses "libgcrypt key container", does this make
+   sense to use for the implementation in /util?
 
+mesh: it's not specified whether the tunnel end callback
+will be called sync or async on tunnel destroy
+
+set: destruction of operations / operations as tunnel context is really nasty 
...
+but I don't really know how to improve the current implementation
+
+BSc thesis:
+ * in how much depth should Paillier be covered?
+
 secretsharing:
+ * secretsharing: key generation is almost implemented
+  * modulo defining constants, testing, crypto bugs, NIZKPs and stuff I forgot
+
+ * what key size do we want
+  * should key size be variable in the util/ implementation?
+
+ * libgcrypt does not have polynomial evaluation?
+
+ * what's the best way to define bignum constants? hex notation #define? bytes
+   in static const array?
+
+---
+
  * DKG now two simple consensus rounds
   * pre-secret commitment and ephemeral key exchange
    * constant-size element