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/ec_gfp | |
| parent | 00d6b7c01429682b4f12d007ad5ce20e8492afda (diff) | |
Convert http:// links to https:// where possible
Diffstat (limited to 'src/lib/math/ec_gfp')
| -rw-r--r-- | src/lib/math/ec_gfp/point_gfp.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/lib/math/ec_gfp/point_gfp.cpp b/src/lib/math/ec_gfp/point_gfp.cpp index c549823aa..0b615b88b 100644 --- a/src/lib/math/ec_gfp/point_gfp.cpp +++ b/src/lib/math/ec_gfp/point_gfp.cpp @@ -86,7 +86,7 @@ void PointGFp::add(const PointGFp& rhs, std::vector<BigInt>& ws_bn) BigInt& r = ws_bn[7]; /* - http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 + https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 */ curve_sqr(rhs_z2, rhs.m_coord_z); @@ -158,7 +158,7 @@ void PointGFp::mult2(std::vector<BigInt>& ws_bn) } /* - http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc + https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc */ const BigInt& p = m_curve.get_p(); @@ -359,7 +359,7 @@ PointGFp Blinded_Point_Multiply::blinded_multiply(const BigInt& scalar_in, /* Algorithm 7 from "Randomizing the Montgomery Powering Ladder" Duc-Phong Le, Chik How Tan and Michael Tunstall - http://eprint.iacr.org/2015/657 + https://eprint.iacr.org/2015/657 It takes a random walk through (a subset of) the set of addition chains that end in k. |