boringssl/crypto/rsa
Brian Smith 7fcbfdbdf3 Calculate inverse in |BN_MONT_CTX_set| in constant time w.r.t. modulus.
Simplify the calculation of the Montgomery constants in
|BN_MONT_CTX_set|, making the inversion constant-time. It should also
be faster by avoiding any use of the |BIGNUM| API in favor of using
only 64-bit arithmetic.

Now it's obvious how it works. /s

Change-Id: I59a1e1c3631f426fbeabd0c752e0de44bcb5fd75
Reviewed-on: https://boringssl-review.googlesource.com/9031
Reviewed-by: Adam Langley <agl@google.com>
Commit-Queue: Adam Langley <agl@google.com>
CQ-Verified: CQ bot account: commit-bot@chromium.org <commit-bot@chromium.org>
2016-08-02 16:26:44 +00:00
..
blinding.c Add |BN_mod_inverse_blinded| and use it in RSA blinding. 2016-07-29 18:30:34 +00:00
CMakeLists.txt Add a run_tests target to run all tests. 2015-10-26 20:33:44 +00:00
internal.h Require the public exponent to be available in RSA blinding. 2016-04-18 23:34:46 +00:00
padding.c Make local functions static. 2016-03-20 16:37:58 +00:00
rsa_asn1.c RSA_marshal_private_key: add missing CBB_flush() 2016-07-13 03:49:41 +00:00
rsa_impl.c Calculate inverse in |BN_MONT_CTX_set| in constant time w.r.t. modulus. 2016-08-02 16:26:44 +00:00
rsa_test.cc Revert "Move C++ helpers into |bssl| namespace." 2016-07-12 08:09:33 -07:00
rsa.c Avoid one |BN_mod_inverse| in |RSA_check_key|. 2016-07-27 17:19:11 +00:00