org.bouncycastle.math.ec.custom.sec.SecT163R2Curve 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.ECCurve.AbstractF2m;
import org.bouncycastle.math.raw.Nat192;
import org.bouncycastle.math.ec.ECFieldElement;
import org.bouncycastle.math.ec.ECLookupTable;
import org.bouncycastle.math.ec.ECPoint;
import org.bouncycastle.util.encoders.Hex;
public class SecT163R2Curve extends AbstractF2m
{
private static final int SecT163R2_DEFAULT_COORDS = COORD_LAMBDA_PROJECTIVE;
protected SecT163R2Point infinity;
public SecT163R2Curve()
{
super(163, 3, 6, 7);
this.infinity = new SecT163R2Point(this, null, null);
this.a = fromBigInteger(BigInteger.valueOf(1));
this.b = fromBigInteger(new BigInteger(1, Hex.decode("020A601907B8C953CA1481EB10512F78744A3205FD")));
this.order = new BigInteger(1, Hex.decode("040000000000000000000292FE77E70C12A4234C33"));
this.cofactor = BigInteger.valueOf(2);
this.coord = SecT163R2_DEFAULT_COORDS;
}
protected ECCurve cloneCurve()
{
return new SecT163R2Curve();
}
public boolean supportsCoordinateSystem(int coord)
{
switch (coord)
{
case COORD_LAMBDA_PROJECTIVE:
return true;
default:
return false;
}
}
public int getFieldSize()
{
return 163;
}
public ECFieldElement fromBigInteger(BigInteger x)
{
return new SecT163FieldElement(x);
}
protected ECPoint createRawPoint(ECFieldElement x, ECFieldElement y, boolean withCompression)
{
return new SecT163R2Point(this, x, y, withCompression);
}
protected ECPoint createRawPoint(ECFieldElement x, ECFieldElement y, ECFieldElement[] zs, boolean withCompression)
{
return new SecT163R2Point(this, x, y, zs, withCompression);
}
public ECPoint getInfinity()
{
return infinity;
}
public boolean isKoblitz()
{
return false;
}
public int getM()
{
return 163;
}
public boolean isTrinomial()
{
return false;
}
public int getK1()
{
return 3;
}
public int getK2()
{
return 6;
}
public int getK3()
{
return 7;
}
public ECLookupTable createCacheSafeLookupTable(ECPoint[] points, int off, final int len)
{
final int FE_LONGS = 3;
final long[] table = new long[len * FE_LONGS * 2];
{
int pos = 0;
for (int i = 0; i < len; ++i)
{
ECPoint p = points[off + i];
Nat192.copy64(((SecT163FieldElement)p.getRawXCoord()).x, 0, table, pos); pos += FE_LONGS;
Nat192.copy64(((SecT163FieldElement)p.getRawYCoord()).x, 0, table, pos); pos += FE_LONGS;
}
}
return new ECLookupTable()
{
public int getSize()
{
return len;
}
public ECPoint lookup(int index)
{
long[] x = Nat192.create64(), y = Nat192.create64();
int pos = 0;
for (int i = 0; i < len; ++i)
{
long MASK = ((i ^ index) - 1) >> 31;
for (int j = 0; j < FE_LONGS; ++j)
{
x[j] ^= table[pos + j] & MASK;
y[j] ^= table[pos + FE_LONGS + j] & MASK;
}
pos += (FE_LONGS * 2);
}
return createRawPoint(new SecT163FieldElement(x), new SecT163FieldElement(y), false);
}
};
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy