* Following the naming conventions used in the C source code to enable easy review of the implementation. */ diff --git a/core/src/main/java/org/bouncycastle/crypto/digests/SHA3Digest.java b/core/src/main/java/org/bouncycastle/crypto/digests/SHA3Digest.java index c70e1404cd..7e3ba3d18c 100644 --- a/core/src/main/java/org/bouncycastle/crypto/digests/SHA3Digest.java +++ b/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/ *
* Following the naming conventions used in the C source code to enable easy review of the implementation. */ diff --git a/core/src/main/java/org/bouncycastle/crypto/digests/SHAKEDigest.java b/core/src/main/java/org/bouncycastle/crypto/digests/SHAKEDigest.java index fa6643a33b..c9fde6a976 100644 --- a/core/src/main/java/org/bouncycastle/crypto/digests/SHAKEDigest.java +++ b/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/ *
* Following the naming conventions used in the C source code to enable easy review of the implementation. */ diff --git a/core/src/main/java/org/bouncycastle/crypto/engines/GOST28147Engine.java b/core/src/main/java/org/bouncycastle/crypto/engines/GOST28147Engine.java index e04673d76e..3c4b6be52b 100644 --- a/core/src/main/java/org/bouncycastle/crypto/engines/GOST28147Engine.java +++ b/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, diff --git a/core/src/main/java/org/bouncycastle/crypto/engines/SM4Engine.java b/core/src/main/java/org/bouncycastle/crypto/engines/SM4Engine.java index 033595bd52..72181e4723 100644 --- a/core/src/main/java/org/bouncycastle/crypto/engines/SM4Engine.java +++ b/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. *
- * The implementation here is based on the document http://eprint.iacr.org/2008/329.pdf + * The implementation here is based on the document https://eprint.iacr.org/2008/329.pdf * by Whitfield Diffie and George Ledin, which is a translation of Prof. LU Shu-wang's original standard. *
*/ diff --git a/core/src/main/java/org/bouncycastle/crypto/engines/Shacal2Engine.java b/core/src/main/java/org/bouncycastle/crypto/engines/Shacal2Engine.java index 62e0510677..8789c0146b 100644 --- a/core/src/main/java/org/bouncycastle/crypto/engines/Shacal2Engine.java +++ b/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. *
* 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
diff --git a/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/GF2nONBField.java b/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/GF2nONBField.java
index f91b94aeaf..61826f7003 100644
--- a/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/GF2nONBField.java
+++ b/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/GF2nONBField.java
@@ -10,7 +10,7 @@
* This class implements the abstract class GF2nField for ONB
* representation. It computes the fieldpolynomial, multiplication matrix and
* one of its roots mONBRoot, (see for example Certicoms Whitepapers).
+ * href=https://www2.certicom.com/ecc/intro.htm>Certicoms Whitepapers).
* GF2nField is used by GF2nONBElement which implements the elements of this
* field.
*
diff --git a/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/BigIntEuclidean.java b/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/BigIntEuclidean.java
index 5fb305845f..6f58d17027 100644
--- a/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/BigIntEuclidean.java
+++ b/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/BigIntEuclidean.java
@@ -15,7 +15,7 @@ private BigIntEuclidean()
/**
* Runs the EEA on two BigIntegers
- * Implemented from pseudocode on Wikipedia.
+ * Implemented from pseudocode on Wikipedia.
*
* @param a
* @param b
@@ -51,4 +51,4 @@ public static BigIntEuclidean calculate(BigInteger a, BigInteger b)
result.gcd = a;
return result;
}
-}
\ No newline at end of file
+}
diff --git a/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/IntEuclidean.java b/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/IntEuclidean.java
index c959a26d30..4bb520a2b5 100644
--- a/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/IntEuclidean.java
+++ b/core/src/main/java/org/bouncycastle/pqc/math/ntru/euclid/IntEuclidean.java
@@ -13,7 +13,7 @@ private IntEuclidean()
/**
* Runs the EEA on two ints
- * Implemented from pseudocode on Wikipedia.
+ * Implemented from pseudocode on Wikipedia.
*
* @param a
* @param b
@@ -48,4 +48,4 @@ public static IntEuclidean calculate(int a, int b)
result.gcd = a;
return result;
}
-}
\ No newline at end of file
+}
diff --git a/core/src/main/java/org/bouncycastle/pqc/math/ntru/polynomial/IntegerPolynomial.java b/core/src/main/java/org/bouncycastle/pqc/math/ntru/polynomial/IntegerPolynomial.java
index bcf8958cee..2f9564a889 100644
--- a/core/src/main/java/org/bouncycastle/pqc/math/ntru/polynomial/IntegerPolynomial.java
+++ b/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));
diff --git a/core/src/main/java/org/bouncycastle/pqc/math/ntru/util/ArrayEncoder.java b/core/src/main/java/org/bouncycastle/pqc/math/ntru/util/ArrayEncoder.java
index 017e1046cb..48ba2fea4d 100644
--- a/core/src/main/java/org/bouncycastle/pqc/math/ntru/util/ArrayEncoder.java
+++ b/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}
*
* 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} *
* 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; } -} \ No newline at end of file +} diff --git a/core/src/test/java/org/bouncycastle/crypto/test/SM4Test.java b/core/src/test/java/org/bouncycastle/crypto/test/SM4Test.java index a923573bde..651984f1a6 100644 --- a/core/src/test/java/org/bouncycastle/crypto/test/SM4Test.java +++ b/core/src/test/java/org/bouncycastle/crypto/test/SM4Test.java @@ -12,7 +12,7 @@ import org.bouncycastle.util.test.SimpleTest; /** - * SM4 tester, vectors from http://eprint.iacr.org/2008/329.pdf + * SM4 tester, vectors from http://eprint.iacr.org/2008/329.pdf */ public class SM4Test extends CipherTest diff --git a/core/src/test/java/org/bouncycastle/crypto/test/speedy/Poly1305Reference.java b/core/src/test/java/org/bouncycastle/crypto/test/speedy/Poly1305Reference.java index 4efe769b5f..fdbe160e59 100644 --- a/core/src/test/java/org/bouncycastle/crypto/test/speedy/Poly1305Reference.java +++ b/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. *
- * This implementation is adapted from the public domain nacl
+ * This implementation is adapted from the public domain nacl
* ref implementation, and is probably too slow for real usage.
*
* @see Poly1305KeyGenerator
diff --git a/jce/src/main/java/javax/crypto/Cipher.java b/jce/src/main/java/javax/crypto/Cipher.java
index bf9fd37430..bbd44f6d4a 100644
--- a/jce/src/main/java/javax/crypto/Cipher.java
+++ b/jce/src/main/java/javax/crypto/Cipher.java
@@ -409,7 +409,7 @@ public final ExemptionMechanism getExemptionMechanism()
*
* 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
+ * them using the
* SecureRandom 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
- *
+ *
* SecureRandom 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
- *
+ *
* SecureRandom 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
- *
+ *
* SecureRandom
* implementation of the highest-priority installed provider as the source of randomness.
* (If none of the installed providers supply an implementation of
diff --git a/jce/src/main/java/javax/crypto/KeyAgreement.java b/jce/src/main/java/javax/crypto/KeyAgreement.java
index 6e8d768bdf..a4d190623c 100644
--- a/jce/src/main/java/javax/crypto/KeyAgreement.java
+++ b/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.
*
* If this key agreement requires any random bytes, it will get
- * them using the
+ * them using the
* SecureRandom 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.
*
* If this key agreement requires any random bytes, it will get
- * them using the
+ * them using the
* SecureRandom implementation of the highest-priority
* installed provider as the source of randomness.
* (If none of the installed providers supply an implementation of
diff --git a/jce/src/main/java/javax/crypto/KeyGenerator.java b/jce/src/main/java/javax/crypto/KeyGenerator.java
index 19a34cedd3..7f4f7b6585 100644
--- a/jce/src/main/java/javax/crypto/KeyGenerator.java
+++ b/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.
*
* If this key generator requires any random bytes, it will get them
- * using the *
+ * using the *
* SecureRandom 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.
*
* If this key generator requires any random bytes, it will get them using the
- *
+ *
* SecureRandom 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.)
diff --git a/jce/src/main/java/javax/crypto/spec/DHGenParameterSpec.java b/jce/src/main/java/javax/crypto/spec/DHGenParameterSpec.java
index 56645d1356..52c0b55b5e 100644
--- a/jce/src/main/java/javax/crypto/spec/DHGenParameterSpec.java
+++ b/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 AlgorithmParameterGenerator
+ * initialize an AlgorithmParameterGenerator
* object for the generation of Diffie-Hellman parameters.
*
* @param primeSize the size (in bits) of the prime modulus.
diff --git a/prov/src/main/java/org/bouncycastle/x509/util/LDAPStoreHelper.java b/prov/src/main/java/org/bouncycastle/x509/util/LDAPStoreHelper.java
index 7ee660fcb4..9392bd2eb7 100644
--- a/prov/src/main/java/org/bouncycastle/x509/util/LDAPStoreHelper.java
+++ b/prov/src/main/java/org/bouncycastle/x509/util/LDAPStoreHelper.java
@@ -58,7 +58,7 @@
*