summary refs log tree commit diff
path: root/crypto/src
diff options
context:
space:
mode:
authorPeter Dettman <peter.dettman@bouncycastle.org>2015-10-21 10:52:05 +0700
committerPeter Dettman <peter.dettman@bouncycastle.org>2015-10-21 10:52:05 +0700
commit0e67b3a7d3cc175fb8644abc839ac5a1ed29abe7 (patch)
tree7e4d8b54eaa19a4b94918420c9277387c42e2e10 /crypto/src
parentRenamed DoFinal to Value on IBlockResult. (diff)
downloadBouncyCastle.NET-ed25519-0e67b3a7d3cc175fb8644abc839ac5a1ed29abe7.tar.xz
Remove inapplicable comments in key generators
Diffstat (limited to 'crypto/src')
-rw-r--r--crypto/src/crypto/generators/ECKeyPairGenerator.cs6
-rw-r--r--crypto/src/crypto/generators/GOST3410KeyPairGenerator.cs6
2 files changed, 0 insertions, 12 deletions
diff --git a/crypto/src/crypto/generators/ECKeyPairGenerator.cs b/crypto/src/crypto/generators/ECKeyPairGenerator.cs
index d4afff750..26bc06e14 100644
--- a/crypto/src/crypto/generators/ECKeyPairGenerator.cs
+++ b/crypto/src/crypto/generators/ECKeyPairGenerator.cs
@@ -108,12 +108,6 @@ namespace Org.BouncyCastle.Crypto.Generators
                 if (d.CompareTo(BigInteger.Two) < 0 || d.CompareTo(n) >= 0)
                     continue;
 
-                /*
-                 * Require a minimum weight of the NAF representation, since low-weight primes may be
-                 * weak against a version of the number-field-sieve for the discrete-logarithm-problem.
-                 * 
-                 * See "The number field sieve for integers of low weight", Oliver Schirokauer.
-                 */
                 if (WNafUtilities.GetNafWeight(d) < minWeight)
                     continue;
 
diff --git a/crypto/src/crypto/generators/GOST3410KeyPairGenerator.cs b/crypto/src/crypto/generators/GOST3410KeyPairGenerator.cs
index 013b81810..520820bfa 100644
--- a/crypto/src/crypto/generators/GOST3410KeyPairGenerator.cs
+++ b/crypto/src/crypto/generators/GOST3410KeyPairGenerator.cs
@@ -55,12 +55,6 @@ namespace Org.BouncyCastle.Crypto.Generators
                 if (x.SignValue < 1 || x.CompareTo(q) >= 0)
                     continue;
 
-                /*
-                 * Require a minimum weight of the NAF representation, since low-weight primes may be
-                 * weak against a version of the number-field-sieve for the discrete-logarithm-problem.
-                 * 
-                 * See "The number field sieve for integers of low weight", Oliver Schirokauer.
-                 */
                 if (WNafUtilities.GetNafWeight(x) < minWeight)
                     continue;