removed http

core/src/main/java/org/bouncycastle/crypto/digests/KeccakDigest.java

@@ -6,7 +6,7 @@
 import org.bouncycastle.util.encoders.Hex;
 
 /**
- * implementation of Keccak based on following KeccakNISTInterface.c from http://keccak.noekeon.org/
+ * implementation of Keccak based on following KeccakNISTInterface.c from https://keccak.noekeon.org/
  * <p>
  * Following the naming conventions used in the C source code to enable easy review of the implementation.
  */

core/src/main/java/org/bouncycastle/crypto/digests/SHA3Digest.java

@@ -2,7 +2,7 @@
 
 
 /**
- * implementation of SHA-3 based on following KeccakNISTInterface.c from http://keccak.noekeon.org/
+ * implementation of SHA-3 based on following KeccakNISTInterface.c from https://keccak.noekeon.org/
  * <p>
  * Following the naming conventions used in the C source code to enable easy review of the implementation.
  */

core/src/main/java/org/bouncycastle/crypto/digests/SHAKEDigest.java

@@ -4,7 +4,7 @@
 
 
 /**
- * implementation of SHAKE based on following KeccakNISTInterface.c from http://keccak.noekeon.org/
+ * implementation of SHAKE based on following KeccakNISTInterface.c from https://keccak.noekeon.org/
  * <p>
  * Following the naming conventions used in the C source code to enable easy review of the implementation.
  */

core/src/main/java/org/bouncycastle/crypto/engines/GOST28147Engine.java

