summary refs log tree commit diff
diff options
context:
space:
mode:
authorDavid Hook <dgh@bouncycastle.org>2015-10-21 22:05:17 +1100
committerDavid Hook <dgh@bouncycastle.org>2015-10-21 22:05:17 +1100
commit0e473a136087518835e2378ae11de26341c65342 (patch)
treef5ac657726a46d97ede3d2acc3d0732130dcbd5b
parentAdded missed files on IBlockResult change (diff)
parentRemove inapplicable comments in key generators (diff)
downloadBouncyCastle.NET-ed25519-0e473a136087518835e2378ae11de26341c65342.tar.xz
Merge branch 'master' of bcgit@git.bouncycastle.org:bc-csharp.git
-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;