aboutsummaryrefslogtreecommitdiff
path: root/crypto.c
diff options
context:
space:
mode:
Diffstat (limited to 'crypto.c')
-rw-r--r--crypto.c37
1 files changed, 19 insertions, 18 deletions
diff --git a/crypto.c b/crypto.c
index 0c2597d..044db00 100644
--- a/crypto.c
+++ b/crypto.c
@@ -324,7 +324,7 @@ smc_free2 (gcry_mpi_point_t **dst, uint16_t size1, uint16_t size2)
/**
* smc_sums_partial calculates sums up until the current index and stores them
- * in @a out. @$f\forall i \leq len: out_i=sum_{h=1}^iin_h@$f
+ * in @a out. \f$\forall i \leq len: out_i=\sum_{h=1}^iin_h\f$
*
* @param[out] out Where to store the resulting sums. Points may be given
* uninitialized, but the appropriate amount of memory has to be allocated
@@ -347,7 +347,8 @@ smc_sums_partial (gcry_mpi_point_t out[], gcry_mpi_point_t in[], uint16_t len)
/**
- * smc_sum calculates the sum of all input points. @$fout=sum_{i=1}^{len}in_i@$f
+ * smc_sum calculates the sum of all input points.
+ * \f$out=\sum_{i=1}^{len}in_i\f$
*
* @param[out] out Where to store the result
* @param[in] in Input points.
@@ -359,7 +360,7 @@ smc_sum (gcry_mpi_point_t out, gcry_mpi_point_t in[], uint16_t len)
uint16_t i;
brandt_assert (NULL != out);
- /**TODO: how to copy a point more efficiently? */
+ /**\todo: how to copy a point more efficiently? */
gcry_mpi_ec_add (out, ec_zero, ec_zero, ec_ctx);
for (i = 0; i < len; i++)
gcry_mpi_ec_add (out, out, in[i], ec_ctx);
@@ -382,12 +383,12 @@ smc_compute_pkey (struct AuctionData *ad)
/**
* smc_zkp_dl
*
- * @param v TODO
- * @param g TODO
- * @param x TODO
- * @param a TODO
- * @param c TODO
- * @param r TODO
+ * @param v \todo
+ * @param g \todo
+ * @param x \todo
+ * @param a \todo
+ * @param c \todo
+ * @param r \todo
*/
void
smc_zkp_dl (const gcry_mpi_point_t v,
@@ -402,7 +403,7 @@ smc_zkp_dl (const gcry_mpi_point_t v,
ec_keypair_create_base (a, z, g);
/* compute challange c */
- /**TODO: generate c from HASH(g,v,a) and don't output it */
+ /**\todo: generate c from HASH(g,v,a) and don't output it */
ec_skey_create (c);
gcry_mpi_mod (c, c, ec_n);
@@ -416,11 +417,11 @@ smc_zkp_dl (const gcry_mpi_point_t v,
/**
* smc_zkp_dl_check
*
- * @param v TODO
- * @param g TODO
- * @param a TODO
- * @param c TODO
- * @param r TODO
+ * @param v \todo
+ * @param g \todo
+ * @param a \todo
+ * @param c \todo
+ * @param r \todo
* @return 0 if the proof is correct, something else otherwise
*/
int
@@ -463,7 +464,7 @@ smc_zkp_2dle (const gcry_mpi_point_t v,
gcry_mpi_ec_mul (b, z, g2, ec_ctx);
/* compute challange c */
- /**TODO: generate c from HASH(g1,g2,v,w,a,b) and don't output it */
+ /* \todo: generate c from HASH(g1,g2,v,w,a,b) and don't output it */
ec_skey_create (c);
gcry_mpi_mod (c, c, ec_n);
@@ -560,7 +561,7 @@ smc_zkp_0og (gcry_mpi_point_t alpha,
gcry_mpi_ec_mul (b2, w, y, ec_ctx);
/* compute challange c */
- /**TODO: generate c from HASH(alpha,beta,a1,b1,a2,b2) and don't output it */
+ /* \todo: generate c from HASH(alpha,beta,a1,b1,a2,b2) and don't output it */
ec_skey_create (c);
gcry_mpi_mod (c, c, ec_n);
@@ -596,7 +597,7 @@ smc_zkp_0og (gcry_mpi_point_t alpha,
gcry_mpi_ec_mul (b1, w, y, ec_ctx);
/* compute challange c */
- /**TODO: generate c from HASH(alpha,beta,a1,b1,a2,b2) and don't output it */
+ /* \todo: generate c from HASH(alpha,beta,a1,b1,a2,b2) and don't output it */
ec_skey_create (c);
gcry_mpi_mod (c, c, ec_n);