diff options
author | Jack Lloyd <[email protected]> | 2017-10-24 15:48:21 -0400 |
---|---|---|
committer | Jack Lloyd <[email protected]> | 2017-10-24 15:48:21 -0400 |
commit | 4f49a6444127801335dab049f0f0b4419d8d9cc1 (patch) | |
tree | 4a7ecc596866ff0e69fc7fce2cd043c1c4fc60e4 /src/lib/math/numbertheory | |
parent | 00d6b7c01429682b4f12d007ad5ce20e8492afda (diff) |
Convert http:// links to https:// where possible
Diffstat (limited to 'src/lib/math/numbertheory')
-rw-r--r-- | src/lib/math/numbertheory/numthry.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/lib/math/numbertheory/numthry.cpp b/src/lib/math/numbertheory/numthry.cpp index 45a81daa8..12ac51953 100644 --- a/src/lib/math/numbertheory/numthry.cpp +++ b/src/lib/math/numbertheory/numthry.cpp @@ -82,7 +82,7 @@ with n <= k <= 2n Returns k "The Montgomery Modular Inverse - Revisited" Çetin Koç, E. Savas -http://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.75.8377 +https://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.75.8377 A const time implementation of this algorithm is described in "Constant Time Modular Inversion" Joppe W. Bos @@ -171,7 +171,7 @@ BigInt ct_inverse_mod_odd_modulus(const BigInt& n, const BigInt& mod) Software Polynomial Multiplication on ARM Processors using the NEON Engine" by Danilo Câmara, Conrado P. L. Gouvêa, Julio López, and Ricardo Dahab in LNCS 8182 - http://conradoplg.cryptoland.net/files/2010/12/mocrysen13.pdf + https://conradoplg.cryptoland.net/files/2010/12/mocrysen13.pdf Thanks to Niels for creating the algorithm, explaining some things about it, and the reference to the paper. |