1 files changed, 0 insertions, 186 deletions
diff --git a/libraries/spongycastle/core/src/main/java/org/spongycastle/crypto/signers/ECDSASigner.java b/libraries/spongycastle/core/src/main/java/org/spongycastle/crypto/signers/ECDSASigner.java
deleted file mode 100644
index bf2344c73..000000000
--- a/libraries/spongycastle/core/src/main/java/org/spongycastle/crypto/signers/ECDSASigner.java
+++ /dev/null
@@ -1,186 +0,0 @@
-package org.spongycastle.crypto.signers;
-
-import java.math.BigInteger;
-import java.security.SecureRandom;
-
-import org.spongycastle.crypto.CipherParameters;
-import org.spongycastle.crypto.DSA;
-import org.spongycastle.crypto.params.ECKeyParameters;
-import org.spongycastle.crypto.params.ECPrivateKeyParameters;
-import org.spongycastle.crypto.params.ECPublicKeyParameters;
-import org.spongycastle.crypto.params.ParametersWithRandom;
-import org.spongycastle.math.ec.ECAlgorithms;
-import org.spongycastle.math.ec.ECConstants;
-import org.spongycastle.math.ec.ECPoint;
-
-/**
- * EC-DSA as described in X9.62
- */
-public class ECDSASigner
-    implements ECConstants, DSA
-{
-    private final DSAKCalculator kCalculator;
-
-    private ECKeyParameters key;
-    private SecureRandom    random;
-
-    /**
-     * Default configuration, random K values.
-     */
-    public ECDSASigner()
-    {
-        this.kCalculator = new RandomDSAKCalculator();
-    }
-
-    /**
-     * Configuration with an alternate, possibly deterministic calculator of K.
-     *
-     * @param kCalculator a K value calculator.
-     */
-    public ECDSASigner(DSAKCalculator kCalculator)
-    {
-        this.kCalculator = kCalculator;
-    }
-
-    public void init(
-        boolean                 forSigning,
-        CipherParameters        param)
-    {
-        if (forSigning)
-        {
-            if (param instanceof ParametersWithRandom)
-            {
-                ParametersWithRandom    rParam = (ParametersWithRandom)param;
-
-                this.random = rParam.getRandom();
-                this.key = (ECPrivateKeyParameters)rParam.getParameters();
-            }
-            else
-            {
-                this.random = new SecureRandom();
-                this.key = (ECPrivateKeyParameters)param;
-            }
-        }
-        else
-        {
-            this.key = (ECPublicKeyParameters)param;
-        }
-    }
-
-    // 5.3 pg 28
-    /**
-     * generate a signature for the given message using the key we were
-     * initialised with. For conventional DSA the message should be a SHA-1
-     * hash of the message of interest.
-     *
-     * @param message the message that will be verified later.
-     */
-    public BigInteger[] generateSignature(
-        byte[] message)
-    {
-        BigInteger n = key.getParameters().getN();
-        BigInteger e = calculateE(n, message);
-        BigInteger r = null;
-        BigInteger s = null;
-
-        if (kCalculator.isDeterministic())
-        {
-            kCalculator.init(n, ((ECPrivateKeyParameters)key).getD(), message);
-        }
-        else
-        {
-            kCalculator.init(n, random);
-        }
-
-        // 5.3.2
-        do // generate s
-        {
-            BigInteger k = null;
-
-            do // generate r
-            {
-                k = kCalculator.nextK();
-
-                ECPoint p = key.getParameters().getG().multiply(k).normalize();
-
-                // 5.3.3
-                BigInteger x = p.getAffineXCoord().toBigInteger();
-
-                r = x.mod(n);
-            }
-            while (r.equals(ZERO));
-
-            BigInteger d = ((ECPrivateKeyParameters)key).getD();
-
-            s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n);
-        }
-        while (s.equals(ZERO));
-
-        BigInteger[]  res = new BigInteger[2];
-
-        res[0] = r;
-        res[1] = s;
-
-        return res;
-    }
-
-    // 5.4 pg 29
-    /**
-     * return true if the value r and s represent a DSA signature for
-     * the passed in message (for standard DSA the message should be
-     * a SHA-1 hash of the real message to be verified).
-     */
-    public boolean verifySignature(
-        byte[]      message,
-        BigInteger  r,
-        BigInteger  s)
-    {
-        BigInteger n = key.getParameters().getN();
-        BigInteger e = calculateE(n, message);
-
-        // r in the range [1,n-1]
-        if (r.compareTo(ONE) < 0 || r.compareTo(n) >= 0)
-        {
-            return false;
-        }
-
-        // s in the range [1,n-1]
-        if (s.compareTo(ONE) < 0 || s.compareTo(n) >= 0)
-        {
-            return false;
-        }
-
-        BigInteger c = s.modInverse(n);
-
-        BigInteger u1 = e.multiply(c).mod(n);
-        BigInteger u2 = r.multiply(c).mod(n);
-
-        ECPoint G = key.getParameters().getG();
-        ECPoint Q = ((ECPublicKeyParameters)key).getQ();
-
-        ECPoint point = ECAlgorithms.sumOfTwoMultiplies(G, u1, Q, u2).normalize();
-
-        // components must be bogus.
-        if (point.isInfinity())
-        {
-            return false;
-        }
-
-        BigInteger v = point.getAffineXCoord().toBigInteger().mod(n);
-
-        return v.equals(r);
-    }
-
-    private BigInteger calculateE(BigInteger n, byte[] message)
-    {
-        int log2n = n.bitLength();
-        int messageBitLength = message.length * 8;
-
-        BigInteger e = new BigInteger(1, message);
-        if (log2n < messageBitLength)
-        {
-            e = e.shiftRight(messageBitLength - log2n);
-        }
-        return e;
-    }
-}