@@ -39,8 +39,8 @@ public class GOST28147Engine
 
     /*
      * class content S-box parameters for encrypting
-     * getting from, see: http://tools.ietf.org/id/draft-popov-cryptopro-cpalgs-01.txt
-     *                    http://tools.ietf.org/id/draft-popov-cryptopro-cpalgs-02.txt
+     * getting from, see: https://tools.ietf.org/id/draft-popov-cryptopro-cpalgs-01.txt
+     *                    https://tools.ietf.org/id/draft-popov-cryptopro-cpalgs-02.txt
      */
     private static byte[] ESbox_Test = {
          0x4,0x2,0xF,0x5,0x9,0x1,0x0,0x8,0xE,0x3,0xB,0xC,0xD,0x7,0xA,0x6,

core/src/main/java/org/bouncycastle/crypto/engines/SM4Engine.java

@@ -10,7 +10,7 @@
 /**
  * SM4 Block Cipher - SM4 is a 128 bit block cipher with a 128 bit key.
  * <p>
- *     The implementation here is based on the document <a href="http://eprint.iacr.org/2008/329.pdf">http://eprint.iacr.org/2008/329.pdf</a>
+ *     The implementation here is based on the document <a href="https://eprint.iacr.org/2008/329.pdf">https://eprint.iacr.org/2008/329.pdf</a>
  *     by Whitfield Diffie and George Ledin, which is a translation of Prof. LU Shu-wang's original standard.
  * </p>
  */

core/src/main/java/org/bouncycastle/crypto/engines/Shacal2Engine.java

@@ -13,7 +13,7 @@
  * using SHA-256-Initialization-Values as data and SHA-256-Data as key.
  * <p>
  * A description of Shacal can be found at:
- *    http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.4066
+ *    https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.4066
  * Best known cryptanalytic (Wikipedia 11.2013):
  *    Related-key rectangle attack on 44-rounds (Jiqiang Lu, Jongsung Kim).
  * Comments are related to SHA-256-Naming as described in FIPS PUB 180-2

core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/GF2nONBField.java

@@ -10,7 +10,7 @@
  * This class implements the abstract class <tt>GF2nField</tt> for ONB
  * representation. It computes the fieldpolynomial, multiplication matrix and
  * one of its roots mONBRoot, (see for example <a
- * href=http://www2.certicom.com/ecc/intro.htm>Certicoms Whitepapers</a>).
+ * href=https://www2.certicom.com/ecc/intro.htm>Certicoms Whitepapers</a>).
  * GF2nField is used by GF2nONBElement which implements the elements of this
  * field.
  *

core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/BigIntEuclidean.java

@@ -15,7 +15,7 @@ private BigIntEuclidean()
 
     /**
      * Runs the EEA on two <code>BigInteger</code>s<br>
-     * Implemented from pseudocode on <a href="http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">Wikipedia</a>.
+     * Implemented from pseudocode on <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">Wikipedia</a>.
      *
      * @param a
      * @param b
@@ -51,4 +51,4 @@ public static BigIntEuclidean calculate(BigInteger a, BigInteger b)
         result.gcd = a;
         return result;
     }
-}
+}

core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/IntEuclidean.java

@@ -13,7 +13,7 @@ private IntEuclidean()
 
     /**
      * Runs the EEA on two <code>int</code>s<br>
-     * Implemented from pseudocode on <a href="http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">Wikipedia</a>.
+     * Implemented from pseudocode on <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">Wikipedia</a>.
      *
      * @param a
      * @param b
@@ -48,4 +48,4 @@ public static IntEuclidean calculate(int a, int b)
         result.gcd = a;
         return result;
     }
-}
+}

core/src/main/java/org/bouncycastle/pqc/math/ntru/polynomial/IntegerPolynomial.java

@@ -684,7 +684,7 @@ public Resultant resultantMultiThread()
         int N = coeffs.length;
 
         // upper bound for resultant(f, g) = ||f, 2||^deg(g) * ||g, 2||^deg(f) = squaresum(f)^(N/2) * 2^(deg(f)/2) because g(x)=x^N-1
-        // see http://jondalon.mathematik.uni-osnabrueck.de/staff/phpages/brunsw/CompAlg.pdf chapter 3
+        // see https://jondalon.mathematik.uni-osnabrueck.de/staff/phpages/brunsw/CompAlg.pdf chapter 3
         BigInteger max = squareSum().pow((N + 1) / 2);
         max = max.multiply(BigInteger.valueOf(2).pow((degree() + 1) / 2));
         BigInteger max2 = max.multiply(BigInteger.valueOf(2));

core/src/main/java/org/bouncycastle/pqc/math/ntru/util/ArrayEncoder.java

@@ -13,7 +13,7 @@ public class ArrayEncoder
 {
     /**
      * Bit string to coefficient conversion table from P1363.1. Also found at
-     * {@link http://stackoverflow.com/questions/1562548/how-to-make-a-message-into-a-polynomial}
+     * {@link https://stackoverflow.com/questions/1562548/how-to-make-a-message-into-a-polynomial}
      * <p>
      * Convert each three-bit quantity to two ternary coefficients as follows, and concatenate the resulting
      * ternary quantities to obtain [the output].
@@ -34,7 +34,7 @@ public class ArrayEncoder
     private static final int[] COEFF2_TABLE = {0, 1, -1, 0, 1, -1, 0, 1};
     /**
      * Coefficient to bit string conversion table from P1363.1. Also found at
-     * {@link http://stackoverflow.com/questions/1562548/how-to-make-a-message-into-a-polynomial}
+     * {@link https://stackoverflow.com/questions/1562548/how-to-make-a-message-into-a-polynomial}
      * <p>
      * Convert each set of two ternary coefficients to three bits as follows, and concatenate the resulting bit
      * quantities to obtain [the output]:
@@ -291,4 +291,4 @@ private static int getBit(byte[] arr, int bitIndex)
         int arrElem = arr[byteIndex] & 0xFF;
         return (arrElem >> (bitIndex % 8)) & 1;
     }
-}
+}

core/src/test/java/org/bouncycastle/crypto/test/SM4Test.java

@@ -12,7 +12,7 @@
 import org.bouncycastle.util.test.SimpleTest;
 
 /**
- * SM4 tester, vectors from <a href="http://eprint.iacr.org/2008/329.pdf">http://eprint.iacr.org/2008/329.pdf</a>
+ * SM4 tester, vectors from <a href="https://eprint.iacr.org/2008/329.pdf">http://eprint.iacr.org/2008/329.pdf</a>
  */
 public class SM4Test
     extends CipherTest

core/src/test/java/org/bouncycastle/crypto/test/speedy/Poly1305Reference.java

@@ -16,7 +16,7 @@
  * consisting of a 128 bit key applied to an underlying cipher, and a 128 bit key (with 106
  * effective key bits) used in the authenticator.
  * <p>
- * This implementation is adapted from the public domain <a href="http://nacl.cr.yp.to/">nacl</a>
+ * This implementation is adapted from the public domain <a href="https://nacl.cr.yp.to/">nacl</a>
  * <code>ref</code> implementation, and is probably too slow for real usage.
  * 
  * @see Poly1305KeyGenerator

jce/src/main/java/javax/crypto/Cipher.java

@@ -409,7 +409,7 @@ public final ExemptionMechanism getExemptionMechanism()
      * <p>
      * If this cipher (including its underlying feedback or padding scheme)
      * requires any random bytes (e.g., for parameter generation), it will get
-     * them using the <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * them using the <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority
      * installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of
@@ -511,7 +511,7 @@ public final void init(
      * If this cipher (including its underlying feedback or padding scheme)
      * requires any random bytes (e.g., for parameter generation), it will get
      * them using the
-     * <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority
      * installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of
@@ -626,7 +626,7 @@ public final void init(
      * If this cipher (including its underlying feedback or padding scheme)
      * requires any random bytes (e.g., for parameter generation), it will get
      * them using the
-     * <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority
      * installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of
@@ -752,7 +752,7 @@ public final void init(
      * If this cipher (including its underlying feedback or padding scheme)
      * requires any random bytes (e.g., for parameter generation), it will get
      * them using the
-     * <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a>
      * implementation of the highest-priority installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of

jce/src/main/java/javax/crypto/KeyAgreement.java

@@ -193,7 +193,7 @@ public final Provider getProvider()
      * contain all the algorithm parameters required for this key agreement.
      * <p>
      * If this key agreement requires any random bytes, it will get
-     * them using the <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * them using the <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority
      * installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of
@@ -245,7 +245,7 @@ public final void init(
      * algorithm parameters.
      * <p>
      * If this key agreement requires any random bytes, it will get
-     * them using the <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * them using the <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority
      * installed provider as the source of randomness.
      * (If none of the installed providers supply an implementation of

jce/src/main/java/javax/crypto/KeyGenerator.java

@@ -226,7 +226,7 @@ public final void init(
      * Initializes this key generator with the specified parameter set.
      * <p>
      * If this key generator requires any random bytes, it will get them
-     * using the * <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * using the * <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority installed
      * provider as the source of randomness.
      * (If none of the installed providers supply an implementation of
@@ -262,7 +262,7 @@ public final void init(
      * Initializes this key generator for a certain keysize.
      * <p>
      * If this key generator requires any random bytes, it will get them using the
-     * <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
+     * <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.SecureRandom.html">
      * <code>SecureRandom</code></a> implementation of the highest-priority installed provider as
      * the source of randomness. (If none of the installed providers supply an implementation of
      * SecureRandom, a system-provided source of randomness will be used.)

jce/src/main/java/javax/crypto/spec/DHGenParameterSpec.java

@@ -20,7 +20,7 @@ public class DHGenParameterSpec
     /**
      * Constructs a parameter set for the generation of Diffie-Hellman
      * (system) parameters. The constructed parameter set can be used to
-     * initialize an <a href="http://java.sun.com/products/jdk/1.2/docs/api/java.security.AlgorithmParameterGenerator.html"><code>AlgorithmParameterGenerator</code></a>
+     * initialize an <a href="https://java.sun.com/products/jdk/1.2/docs/api/java.security.AlgorithmParameterGenerator.html"><code>AlgorithmParameterGenerator</code></a>
      * object for the generation of Diffie-Hellman parameters.
      *
      * @param primeSize the size (in bits) of the prime modulus.

prov/src/main/java/org/bouncycastle/x509/util/LDAPStoreHelper.java

@@ -58,7 +58,7 @@
  * <ul>
  * <li><a href="https://www.ietf.org/rfc/rfc2587.txt">RFC 2587</a>
  * <li><a
- * href="http://www3.ietf.org/proceedings/01mar/I-D/pkix-ldap-schema-01.txt">Internet
+ * href="https://www3.ietf.org/proceedings/01mar/I-D/pkix-ldap-schema-01.txt">Internet
  * X.509 Public Key Infrastructure Additional LDAP Schema for PKIs and PMIs</a>
  * </ul>
  */

prov/src/main/jdk1.4/org/bouncycastle/x509/util/LDAPStoreHelper.java

@@ -58,7 +58,7 @@
  * <ul>
  * <li><a href="https://www.ietf.org/rfc/rfc2587.txt">RFC 2587</a>
  * <li><a
- * href="http://www3.ietf.org/proceedings/01mar/I-D/pkix-ldap-schema-01.txt">Internet
+ * href="https://www3.ietf.org/proceedings/01mar/I-D/pkix-ldap-schema-01.txt">Internet
  * X.509 Public Key Infrastructure Additional LDAP Schema for PKIs and PMIs</a>
  * </ul>
  * </p>