299 lines
9.1 KiB
Java
299 lines
9.1 KiB
Java
|
package org.bouncycastle.pqc.math.linearalgebra;
|
||
|
|
|
||
|
|
import java.security.SecureRandom;
|
||
|
|
|
||
|
|
/* loaded from: classes6.dex */
|
||
|
|
public class GF2Vector extends Vector {
|
||
|
|
private int[] v;
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public String toString() {
|
||
|
|
StringBuffer stringBuffer = new StringBuffer();
|
||
|
|
for (int i = 0; i < this.length; i++) {
|
||
|
|
if (i != 0 && (i & 31) == 0) {
|
||
|
|
stringBuffer.append(' ');
|
||
|
|
}
|
||
|
|
stringBuffer.append((this.v[i >> 5] & (1 << (i & 31))) == 0 ? '0' : '1');
|
||
|
|
}
|
||
|
|
return stringBuffer.toString();
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2mVector toExtensionFieldVector(GF2mField gF2mField) {
|
||
|
|
int degree = gF2mField.getDegree();
|
||
|
|
if (this.length % degree != 0) {
|
||
|
|
throw new ArithmeticException("conversion is impossible");
|
||
|
|
}
|
||
|
|
int i = this.length / degree;
|
||
|
|
int[] iArr = new int[i];
|
||
|
|
int i2 = 0;
|
||
|
|
for (int i3 = i - 1; i3 >= 0; i3--) {
|
||
|
|
for (int degree2 = gF2mField.getDegree() - 1; degree2 >= 0; degree2--) {
|
||
|
|
if (((this.v[i2 >>> 5] >>> (i2 & 31)) & 1) == 1) {
|
||
|
|
iArr[i3] = iArr[i3] ^ (1 << degree2);
|
||
|
|
}
|
||
|
|
i2++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return new GF2mVector(gF2mField, iArr);
|
||
|
|
}
|
||
|
|
|
||
|
|
public void setBit(int i) {
|
||
|
|
if (i >= this.length) {
|
||
|
|
throw new IndexOutOfBoundsException();
|
||
|
|
}
|
||
|
|
int[] iArr = this.v;
|
||
|
|
int i2 = i >> 5;
|
||
|
|
iArr[i2] = (1 << (i & 31)) | iArr[i2];
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public Vector multiply(Permutation permutation) {
|
||
|
|
int[] vector = permutation.getVector();
|
||
|
|
if (this.length != vector.length) {
|
||
|
|
throw new ArithmeticException("length mismatch");
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = new GF2Vector(this.length);
|
||
|
|
for (int i = 0; i < vector.length; i++) {
|
||
|
|
int[] iArr = this.v;
|
||
|
|
int i2 = vector[i];
|
||
|
|
if ((iArr[i2 >> 5] & (1 << (i2 & 31))) != 0) {
|
||
|
|
int[] iArr2 = gF2Vector.v;
|
||
|
|
int i3 = i >> 5;
|
||
|
|
iArr2[i3] = (1 << (i & 31)) | iArr2[i3];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return gF2Vector;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public boolean isZero() {
|
||
|
|
for (int length = this.v.length - 1; length >= 0; length--) {
|
||
|
|
if (this.v[length] != 0) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public int hashCode() {
|
||
|
|
return (this.length * 31) + this.v.hashCode();
|
||
|
|
}
|
||
|
|
|
||
|
|
public int[] getVecArray() {
|
||
|
|
return this.v;
|
||
|
|
}
|
||
|
|
|
||
|
|
public int getHammingWeight() {
|
||
|
|
int i = 0;
|
||
|
|
int i2 = 0;
|
||
|
|
while (true) {
|
||
|
|
int[] iArr = this.v;
|
||
|
|
if (i >= iArr.length) {
|
||
|
|
return i2;
|
||
|
|
}
|
||
|
|
int i3 = iArr[i];
|
||
|
|
for (int i4 = 0; i4 < 32; i4++) {
|
||
|
|
if ((i3 & 1) != 0) {
|
||
|
|
i2++;
|
||
|
|
}
|
||
|
|
i3 >>>= 1;
|
||
|
|
}
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public byte[] getEncoded() {
|
||
|
|
return LittleEndianConversions.toByteArray(this.v, (this.length + 7) >> 3);
|
||
|
|
}
|
||
|
|
|
||
|
|
public int getBit(int i) {
|
||
|
|
if (i >= this.length) {
|
||
|
|
throw new IndexOutOfBoundsException();
|
||
|
|
}
|
||
|
|
int i2 = i & 31;
|
||
|
|
return (this.v[i >> 5] & (1 << i2)) >>> i2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector extractVector(int[] iArr) {
|
||
|
|
int length = iArr.length;
|
||
|
|
if (iArr[length - 1] > this.length) {
|
||
|
|
throw new ArithmeticException("invalid index set");
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = new GF2Vector(length);
|
||
|
|
for (int i = 0; i < length; i++) {
|
||
|
|
int[] iArr2 = this.v;
|
||
|
|
int i2 = iArr[i];
|
||
|
|
if ((iArr2[i2 >> 5] & (1 << (i2 & 31))) != 0) {
|
||
|
|
int[] iArr3 = gF2Vector.v;
|
||
|
|
int i3 = i >> 5;
|
||
|
|
iArr3[i3] = (1 << (i & 31)) | iArr3[i3];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return gF2Vector;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector extractRightVector(int i) {
|
||
|
|
int i2;
|
||
|
|
if (i > this.length) {
|
||
|
|
throw new ArithmeticException("invalid length");
|
||
|
|
}
|
||
|
|
if (i == this.length) {
|
||
|
|
return new GF2Vector(this);
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = new GF2Vector(i);
|
||
|
|
int i3 = (this.length - i) >> 5;
|
||
|
|
int i4 = (this.length - i) & 31;
|
||
|
|
int i5 = (i + 31) >> 5;
|
||
|
|
int i6 = 0;
|
||
|
|
if (i4 != 0) {
|
||
|
|
while (true) {
|
||
|
|
i2 = i5 - 1;
|
||
|
|
if (i6 >= i2) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int[] iArr = gF2Vector.v;
|
||
|
|
int[] iArr2 = this.v;
|
||
|
|
int i7 = i3 + 1;
|
||
|
|
iArr[i6] = (iArr2[i3] >>> i4) | (iArr2[i7] << (32 - i4));
|
||
|
|
i6++;
|
||
|
|
i3 = i7;
|
||
|
|
}
|
||
|
|
int[] iArr3 = gF2Vector.v;
|
||
|
|
int[] iArr4 = this.v;
|
||
|
|
int i8 = i3 + 1;
|
||
|
|
int i9 = iArr4[i3] >>> i4;
|
||
|
|
iArr3[i2] = i9;
|
||
|
|
if (i8 < iArr4.length) {
|
||
|
|
iArr3[i2] = i9 | (iArr4[i8] << (32 - i4));
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
System.arraycopy(this.v, i3, gF2Vector.v, 0, i5);
|
||
|
|
}
|
||
|
|
return gF2Vector;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector extractLeftVector(int i) {
|
||
|
|
if (i > this.length) {
|
||
|
|
throw new ArithmeticException("invalid length");
|
||
|
|
}
|
||
|
|
if (i == this.length) {
|
||
|
|
return new GF2Vector(this);
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = new GF2Vector(i);
|
||
|
|
int i2 = i >> 5;
|
||
|
|
int i3 = i & 31;
|
||
|
|
System.arraycopy(this.v, 0, gF2Vector.v, 0, i2);
|
||
|
|
if (i3 != 0) {
|
||
|
|
gF2Vector.v[i2] = ((1 << i3) - 1) & this.v[i2];
|
||
|
|
}
|
||
|
|
return gF2Vector;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public boolean equals(Object obj) {
|
||
|
|
if (!(obj instanceof GF2Vector)) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = (GF2Vector) obj;
|
||
|
|
return this.length == gF2Vector.length && IntUtils.equals(this.v, gF2Vector.v);
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.pqc.math.linearalgebra.Vector
|
||
|
|
public Vector add(Vector vector) {
|
||
|
|
if (!(vector instanceof GF2Vector)) {
|
||
|
|
throw new ArithmeticException("vector is not defined over GF(2)");
|
||
|
|
}
|
||
|
|
GF2Vector gF2Vector = (GF2Vector) vector;
|
||
|
|
if (this.length != gF2Vector.length) {
|
||
|
|
throw new ArithmeticException("length mismatch");
|
||
|
|
}
|
||
|
|
int[] clone = IntUtils.clone(gF2Vector.v);
|
||
|
|
for (int length = clone.length - 1; length >= 0; length--) {
|
||
|
|
clone[length] = clone[length] ^ this.v[length];
|
||
|
|
}
|
||
|
|
return new GF2Vector(this.length, clone);
|
||
|
|
}
|
||
|
|
|
||
|
|
public static GF2Vector OS2VP(int i, byte[] bArr) {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new ArithmeticException("negative length");
|
||
|
|
}
|
||
|
|
if (bArr.length <= ((i + 7) >> 3)) {
|
||
|
|
return new GF2Vector(i, LittleEndianConversions.toIntArray(bArr));
|
||
|
|
}
|
||
|
|
throw new ArithmeticException("length mismatch");
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX INFO: Access modifiers changed from: protected */
|
||
|
|
public GF2Vector(int[] iArr, int i) {
|
||
|
|
this.v = iArr;
|
||
|
|
this.length = i;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector(GF2Vector gF2Vector) {
|
||
|
|
this.length = gF2Vector.length;
|
||
|
|
this.v = IntUtils.clone(gF2Vector.v);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector(int i, int[] iArr) {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new ArithmeticException("negative length");
|
||
|
|
}
|
||
|
|
this.length = i;
|
||
|
|
int i2 = (i + 31) >> 5;
|
||
|
|
if (iArr.length != i2) {
|
||
|
|
throw new ArithmeticException("length mismatch");
|
||
|
|
}
|
||
|
|
int[] clone = IntUtils.clone(iArr);
|
||
|
|
this.v = clone;
|
||
|
|
int i3 = i & 31;
|
||
|
|
if (i3 != 0) {
|
||
|
|
int i4 = i2 - 1;
|
||
|
|
clone[i4] = ((1 << i3) - 1) & clone[i4];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector(int i, SecureRandom secureRandom) {
|
||
|
|
this.length = i;
|
||
|
|
int i2 = (i + 31) >> 5;
|
||
|
|
this.v = new int[i2];
|
||
|
|
int i3 = i2 - 1;
|
||
|
|
for (int i4 = i3; i4 >= 0; i4--) {
|
||
|
|
this.v[i4] = secureRandom.nextInt();
|
||
|
|
}
|
||
|
|
int i5 = i & 31;
|
||
|
|
if (i5 != 0) {
|
||
|
|
int[] iArr = this.v;
|
||
|
|
iArr[i3] = ((1 << i5) - 1) & iArr[i3];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector(int i, int i2, SecureRandom secureRandom) {
|
||
|
|
if (i2 > i) {
|
||
|
|
throw new ArithmeticException("The hamming weight is greater than the length of vector.");
|
||
|
|
}
|
||
|
|
this.length = i;
|
||
|
|
this.v = new int[(i + 31) >> 5];
|
||
|
|
int[] iArr = new int[i];
|
||
|
|
for (int i3 = 0; i3 < i; i3++) {
|
||
|
|
iArr[i3] = i3;
|
||
|
|
}
|
||
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
||
|
|
int nextInt = RandUtils.nextInt(secureRandom, i);
|
||
|
|
setBit(iArr[nextInt]);
|
||
|
|
i--;
|
||
|
|
iArr[nextInt] = iArr[i];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Vector(int i) {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new ArithmeticException("Negative length.");
|
||
|
|
}
|
||
|
|
this.length = i;
|
||
|
|
this.v = new int[(i + 31) >> 5];
|
||
|
|
}
|
||
|
|
}
|