oec/libbrandt
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

simplify check

Browse Source
This commit is contained in:
Markus Teich 2016-10-12 14:08:50 +02:00
parent 9070e0fa9f
commit 7e4d82b58b
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
fp_pub.c
View File

@ -170,7 +170,7 @@ fp_pub_compute_outcome (struct BRANDT_Auction *ad, size_t *buflen)
ec_point_copy (tmpa, ad->gamma2[ad->i][j]); ec_point_copy (tmpa, ad->gamma2[ad->i][j]);
ec_point_copy (tmpb, ad->delta2[ad->i][j]); ec_point_copy (tmpb, ad->delta2[ad->i][j]);
/* apply random masking for losing bidders */ /* apply random masking to first summand */
smc_zkp_2dle (ad->gamma2[ad->i][j], smc_zkp_2dle (ad->gamma2[ad->i][j],
ad->delta2[ad->i][j], ad->delta2[ad->i][j],
tmpa, tmpa,
@ -411,7 +411,7 @@ fp_pub_determine_outcome (struct BRANDT_Auction *ad,
dlogi /= ad->n; dlogi /= ad->n;
/* can only support up to bits(dlogi) bidders */ /* can only support up to bits(dlogi) bidders */
brandt_assert (sizeof (int) * 8 - 1 >= ad->n); brandt_assert (sizeof (int) * 8 > ad->n);
for (uint16_t i = 0; i < ad->n; i++) for (uint16_t i = 0; i < ad->n; i++)
{ {
/* first set bit determines the winner */ /* first set bit determines the winner */