diff options
author | Christian Grothoff <christian@grothoff.org> | 2014-12-17 18:01:18 +0000 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2014-12-17 18:01:18 +0000 |
commit | db4dae092f67f45913edcc1df403f47bf0558d1c (patch) | |
tree | 92e1d2999fd3f6d66b950ee8fbcff38bd2cfd612 /src/util/crypto_paillier.c | |
parent | 7e6d8e5462a3456895d8f9712f015bbf4ef7e9c7 (diff) | |
download | gnunet-db4dae092f67f45913edcc1df403f47bf0558d1c.tar.gz gnunet-db4dae092f67f45913edcc1df403f47bf0558d1c.zip |
-old-style comments, avoid duplicate comments
Diffstat (limited to 'src/util/crypto_paillier.c')
-rw-r--r-- | src/util/crypto_paillier.c | 32 |
1 files changed, 17 insertions, 15 deletions
diff --git a/src/util/crypto_paillier.c b/src/util/crypto_paillier.c index d2fd44800..ed6387041 100644 --- a/src/util/crypto_paillier.c +++ b/src/util/crypto_paillier.c | |||
@@ -127,16 +127,16 @@ GNUNET_CRYPTO_paillier_encrypt1 (const struct GNUNET_CRYPTO_PaillierPublicKey *p | |||
127 | gcry_mpi_t tmp2; | 127 | gcry_mpi_t tmp2; |
128 | unsigned int highbit; | 128 | unsigned int highbit; |
129 | 129 | ||
130 | // determine how many operations we could allow, if the other number | 130 | /* determine how many operations we could allow, if the other number |
131 | // has the same length. | 131 | has the same length. */ |
132 | GNUNET_assert (NULL != (tmp1 = gcry_mpi_set_ui (NULL, 1))); | 132 | GNUNET_assert (NULL != (tmp1 = gcry_mpi_set_ui (NULL, 1))); |
133 | GNUNET_assert (NULL != (tmp2 = gcry_mpi_set_ui (NULL, 2))); | 133 | GNUNET_assert (NULL != (tmp2 = gcry_mpi_set_ui (NULL, 2))); |
134 | gcry_mpi_mul_2exp (tmp1, tmp1, GNUNET_CRYPTO_PAILLIER_BITS); | 134 | gcry_mpi_mul_2exp (tmp1, tmp1, GNUNET_CRYPTO_PAILLIER_BITS); |
135 | 135 | ||
136 | // count number of possible operations | 136 | /* count number of possible operations |
137 | // this would be nicer with gcry_mpi_get_nbits, however it does not return | 137 | this would be nicer with gcry_mpi_get_nbits, however it does not return |
138 | // the BITLENGTH of the given MPI's value, but the bits required | 138 | the BITLENGTH of the given MPI's value, but the bits required |
139 | // to represent the number as MPI. | 139 | to represent the number as MPI. */ |
140 | for (possible_opts = -2; gcry_mpi_cmp (tmp1, m) > 0; possible_opts++) | 140 | for (possible_opts = -2; gcry_mpi_cmp (tmp1, m) > 0; possible_opts++) |
141 | gcry_mpi_div (tmp1, NULL, tmp1, tmp2, 0); | 141 | gcry_mpi_div (tmp1, NULL, tmp1, tmp2, 0); |
142 | gcry_mpi_release (tmp1); | 142 | gcry_mpi_release (tmp1); |
@@ -144,7 +144,7 @@ GNUNET_CRYPTO_paillier_encrypt1 (const struct GNUNET_CRYPTO_PaillierPublicKey *p | |||
144 | 144 | ||
145 | if (possible_opts < 1) | 145 | if (possible_opts < 1) |
146 | possible_opts = 0; | 146 | possible_opts = 0; |
147 | //soft-cap by caller | 147 | /* soft-cap by caller */ |
148 | possible_opts = (desired_ops < possible_opts)? desired_ops : possible_opts; | 148 | possible_opts = (desired_ops < possible_opts)? desired_ops : possible_opts; |
149 | 149 | ||
150 | ciphertext->remaining_ops = htonl (possible_opts); | 150 | ciphertext->remaining_ops = htonl (possible_opts); |
@@ -168,19 +168,21 @@ GNUNET_CRYPTO_paillier_encrypt1 (const struct GNUNET_CRYPTO_PaillierPublicKey *p | |||
168 | GNUNET_assert (0 != (c = gcry_mpi_new (0))); | 168 | GNUNET_assert (0 != (c = gcry_mpi_new (0))); |
169 | gcry_mpi_mul (n_square, n, n); | 169 | gcry_mpi_mul (n_square, n, n); |
170 | 170 | ||
171 | // generate r < n (without bias) | 171 | /* generate r < n (without bias) */ |
172 | do { | 172 | do { |
173 | gcry_mpi_randomize (r, highbit + 1, GCRY_STRONG_RANDOM); | 173 | gcry_mpi_randomize (r, highbit + 1, GCRY_STRONG_RANDOM); |
174 | } | 174 | } |
175 | while (gcry_mpi_cmp (r, n) >= 0); | 175 | while (gcry_mpi_cmp (r, n) >= 0); |
176 | 176 | ||
177 | // c = (n+1)^m mod n^2 | 177 | /* c = (n+1)^m mod n^2 */ |
178 | gcry_mpi_add_ui (c, n, 1); // c = n + 1 | 178 | /* c = n + 1 */ |
179 | gcry_mpi_powm (c, c, m, n_square); // c = (n+1)^m mod n^2 | 179 | gcry_mpi_add_ui (c, n, 1); |
180 | // r <- r^n mod n^2 | 180 | /* c = (n+1)^m mod n^2 */ |
181 | gcry_mpi_powm (r, r, n, n_square); // r = r^n mod n^2 | 181 | gcry_mpi_powm (c, c, m, n_square); |
182 | // c <- r*c mod n^2 | 182 | /* r <- r^n mod n^2 */ |
183 | gcry_mpi_mulm (c, r, c, n_square); // c = r*c mod n^2 | 183 | gcry_mpi_powm (r, r, n, n_square); |
184 | /* c <- r*c mod n^2 */ | ||
185 | gcry_mpi_mulm (c, r, c, n_square); | ||
184 | 186 | ||
185 | GNUNET_CRYPTO_mpi_print_unsigned (ciphertext->bits, | 187 | GNUNET_CRYPTO_mpi_print_unsigned (ciphertext->bits, |
186 | sizeof ciphertext->bits, | 188 | sizeof ciphertext->bits, |