org.bouncycastle.math.ec.custom.sec.SecP224R1Curve Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of bcprov-ext-debug-jdk15on Show documentation
Show all versions of bcprov-ext-debug-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 to JDK 1.8 with debug enabled.
package org.bouncycastle.math.ec.custom.sec;
import java.math.BigInteger;
import org.bouncycastle.math.ec.ECCurve;
import org.bouncycastle.math.ec.ECFieldElement;
import org.bouncycastle.math.ec.ECLookupTable;
import org.bouncycastle.math.ec.ECPoint;
import org.bouncycastle.math.raw.Nat224;
import org.bouncycastle.util.encoders.Hex;
public class SecP224R1Curve extends ECCurve.AbstractFp
{
public static final BigInteger q = new BigInteger(1,
Hex.decode("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001"));
private static final int SecP224R1_DEFAULT_COORDS = COORD_JACOBIAN;
protected SecP224R1Point infinity;
public SecP224R1Curve()
{
super(q);
this.infinity = new SecP224R1Point(this, null, null);
this.a = fromBigInteger(new BigInteger(1,
Hex.decode("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE")));
this.b = fromBigInteger(new BigInteger(1,
Hex.decode("B4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4")));
this.order = new BigInteger(1, Hex.decode("FFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D"));
this.cofactor = BigInteger.valueOf(1);
this.coord = SecP224R1_DEFAULT_COORDS;
}
protected ECCurve cloneCurve()
{
return new SecP224R1Curve();
}
public boolean supportsCoordinateSystem(int coord)
{
switch (coord)
{
case COORD_JACOBIAN:
return true;
default:
return false;
}
}
public BigInteger getQ()
{
return q;
}
public int getFieldSize()
{
return q.bitLength();
}
public ECFieldElement fromBigInteger(BigInteger x)
{
return new SecP224R1FieldElement(x);
}
protected ECPoint createRawPoint(ECFieldElement x, ECFieldElement y, boolean withCompression)
{
return new SecP224R1Point(this, x, y, withCompression);
}
protected ECPoint createRawPoint(ECFieldElement x, ECFieldElement y, ECFieldElement[] zs, boolean withCompression)
{
return new SecP224R1Point(this, x, y, zs, withCompression);
}
public ECPoint getInfinity()
{
return infinity;
}
public ECLookupTable createCacheSafeLookupTable(ECPoint[] points, int off, final int len)
{
final int FE_INTS = 7;
final int[] table = new int[len * FE_INTS * 2];
{
int pos = 0;
for (int i = 0; i < len; ++i)
{
ECPoint p = points[off + i];
Nat224.copy(((SecP224R1FieldElement)p.getRawXCoord()).x, 0, table, pos); pos += FE_INTS;
Nat224.copy(((SecP224R1FieldElement)p.getRawYCoord()).x, 0, table, pos); pos += FE_INTS;
}
}
return new ECLookupTable()
{
public int getSize()
{
return len;
}
public ECPoint lookup(int index)
{
int[] x = Nat224.create(), y = Nat224.create();
int pos = 0;
for (int i = 0; i < len; ++i)
{
int MASK = ((i ^ index) - 1) >> 31;
for (int j = 0; j < FE_INTS; ++j)
{
x[j] ^= table[pos + j] & MASK;
y[j] ^= table[pos + FE_INTS + j] & MASK;
}
pos += (FE_INTS * 2);
}
return createRawPoint(new SecP224R1FieldElement(x), new SecP224R1FieldElement(y), false);
}
};
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy