Merge pull request #4045

7cdd147 Changed URLs to HTTPS (einsteinsfool)

1 files changed, 9 insertions, 9 deletions

diff --git a/src/ringct/rctSigs.cpp b/src/ringct/rctSigs.cpp
index cc6fbe738..f74216ed4 100644
--- a/src/ringct/rctSigs.cpp
+++ b/src/ringct/rctSigs.cpp
@@ -147,7 +147,7 @@ namespace rct {
     //This is a just slghtly more efficient version than the ones described below
     //(will be explained in more detail in Ring Multisig paper
     //These are aka MG signatutes in earlier drafts of the ring ct paper
-    // c.f. http://eprint.iacr.org/2015/1098 section 2. 
+    // c.f. https://eprint.iacr.org/2015/1098 section 2. 
     // Gen creates a signature which proves that for some column in the keymatrix "pk"
     //   the signer knows a secret key for each row in that column
     // Ver verifies that the MG sig was created correctly        
@@ -244,7 +244,7 @@ namespace rct {
     //This is a just slghtly more efficient version than the ones described below
     //(will be explained in more detail in Ring Multisig paper
     //These are aka MG signatutes in earlier drafts of the ring ct paper
-    // c.f. http://eprint.iacr.org/2015/1098 section 2. 
+    // c.f. https://eprint.iacr.org/2015/1098 section 2. 
     // Gen creates a signature which proves that for some column in the keymatrix "pk"
     //   the signer knows a secret key for each row in that column
     // Ver verifies that the MG sig was created correctly            
@@ -307,7 +307,7 @@ namespace rct {
 
     //proveRange and verRange
     //proveRange gives C, and mask such that \sumCi = C
-    //   c.f. http://eprint.iacr.org/2015/1098 section 5.1
+    //   c.f. https://eprint.iacr.org/2015/1098 section 5.1
     //   and Ci is a commitment to either 0 or 2^i, i=0,...,63
     //   thus this proves that "amount" is in [0, 2^64]
     //   mask is a such that C = aG + bH, and b = amount
@@ -339,7 +339,7 @@ namespace rct {
 
     //proveRange and verRange
     //proveRange gives C, and mask such that \sumCi = C
-    //   c.f. http://eprint.iacr.org/2015/1098 section 5.1
+    //   c.f. https://eprint.iacr.org/2015/1098 section 5.1
     //   and Ci is a commitment to either 0 or 2^i, i=0,...,63
     //   thus this proves that "amount" is in [0, 2^64]
     //   mask is a such that C = aG + bH, and b = amount
@@ -441,7 +441,7 @@ namespace rct {
 
     //Ring-ct MG sigs
     //Prove: 
-    //   c.f. http://eprint.iacr.org/2015/1098 section 4. definition 10. 
+    //   c.f. https://eprint.iacr.org/2015/1098 section 4. definition 10. 
     //   This does the MG sig on the "dest" part of the given key matrix, and 
     //   the last row is the sum of input commitments from that column - sum output commitments
     //   this shows that sum inputs = sum outputs
@@ -527,7 +527,7 @@ namespace rct {
 
     //Ring-ct MG sigs
     //Prove: 
-    //   c.f. http://eprint.iacr.org/2015/1098 section 4. definition 10. 
+    //   c.f. https://eprint.iacr.org/2015/1098 section 4. definition 10. 
     //   This does the MG sig on the "dest" part of the given key matrix, and 
     //   the last row is the sum of input commitments from that column - sum output commitments
     //   this shows that sum inputs = sum outputs
@@ -650,7 +650,7 @@ namespace rct {
     //   Also contains masked "amount" and "mask" so the receiver can see how much they received
     //verRct:
     //   verifies that all signatures (rangeProogs, MG sig, sum inputs = outputs) are correct
-    //decodeRct: (c.f. http://eprint.iacr.org/2015/1098 section 5.1.1)
+    //decodeRct: (c.f. https://eprint.iacr.org/2015/1098 section 5.1.1)
     //   uses the attached ecdh info to find the amounts represented by each output commitment 
     //   must know the destination private key to find the correct amount, else will return a random number
     //   Note: For txn fees, the last index in the amounts vector should contain that
@@ -828,7 +828,7 @@ namespace rct {
     //   Also contains masked "amount" and "mask" so the receiver can see how much they received
     //verRct:
     //   verifies that all signatures (rangeProogs, MG sig, sum inputs = outputs) are correct
-    //decodeRct: (c.f. http://eprint.iacr.org/2015/1098 section 5.1.1)
+    //decodeRct: (c.f. https://eprint.iacr.org/2015/1098 section 5.1.1)
     //   uses the attached ecdh info to find the amounts represented by each output commitment 
     //   must know the destination private key to find the correct amount, else will return a random number    
     bool verRct(const rctSig & rv, bool semantics) {
@@ -1023,7 +1023,7 @@ namespace rct {
     //   Also contains masked "amount" and "mask" so the receiver can see how much they received
     //verRct:
     //   verifies that all signatures (rangeProogs, MG sig, sum inputs = outputs) are correct
-    //decodeRct: (c.f. http://eprint.iacr.org/2015/1098 section 5.1.1)
+    //decodeRct: (c.f. https://eprint.iacr.org/2015/1098 section 5.1.1)
     //   uses the attached ecdh info to find the amounts represented by each output commitment 
     //   must know the destination private key to find the correct amount, else will return a random number    
     xmr_amount decodeRct(const rctSig & rv, const key & sk, unsigned int i, key & mask, hw::device &hwdev) {