aboutsummaryrefslogtreecommitdiff
path: root/src/include/gnunet_crypto_lib.h
Commit message (Collapse)AuthorAge
* use new POW function consistently, also in revocationChristian Grothoff2019-11-30
|
* create crypto_pow, in preparation for #3795Christian Grothoff2019-11-30
|
* global reindent, now with uncrustify hook enabledChristian Grothoff2019-10-05
|
* uncrustify as demanded.ng02019-09-08
|
* fix dead linkSchanzenbach, Martin2019-08-08
|
* add option to display private keysChristian Grothoff2019-06-14
|
* implement backchannel encryption/decryptionChristian Grothoff2019-04-16
|
* implement handle_validation_response logicChristian Grothoff2019-04-14
|
* new key, new HELLOChristian Grothoff2019-04-12
|
* introduce GNUNET_memcmp() and GNUNET_is_zero()Christian Grothoff2019-04-06
|
* more work on TCP communicatorChristian Grothoff2019-01-28
|
* src: for every AGPL3.0 file, add SPDX identifier.ng02019-01-14
|
* draft ATS API for TNGChristian Grothoff2018-11-29
|
* add more general HMAC function for JWTsSchanzenbach, Martin2018-07-21
|
* Changed decription of GNUNET_CRYPTO_EddsaPublicKey.Bernd Fix2018-07-12
|
* paragraph for gnunet devs that don't know how to use the webpsyc://loupsycedyglgamf.onion/~lynX2018-06-07
|
* glitch in the license text detected by hyazinthe, thank you!psyc://loupsycedyglgamf.onion/~lynX2018-06-07
|
* first batch of license fixes (boring)psyc://loupsycedyglgamf.onion/~lynX2018-06-05
|
* typofixamirouche2018-01-08
| | | | Signed-off-by: ng0 <ng0@n0.is>
* doxygen/indentation fixesChristian Grothoff2017-11-02
|
* add -P option to gnunet-eccChristian Grothoff2017-11-01
|
* add missing constChristian Grothoff2017-10-31
|
* introducing GNUNET_CRYPTO_ecdhe_create2() to avoid malloc nonsenseChristian Grothoff2017-02-15
|
* use new shortmap to simplify CADET logic a bitChristian Grothoff2017-01-17
|
* introducing the short mapChristian Grothoff2017-01-17
|
* fix dlog API for mteichChristian Grothoff2016-07-06
|
* Rework the error handling for gcd(r,n) != 1 so the Taler wallet can see errors.Jeff Burdges2016-06-08
|
* Use a uniform random number mod an RSA composites for bothJeff Burdges2016-05-30
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | the blinding factor and the full domain hash. This resolves an attack against the blinding factor in Taler: There was a call to GNUNET_CRYPTO_kdf in bkey = rsa_blinding_key_derive (len, bks); that gives exactly len bits where len = GNUNET_CRYPTO_rsa_public_key_len (pkey); Now r = 2^(len-1)/pkey.n is the probability that a set high bit being okay, meaning bkey < pkey.n. It follows that (1-r)/2 of the time bkey > pkey.n making the effective bkey be bkey mod pkey.n = bkey - pkey.n so the effective bkey has its high bit set with probability r/2. We expect r to be close to 1/2 if the exchange is honest, but the exchange can choose r otherwise. In blind signing, the exchange sees B = bkey * S mod pkey.n On deposit, the exchange sees S so they can compute bkey' = B/S mod pkey.n for all B they recorded to see if bkey' has it's high bit set. Also, note the exchange can compute 1/S efficiently since they know the factors of pkey.n. I suppose that happens with probability r/(1+r) if its the wrong B, not completely sure. If otoh we've the right B, then we've the probability r/2 of a set high bit in the effective bkey. Interestingly, r^2-r has a maximum at the default r=1/2 anyways, giving the wrong and right probabilities 1/3 and 1/4, respectively. I fear this gives the exchange a meaningful fraction of a bit of information per coin involved in the transaction. It sounds damaging if numerous coins were involved. And it could run across transactions in some scenarios. I suspect we need a more uniform deterministic pseudo-random number generator for blinding factors. Just fyi, our old call to gcry_mpi_randomize had this same problem. I do not believe this caused a problem for the full domain hash, but we can fix it easily enough anyways.
* fixing #4483: optimize blinding key storage/transmissionChristian Grothoff2016-05-24
|
* rename.sh GNUNET_CRYPTO_rsa_BlindingKey to GNUNET_CRYPTO_RsaBlindingKey ↵Christian Grothoff2016-05-19
| | | | following naming conventions
* Fix paramater descriptionJeff Burdges2016-03-21
|
* Updated global symbols for FDH Jeff Burdges2016-03-21
|
* fixing symbol naming and coding convention issuesChristian Grothoff2016-03-21
|
* -fix (C) noticesChristian Grothoff2016-01-19
|
* add crc8Christian Grothoff2016-01-17
|
* doxygen: add documentation linksGabor X Toth2016-01-15
|
* doxygen: group/module definitions (part 1)Gabor X Toth2016-01-11
|
* - Add ecdsa ecdh functionsMartin Schanzenbach2016-01-04
| | | | | - Update identity token to encrypted protocol
* -fix ftbfsChristian Grothoff2015-09-05
|
* add GNUNET_CRYPTO_ecc_pmul_mpiChristian Grothoff2015-09-05
|
* adding bin_to_point and point_to_bin functions for GNUNET_CRYPTO_ecc APIChristian Grothoff2015-09-05
|
* DEFAULTSERVICES is dead, remove remainsChristian Grothoff2015-07-08
|
* -fix non-deterministic peerstore sync failureChristian Grothoff2015-07-06
|
* -adding ecc dlog supportChristian Grothoff2015-07-02
|
* fix #3869: outdated FSF addressChristian Grothoff2015-06-30
|
* patch from Nicolas Fournier to add some _dup and _cmp functions for RSA ↵Christian Grothoff2015-06-30
| | | | signatures and private keys
* fix #3862Christian Grothoff2015-06-23
|
* -minor fixesChristian Grothoff2015-06-10
|
* make libextractor actually optional, both for GNUnet and GNUnet-taler buildsChristian Grothoff2015-05-30
|
* Introduce function to duplicate RSA public keysSree Harsha Totakura2015-05-28
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-04-26 19:01:04 +0000