Use Ed25519ScalarOps instead of BigIntegerScalarOps

Before:
0.534 each sign, 2.3272 each verify, 2.8612 s+v
After:
0.5888 each sign, 2.3566 each verify, 2.9454 s+v

Sign uses reduce() twice, verify uses it once. Therefore the ref10 version is
about 28us slower than the BigInteger version. Basically negligible, so the
important factor to determine is whether the BigInteger operations used are
constant time. If we can't get the ref10 version to be constant time, we may as
well use the BigInteger version.

Author: str4d

src/net/i2p/crypto/eddsa/spec/EdDSANamedCurveTable.java

@@ -1,13 +1,12 @@
 package net.i2p.crypto.eddsa.spec;
 
-import java.math.BigInteger;
 import java.util.Hashtable;
 
 import net.i2p.crypto.eddsa.Utils;
 import net.i2p.crypto.eddsa.math.Curve;
 import net.i2p.crypto.eddsa.math.Field;
 import net.i2p.crypto.eddsa.math.bigint.BigIntegerLittleEndianEncoding;
-import net.i2p.crypto.eddsa.math.bigint.BigIntegerScalarOps;
+import net.i2p.crypto.eddsa.math.ed25519.Ed25519ScalarOps;
 
 /**
  * The named EdDSA curves.
@@ -29,8 +28,7 @@ public class EdDSANamedCurveTable {
             CURVE_ED25519_SHA512,
             ed25519curve,
             "SHA-512", // H
-            new BigIntegerScalarOps(ed25519field,
-                    new BigInteger("7237005577332262213973186563042994240857116359379907606001950938285454250989")), // l
+            new Ed25519ScalarOps(), // l
             ed25519curve.createPoint( // B
                     Utils.hexToBytes("5866666666666666666666666666666666666666666666666666666666666666"),
                     true)); // Precompute tables for B