org.bouncycastle.crypto.params.ECDomainParameters Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of bcprov-jdk15on Show documentation
Show all versions of bcprov-jdk15on Show documentation
The Bouncy Castle Crypto package is a Java implementation of cryptographic algorithms. This jar contains JCE provider and lightweight API for the Bouncy Castle Cryptography APIs for JDK 1.5 and up.
The newest version!
package org.bouncycastle.crypto.params;
import java.math.BigInteger;
import org.bouncycastle.asn1.x9.X9ECParameters;
import org.bouncycastle.math.ec.ECAlgorithms;
import org.bouncycastle.math.ec.ECConstants;
import org.bouncycastle.math.ec.ECCurve;
import org.bouncycastle.math.ec.ECPoint;
import org.bouncycastle.util.Arrays;
import org.bouncycastle.util.BigIntegers;
public class ECDomainParameters
implements ECConstants
{
private final ECCurve curve;
private final byte[] seed;
private final ECPoint G;
private final BigInteger n;
private final BigInteger h;
private BigInteger hInv = null;
public ECDomainParameters(X9ECParameters x9)
{
this(x9.getCurve(), x9.getG(), x9.getN(), x9.getH(), x9.getSeed());
}
public ECDomainParameters(
ECCurve curve,
ECPoint G,
BigInteger n)
{
this(curve, G, n, ONE, null);
}
public ECDomainParameters(
ECCurve curve,
ECPoint G,
BigInteger n,
BigInteger h)
{
this(curve, G, n, h, null);
}
public ECDomainParameters(
ECCurve curve,
ECPoint G,
BigInteger n,
BigInteger h,
byte[] seed)
{
if (curve == null)
{
throw new NullPointerException("curve");
}
if (n == null)
{
throw new NullPointerException("n");
}
// we can't check for h == null here as h is optional in X9.62 as it is not required for ECDSA
this.curve = curve;
this.G = validatePublicPoint(curve, G);
this.n = n;
this.h = h;
this.seed = Arrays.clone(seed);
}
public ECCurve getCurve()
{
return curve;
}
public ECPoint getG()
{
return G;
}
public BigInteger getN()
{
return n;
}
public BigInteger getH()
{
return h;
}
public synchronized BigInteger getHInv()
{
if (hInv == null)
{
hInv = BigIntegers.modOddInverseVar(n, h);
}
return hInv;
}
public byte[] getSeed()
{
return Arrays.clone(seed);
}
public boolean equals(
Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof ECDomainParameters))
{
return false;
}
ECDomainParameters other = (ECDomainParameters)obj;
return this.curve.equals(other.curve)
&& this.G.equals(other.G)
&& this.n.equals(other.n);
}
public int hashCode()
{
// return Arrays.hashCode(new Object[]{ curve, G, n });
int hc = 4;
hc *= 257;
hc ^= curve.hashCode();
hc *= 257;
hc ^= G.hashCode();
hc *= 257;
hc ^= n.hashCode();
return hc;
}
public BigInteger validatePrivateScalar(BigInteger d)
{
if (null == d)
{
throw new NullPointerException("Scalar cannot be null");
}
if (d.compareTo(ECConstants.ONE) < 0 || (d.compareTo(getN()) >= 0))
{
throw new IllegalArgumentException("Scalar is not in the interval [1, n - 1]");
}
return d;
}
public ECPoint validatePublicPoint(ECPoint q)
{
return validatePublicPoint(getCurve(), q);
}
static ECPoint validatePublicPoint(ECCurve c, ECPoint q)
{
if (null == q)
{
throw new NullPointerException("Point cannot be null");
}
q = ECAlgorithms.importPoint(c, q).normalize();
if (q.isInfinity())
{
throw new IllegalArgumentException("Point at infinity");
}
if (!q.isValid())
{
throw new IllegalArgumentException("Point not on curve");
}
return q;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy