1560 lines
56 KiB
Java
1560 lines
56 KiB
Java
|
package org.bouncycastle.pqc.math.linearalgebra;
|
||
|
|
|
||
|
|
import com.google.android.gms.internal.common.zzd;
|
||
|
|
import com.google.common.base.Ascii;
|
||
|
|
import com.google.common.primitives.Shorts;
|
||
|
|
import com.google.common.primitives.UnsignedBytes;
|
||
|
|
import io.beid.beidk.definitions.LivenessStatus;
|
||
|
|
import io.flutter.embedding.android.KeyboardMap;
|
||
|
|
import java.math.BigInteger;
|
||
|
|
import java.util.Random;
|
||
|
|
import okhttp3.internal.http2.Http2Connection;
|
||
|
|
import org.bouncycastle.asn1.cmp.PKIFailureInfo;
|
||
|
|
import org.bouncycastle.crypto.tls.CipherSuite;
|
||
|
|
import org.jmrtd.PassportService;
|
||
|
|
|
||
|
|
/* loaded from: classes6.dex */
|
||
|
|
public class GF2Polynomial {
|
||
|
|
private int blocks;
|
||
|
|
private int len;
|
||
|
|
private int[] value;
|
||
|
|
private static Random rand = new Random();
|
||
|
|
private static final boolean[] parity = {false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false, false, true, true, false, true, false, false, true, false, true, true, false, true, false, false, true, true, false, false, true, false, true, true, false};
|
||
|
|
private static final short[] squaringTable = {0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85, 256, PassportService.EF_DG1, PassportService.EF_DG4, PassportService.EF_DG5, PassportService.EF_DG16, 273, 276, 277, 320, 321, 324, 325, 336, 337, 340, 341, 1024, 1025, 1028, 1029, 1040, 1041, 1044, 1045, 1088, 1089, 1092, 1093, 1104, 1105, 1108, 1109, 1280, 1281, 1284, 1285, 1296, 1297, 1300, 1301, 1344, 1345, 1348, 1349, 1360, 1361, 1364, 1365, 4096, 4097, 4100, 4101, 4112, 4113, 4116, 4117, 4160, 4161, 4164, 4165, 4176, 4177, 4180, 4181, 4352, 4353, 4356, 4357, 4368, 4369, 4372, 4373, 4416, 4417, 4420, 4421, 4432, 4433, 4436, 4437, 5120, 5121, 5124, 5125, 5136, 5137, 5140, 5141, 5184, 5185, 5188, 5189, 5200, 5201, 5204, 5205, 5376, 5377, 5380, 5381, 5392, 5393, 5396, 5397, 5440, 5441, 5444, 5445, 5456, 5457, 5460, 5461, Shorts.MAX_POWER_OF_TWO, 16385, 16388, 16389, 16400, 16401, 16404, 16405, 16448, 16449, 16452, 16453, 16464, 16465, 16468, 16469, 16640, 16641, 16644, 16645, 16656, 16657, 16660, 16661, 16704, 16705, 16708, 16709, 16720, 16721, 16724, 16725, 17408, 17409, 17412, 17413, 17424, 17425, 17428, 17429, 17472, 17473, 17476, 17477, 17488, 17489, 17492, 17493, 17664, 17665, 17668, 17669, 17680, 17681, 17684, 17685, 17728, 17729, 17732, 17733, 17744, 17745, 17748, 17749, 20480, 20481, 20484, 20485, 20496, 20497, 20500, 20501, 20544, 20545, 20548, 20549, 20560, 20561, 20564, 20565, 20736, 20737, 20740, 20741, 20752, 20753, 20756, 20757, 20800, 20801, 20804, 20805, 20816, 20817, 20820, 20821, 21504, 21505, 21508, 21509, 21520, 21521, 21524, 21525, 21568, 21569, 21572, 21573, 21584, 21585, 21588, 21589, 21760, 21761, 21764, 21765, 21776, 21777, 21780, 21781, 21824, 21825, 21828, 21829, 21840, 21841, 21844, 21845};
|
||
|
|
private static final int[] bitMask = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, PKIFailureInfo.badCertTemplate, PKIFailureInfo.badSenderNonce, 4194304, 8388608, Http2Connection.OKHTTP_CLIENT_WINDOW_SIZE, 33554432, zzd.zza, 134217728, 268435456, PKIFailureInfo.duplicateCertReq, 1073741824, PKIFailureInfo.systemUnavail, 0};
|
||
|
|
private static final int[] reverseRightMask = {0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, Integer.MAX_VALUE, -1};
|
||
|
|
|
||
|
|
public void xorThisBy(GF2Polynomial gF2Polynomial) {
|
||
|
|
for (int i = 0; i < Math.min(this.blocks, gF2Polynomial.blocks); i++) {
|
||
|
|
int[] iArr = this.value;
|
||
|
|
iArr[i] = iArr[i] ^ gF2Polynomial.value[i];
|
||
|
|
}
|
||
|
|
zeroUnusedBits();
|
||
|
|
}
|
||
|
|
|
||
|
|
public void xorBit(int i) throws RuntimeException {
|
||
|
|
if (i < 0 || i > this.len - 1) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i2 = i >>> 5;
|
||
|
|
iArr[i2] = bitMask[i & 31] ^ iArr[i2];
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial xor(GF2Polynomial gF2Polynomial) {
|
||
|
|
GF2Polynomial gF2Polynomial2;
|
||
|
|
int min = Math.min(this.blocks, gF2Polynomial.blocks);
|
||
|
|
int i = 0;
|
||
|
|
if (this.len >= gF2Polynomial.len) {
|
||
|
|
gF2Polynomial2 = new GF2Polynomial(this);
|
||
|
|
while (i < min) {
|
||
|
|
int[] iArr = gF2Polynomial2.value;
|
||
|
|
iArr[i] = iArr[i] ^ gF2Polynomial.value[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
gF2Polynomial2 = new GF2Polynomial(gF2Polynomial);
|
||
|
|
while (i < min) {
|
||
|
|
int[] iArr2 = gF2Polynomial2.value;
|
||
|
|
iArr2[i] = iArr2[i] ^ this.value[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
gF2Polynomial2.zeroUnusedBits();
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean vectorMult(GF2Polynomial gF2Polynomial) throws RuntimeException {
|
||
|
|
if (this.len != gF2Polynomial.len) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
boolean z = false;
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
int i2 = this.value[i] & gF2Polynomial.value[i];
|
||
|
|
boolean[] zArr = parity;
|
||
|
|
z = (((z ^ zArr[i2 & 255]) ^ zArr[(i2 >>> 8) & 255]) ^ zArr[(i2 >>> 16) & 255]) ^ zArr[i2 >>> 24];
|
||
|
|
}
|
||
|
|
return z;
|
||
|
|
}
|
||
|
|
|
||
|
|
public String toString(int i) {
|
||
|
|
char[] cArr = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'};
|
||
|
|
String[] strArr = {LivenessStatus.OK, "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
|
||
|
|
String str = new String();
|
||
|
|
if (i == 16) {
|
||
|
|
for (int i2 = this.blocks - 1; i2 >= 0; i2--) {
|
||
|
|
StringBuilder sb = new StringBuilder();
|
||
|
|
sb.append(str);
|
||
|
|
sb.append(cArr[(this.value[i2] >>> 28) & 15]);
|
||
|
|
String obj = sb.toString();
|
||
|
|
StringBuilder sb2 = new StringBuilder();
|
||
|
|
sb2.append(obj);
|
||
|
|
sb2.append(cArr[(this.value[i2] >>> 24) & 15]);
|
||
|
|
String obj2 = sb2.toString();
|
||
|
|
StringBuilder sb3 = new StringBuilder();
|
||
|
|
sb3.append(obj2);
|
||
|
|
sb3.append(cArr[(this.value[i2] >>> 20) & 15]);
|
||
|
|
String obj3 = sb3.toString();
|
||
|
|
StringBuilder sb4 = new StringBuilder();
|
||
|
|
sb4.append(obj3);
|
||
|
|
sb4.append(cArr[(this.value[i2] >>> 16) & 15]);
|
||
|
|
String obj4 = sb4.toString();
|
||
|
|
StringBuilder sb5 = new StringBuilder();
|
||
|
|
sb5.append(obj4);
|
||
|
|
sb5.append(cArr[(this.value[i2] >>> 12) & 15]);
|
||
|
|
String obj5 = sb5.toString();
|
||
|
|
StringBuilder sb6 = new StringBuilder();
|
||
|
|
sb6.append(obj5);
|
||
|
|
sb6.append(cArr[(this.value[i2] >>> 8) & 15]);
|
||
|
|
String obj6 = sb6.toString();
|
||
|
|
StringBuilder sb7 = new StringBuilder();
|
||
|
|
sb7.append(obj6);
|
||
|
|
sb7.append(cArr[(this.value[i2] >>> 4) & 15]);
|
||
|
|
String obj7 = sb7.toString();
|
||
|
|
StringBuilder sb8 = new StringBuilder();
|
||
|
|
sb8.append(obj7);
|
||
|
|
sb8.append(cArr[this.value[i2] & 15]);
|
||
|
|
String obj8 = sb8.toString();
|
||
|
|
StringBuilder sb9 = new StringBuilder();
|
||
|
|
sb9.append(obj8);
|
||
|
|
sb9.append(" ");
|
||
|
|
str = sb9.toString();
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
for (int i3 = this.blocks - 1; i3 >= 0; i3--) {
|
||
|
|
StringBuilder sb10 = new StringBuilder();
|
||
|
|
sb10.append(str);
|
||
|
|
sb10.append(strArr[(this.value[i3] >>> 28) & 15]);
|
||
|
|
String obj9 = sb10.toString();
|
||
|
|
StringBuilder sb11 = new StringBuilder();
|
||
|
|
sb11.append(obj9);
|
||
|
|
sb11.append(strArr[(this.value[i3] >>> 24) & 15]);
|
||
|
|
String obj10 = sb11.toString();
|
||
|
|
StringBuilder sb12 = new StringBuilder();
|
||
|
|
sb12.append(obj10);
|
||
|
|
sb12.append(strArr[(this.value[i3] >>> 20) & 15]);
|
||
|
|
String obj11 = sb12.toString();
|
||
|
|
StringBuilder sb13 = new StringBuilder();
|
||
|
|
sb13.append(obj11);
|
||
|
|
sb13.append(strArr[(this.value[i3] >>> 16) & 15]);
|
||
|
|
String obj12 = sb13.toString();
|
||
|
|
StringBuilder sb14 = new StringBuilder();
|
||
|
|
sb14.append(obj12);
|
||
|
|
sb14.append(strArr[(this.value[i3] >>> 12) & 15]);
|
||
|
|
String obj13 = sb14.toString();
|
||
|
|
StringBuilder sb15 = new StringBuilder();
|
||
|
|
sb15.append(obj13);
|
||
|
|
sb15.append(strArr[(this.value[i3] >>> 8) & 15]);
|
||
|
|
String obj14 = sb15.toString();
|
||
|
|
StringBuilder sb16 = new StringBuilder();
|
||
|
|
sb16.append(obj14);
|
||
|
|
sb16.append(strArr[(this.value[i3] >>> 4) & 15]);
|
||
|
|
String obj15 = sb16.toString();
|
||
|
|
StringBuilder sb17 = new StringBuilder();
|
||
|
|
sb17.append(obj15);
|
||
|
|
sb17.append(strArr[this.value[i3] & 15]);
|
||
|
|
String obj16 = sb17.toString();
|
||
|
|
StringBuilder sb18 = new StringBuilder();
|
||
|
|
sb18.append(obj16);
|
||
|
|
sb18.append(" ");
|
||
|
|
str = sb18.toString();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return str;
|
||
|
|
}
|
||
|
|
|
||
|
|
public int[] toIntegerArray() {
|
||
|
|
int i = this.blocks;
|
||
|
|
int[] iArr = new int[i];
|
||
|
|
System.arraycopy(this.value, 0, iArr, 0, i);
|
||
|
|
return iArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
public BigInteger toFlexiBigInt() {
|
||
|
|
return (this.len == 0 || isZero()) ? new BigInteger(0, new byte[0]) : new BigInteger(1, toByteArray());
|
||
|
|
}
|
||
|
|
|
||
|
|
public byte[] toByteArray() {
|
||
|
|
int i = ((this.len - 1) >> 3) + 1;
|
||
|
|
int i2 = i & 3;
|
||
|
|
byte[] bArr = new byte[i];
|
||
|
|
for (int i3 = 0; i3 < (i >> 2); i3++) {
|
||
|
|
int i4 = i - (i3 << 2);
|
||
|
|
int i5 = this.value[i3];
|
||
|
|
bArr[i4 - 1] = (byte) i5;
|
||
|
|
bArr[i4 - 2] = (byte) ((65280 & i5) >>> 8);
|
||
|
|
bArr[i4 - 3] = (byte) ((16711680 & i5) >>> 16);
|
||
|
|
bArr[i4 - 4] = (byte) ((i5 & (-16777216)) >>> 24);
|
||
|
|
}
|
||
|
|
for (int i6 = 0; i6 < i2; i6++) {
|
||
|
|
int i7 = ((i2 - i6) - 1) << 3;
|
||
|
|
bArr[i6] = (byte) ((this.value[this.blocks - 1] & (255 << i7)) >>> i7);
|
||
|
|
}
|
||
|
|
return bArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean testBit(int i) {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
if (i > this.len - 1) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
return (bitMask[i & 31] & this.value[i >>> 5]) != 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void subtractFromThis(GF2Polynomial gF2Polynomial) {
|
||
|
|
expandN(gF2Polynomial.len);
|
||
|
|
xorThisBy(gF2Polynomial);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial subtract(GF2Polynomial gF2Polynomial) {
|
||
|
|
return xor(gF2Polynomial);
|
||
|
|
}
|
||
|
|
|
||
|
|
public void squareThisPreCalc() {
|
||
|
|
int i;
|
||
|
|
int i2;
|
||
|
|
if (isZero()) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length = this.value.length;
|
||
|
|
int i3 = this.blocks;
|
||
|
|
int i4 = i3 << 1;
|
||
|
|
if (length >= i4) {
|
||
|
|
while (true) {
|
||
|
|
i3--;
|
||
|
|
if (i3 < 0) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i5 = i3 << 1;
|
||
|
|
short[] sArr = squaringTable;
|
||
|
|
int i6 = iArr[i3];
|
||
|
|
iArr[i5 + 1] = (sArr[(i6 & (-16777216)) >>> 24] << 16) | sArr[(i6 >>> 16) & 255];
|
||
|
|
int i7 = iArr[i3];
|
||
|
|
iArr[i5] = (sArr[(i7 >>> 8) & 255] << 16) | sArr[i7 & 255];
|
||
|
|
}
|
||
|
|
i2 = this.blocks << 1;
|
||
|
|
} else {
|
||
|
|
int[] iArr2 = new int[i4];
|
||
|
|
int i8 = 0;
|
||
|
|
while (true) {
|
||
|
|
i = this.blocks;
|
||
|
|
if (i8 >= i) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int i9 = i8 << 1;
|
||
|
|
short[] sArr2 = squaringTable;
|
||
|
|
int[] iArr3 = this.value;
|
||
|
|
int i10 = iArr3[i8];
|
||
|
|
iArr2[i9] = (sArr2[(i10 >>> 8) & 255] << 16) | sArr2[i10 & 255];
|
||
|
|
int i11 = iArr3[i8];
|
||
|
|
iArr2[i9 + 1] = (sArr2[(i11 & (-16777216)) >>> 24] << 16) | sArr2[(i11 >>> 16) & 255];
|
||
|
|
i8++;
|
||
|
|
}
|
||
|
|
this.value = iArr2;
|
||
|
|
i2 = i << 1;
|
||
|
|
}
|
||
|
|
this.blocks = i2;
|
||
|
|
this.len = (this.len << 1) - 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void squareThisBitwise() {
|
||
|
|
if (isZero()) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i = this.blocks;
|
||
|
|
int i2 = i << 1;
|
||
|
|
int[] iArr = new int[i2];
|
||
|
|
while (true) {
|
||
|
|
i--;
|
||
|
|
if (i < 0) {
|
||
|
|
this.value = iArr;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.len = (this.len << 1) - 1;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i3 = this.value[i];
|
||
|
|
int i4 = 1;
|
||
|
|
for (int i5 = 0; i5 < 16; i5++) {
|
||
|
|
if ((i3 & 1) != 0) {
|
||
|
|
int i6 = i << 1;
|
||
|
|
iArr[i6] = iArr[i6] | i4;
|
||
|
|
}
|
||
|
|
if ((65536 & i3) != 0) {
|
||
|
|
int i7 = (i << 1) + 1;
|
||
|
|
iArr[i7] = iArr[i7] | i4;
|
||
|
|
}
|
||
|
|
i4 <<= 2;
|
||
|
|
i3 >>>= 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public void shiftRightThis() {
|
||
|
|
int i;
|
||
|
|
int i2 = this.len;
|
||
|
|
this.len = i2 - 1;
|
||
|
|
this.blocks = ((i2 - 2) >>> 5) + 1;
|
||
|
|
int i3 = 0;
|
||
|
|
while (true) {
|
||
|
|
i = this.blocks;
|
||
|
|
if (i3 > i - 2) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i4 = iArr[i3] >>> 1;
|
||
|
|
iArr[i3] = i4;
|
||
|
|
int i5 = i3 + 1;
|
||
|
|
iArr[i3] = i4 | (iArr[i5] << 31);
|
||
|
|
i3 = i5;
|
||
|
|
}
|
||
|
|
int[] iArr2 = this.value;
|
||
|
|
int i6 = i - 1;
|
||
|
|
int i7 = iArr2[i6] >>> 1;
|
||
|
|
iArr2[i6] = i7;
|
||
|
|
if ((this.len & 31) == 0) {
|
||
|
|
iArr2[i6] = (iArr2[i] << 31) | i7;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial shiftRight() {
|
||
|
|
int i;
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(this.len - 1);
|
||
|
|
int i2 = 0;
|
||
|
|
System.arraycopy(this.value, 0, gF2Polynomial.value, 0, gF2Polynomial.blocks);
|
||
|
|
while (true) {
|
||
|
|
i = gF2Polynomial.blocks;
|
||
|
|
if (i2 > i - 2) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int[] iArr = gF2Polynomial.value;
|
||
|
|
int i3 = iArr[i2] >>> 1;
|
||
|
|
iArr[i2] = i3;
|
||
|
|
int i4 = i2 + 1;
|
||
|
|
iArr[i2] = i3 | (iArr[i4] << 31);
|
||
|
|
i2 = i4;
|
||
|
|
}
|
||
|
|
int[] iArr2 = gF2Polynomial.value;
|
||
|
|
int i5 = i - 1;
|
||
|
|
int i6 = iArr2[i5] >>> 1;
|
||
|
|
iArr2[i5] = i6;
|
||
|
|
if (i < this.blocks) {
|
||
|
|
iArr2[i5] = (this.value[i] << 31) | i6;
|
||
|
|
}
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void shiftLeftThis() {
|
||
|
|
int i = this.len;
|
||
|
|
this.len = i + 1;
|
||
|
|
int i2 = this.blocks;
|
||
|
|
if ((i & 31) == 0) {
|
||
|
|
int i3 = i2 + 1;
|
||
|
|
this.blocks = i3;
|
||
|
|
int[] iArr = this.value;
|
||
|
|
if (i3 > iArr.length) {
|
||
|
|
int[] iArr2 = new int[i3];
|
||
|
|
System.arraycopy(iArr, 0, iArr2, 0, iArr.length);
|
||
|
|
this.value = iArr2;
|
||
|
|
}
|
||
|
|
for (int i4 = this.blocks - 1; i4 > 0; i4--) {
|
||
|
|
int[] iArr3 = this.value;
|
||
|
|
int i5 = i4 - 1;
|
||
|
|
iArr3[i4] = iArr3[i4] | (iArr3[i5] >>> 31);
|
||
|
|
iArr3[i5] = iArr3[i5] << 1;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
while (true) {
|
||
|
|
i2--;
|
||
|
|
int[] iArr4 = this.value;
|
||
|
|
if (i2 <= 0) {
|
||
|
|
iArr4[0] = iArr4[0] << 1;
|
||
|
|
return;
|
||
|
|
} else {
|
||
|
|
int i6 = iArr4[i2] << 1;
|
||
|
|
iArr4[i2] = i6;
|
||
|
|
iArr4[i2] = i6 | (iArr4[i2 - 1] >>> 31);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public void shiftLeftAddThis(GF2Polynomial gF2Polynomial, int i) {
|
||
|
|
int i2;
|
||
|
|
if (i == 0) {
|
||
|
|
addToThis(gF2Polynomial);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
expandN(gF2Polynomial.len + i);
|
||
|
|
for (int i3 = gF2Polynomial.blocks - 1; i3 >= 0; i3--) {
|
||
|
|
int i4 = (i >>> 5) + i3;
|
||
|
|
int i5 = i4 + 1;
|
||
|
|
if (i5 < this.blocks && (i2 = i & 31) != 0) {
|
||
|
|
int[] iArr = this.value;
|
||
|
|
iArr[i5] = (gF2Polynomial.value[i3] >>> (32 - i2)) ^ iArr[i5];
|
||
|
|
}
|
||
|
|
int[] iArr2 = this.value;
|
||
|
|
iArr2[i4] = iArr2[i4] ^ (gF2Polynomial.value[i3] << (i & 31));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial shiftLeft(int i) {
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(this.len + i, this.value);
|
||
|
|
if (i >= 32) {
|
||
|
|
gF2Polynomial.doShiftBlocksLeft(i >>> 5);
|
||
|
|
}
|
||
|
|
int i2 = i & 31;
|
||
|
|
if (i2 != 0) {
|
||
|
|
for (int i3 = gF2Polynomial.blocks - 1; i3 > 0; i3--) {
|
||
|
|
int[] iArr = gF2Polynomial.value;
|
||
|
|
int i4 = iArr[i3] << i2;
|
||
|
|
iArr[i3] = i4;
|
||
|
|
iArr[i3] = i4 | (iArr[i3 - 1] >>> (32 - i2));
|
||
|
|
}
|
||
|
|
int[] iArr2 = gF2Polynomial.value;
|
||
|
|
iArr2[0] = iArr2[0] << i2;
|
||
|
|
}
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial shiftLeft() {
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(this.len + 1, this.value);
|
||
|
|
for (int i = gF2Polynomial.blocks - 1; i > 0; i--) {
|
||
|
|
int[] iArr = gF2Polynomial.value;
|
||
|
|
int i2 = iArr[i] << 1;
|
||
|
|
iArr[i] = i2;
|
||
|
|
iArr[i] = i2 | (iArr[i - 1] >>> 31);
|
||
|
|
}
|
||
|
|
int[] iArr2 = gF2Polynomial.value;
|
||
|
|
iArr2[0] = iArr2[0] << 1;
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
void shiftBlocksLeft() {
|
||
|
|
int i = this.blocks;
|
||
|
|
int i2 = i + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.len += 32;
|
||
|
|
int[] iArr = this.value;
|
||
|
|
if (i2 > iArr.length) {
|
||
|
|
int[] iArr2 = new int[i2];
|
||
|
|
System.arraycopy(iArr, 0, iArr2, 1, i);
|
||
|
|
this.value = iArr2;
|
||
|
|
} else {
|
||
|
|
while (i > 0) {
|
||
|
|
int[] iArr3 = this.value;
|
||
|
|
iArr3[i] = iArr3[i - 1];
|
||
|
|
i--;
|
||
|
|
}
|
||
|
|
this.value[0] = 0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public void setBit(int i) throws RuntimeException {
|
||
|
|
if (i < 0 || i > this.len - 1) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i2 = i >>> 5;
|
||
|
|
iArr[i2] = bitMask[i & 31] | iArr[i2];
|
||
|
|
}
|
||
|
|
|
||
|
|
public void resetBit(int i) throws RuntimeException {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
if (i > this.len - 1) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i2 = i >>> 5;
|
||
|
|
iArr[i2] = (~bitMask[i & 31]) & iArr[i2];
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial remainder(GF2Polynomial gF2Polynomial) throws RuntimeException {
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(this);
|
||
|
|
GF2Polynomial gF2Polynomial3 = new GF2Polynomial(gF2Polynomial);
|
||
|
|
if (gF2Polynomial3.isZero()) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
gF2Polynomial2.reduceN();
|
||
|
|
gF2Polynomial3.reduceN();
|
||
|
|
int i = gF2Polynomial2.len;
|
||
|
|
int i2 = gF2Polynomial3.len;
|
||
|
|
if (i < i2) {
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
while (true) {
|
||
|
|
int i3 = i - i2;
|
||
|
|
if (i3 < 0) {
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
gF2Polynomial2.subtractFromThis(gF2Polynomial3.shiftLeft(i3));
|
||
|
|
gF2Polynomial2.reduceN();
|
||
|
|
i = gF2Polynomial2.len;
|
||
|
|
i2 = gF2Polynomial3.len;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
||
|
|
public void reduceTrinomial(int i, int i2) {
|
||
|
|
int i3 = i >>> 5;
|
||
|
|
int i4 = i & 31;
|
||
|
|
int i5 = 32 - i4;
|
||
|
|
int i6 = i - i2;
|
||
|
|
int i7 = i6 >>> 5;
|
||
|
|
int i8 = 32 - (i6 & 31);
|
||
|
|
int i9 = ((i << 1) - 2) >>> 5;
|
||
|
|
while (i9 > i3) {
|
||
|
|
int[] iArr = this.value;
|
||
|
|
long j = KeyboardMap.kValueMask & iArr[i9];
|
||
|
|
int i10 = i9 - i3;
|
||
|
|
int i11 = i10 - 1;
|
||
|
|
int i12 = i3;
|
||
|
|
iArr[i11] = ((int) (j << i5)) ^ iArr[i11];
|
||
|
|
iArr[i10] = (int) (iArr[i10] ^ (j >>> (32 - i5)));
|
||
|
|
int i13 = i9 - i7;
|
||
|
|
int i14 = i13 - 1;
|
||
|
|
iArr[i14] = iArr[i14] ^ ((int) (j << i8));
|
||
|
|
iArr[i13] = (int) ((j >>> (32 - i8)) ^ iArr[i13]);
|
||
|
|
iArr[i9] = 0;
|
||
|
|
i9--;
|
||
|
|
i3 = i12;
|
||
|
|
}
|
||
|
|
int i15 = i3;
|
||
|
|
int[] iArr2 = this.value;
|
||
|
|
long j2 = KeyboardMap.kValueMask & iArr2[i15] & (KeyboardMap.kValueMask << i4);
|
||
|
|
iArr2[0] = (int) (iArr2[0] ^ (j2 >>> (32 - i5)));
|
||
|
|
int i16 = i15 - i7;
|
||
|
|
int i17 = i16 - 1;
|
||
|
|
if (i17 >= 0) {
|
||
|
|
iArr2[i17] = iArr2[i17] ^ ((int) (j2 << i8));
|
||
|
|
}
|
||
|
|
iArr2[i16] = (int) ((j2 >>> (32 - i8)) ^ iArr2[i16]);
|
||
|
|
iArr2[i15] = iArr2[i15] & reverseRightMask[i4];
|
||
|
|
this.blocks = ((i - 1) >>> 5) + 1;
|
||
|
|
this.len = i;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
||
|
|
public void reducePentanomial(int i, int[] iArr) {
|
||
|
|
GF2Polynomial gF2Polynomial = this;
|
||
|
|
int i2 = i >>> 5;
|
||
|
|
int i3 = i & 31;
|
||
|
|
int i4 = 32 - i3;
|
||
|
|
int i5 = i - iArr[0];
|
||
|
|
int i6 = i5 >>> 5;
|
||
|
|
int i7 = 32 - (i5 & 31);
|
||
|
|
int i8 = i - iArr[1];
|
||
|
|
int i9 = i8 >>> 5;
|
||
|
|
int i10 = 32 - (i8 & 31);
|
||
|
|
int i11 = i - iArr[2];
|
||
|
|
int i12 = i11 >>> 5;
|
||
|
|
int i13 = 32 - (i11 & 31);
|
||
|
|
int i14 = ((i << 1) - 2) >>> 5;
|
||
|
|
while (i14 > i2) {
|
||
|
|
int[] iArr2 = gF2Polynomial.value;
|
||
|
|
long j = iArr2[i14] & KeyboardMap.kValueMask;
|
||
|
|
int i15 = i14 - i2;
|
||
|
|
int i16 = i15 - 1;
|
||
|
|
int i17 = i2;
|
||
|
|
int i18 = i3;
|
||
|
|
iArr2[i16] = ((int) (j << i4)) ^ iArr2[i16];
|
||
|
|
iArr2[i15] = (int) (iArr2[i15] ^ (j >>> (32 - i4)));
|
||
|
|
int i19 = i14 - i6;
|
||
|
|
int i20 = i19 - 1;
|
||
|
|
iArr2[i20] = iArr2[i20] ^ ((int) (j << i7));
|
||
|
|
iArr2[i19] = (int) (iArr2[i19] ^ (j >>> (32 - i7)));
|
||
|
|
int i21 = i14 - i9;
|
||
|
|
int i22 = i21 - 1;
|
||
|
|
iArr2[i22] = iArr2[i22] ^ ((int) (j << i10));
|
||
|
|
iArr2[i21] = (int) (iArr2[i21] ^ (j >>> (32 - i10)));
|
||
|
|
int i23 = i14 - i12;
|
||
|
|
int i24 = i23 - 1;
|
||
|
|
iArr2[i24] = iArr2[i24] ^ ((int) (j << i13));
|
||
|
|
iArr2[i23] = (int) ((j >>> (32 - i13)) ^ iArr2[i23]);
|
||
|
|
iArr2[i14] = 0;
|
||
|
|
i14--;
|
||
|
|
gF2Polynomial = this;
|
||
|
|
i2 = i17;
|
||
|
|
i3 = i18;
|
||
|
|
}
|
||
|
|
int i25 = i2;
|
||
|
|
int i26 = i3;
|
||
|
|
int[] iArr3 = gF2Polynomial.value;
|
||
|
|
long j2 = iArr3[i25] & KeyboardMap.kValueMask & (KeyboardMap.kValueMask << i26);
|
||
|
|
iArr3[0] = (int) ((j2 >>> (32 - i4)) ^ iArr3[0]);
|
||
|
|
int i27 = i25 - i6;
|
||
|
|
int i28 = i27 - 1;
|
||
|
|
if (i28 >= 0) {
|
||
|
|
iArr3[i28] = iArr3[i28] ^ ((int) (j2 << i7));
|
||
|
|
}
|
||
|
|
iArr3[i27] = (int) ((j2 >>> (32 - i7)) ^ iArr3[i27]);
|
||
|
|
int i29 = i25 - i9;
|
||
|
|
int i30 = i29 - 1;
|
||
|
|
if (i30 >= 0) {
|
||
|
|
iArr3[i30] = iArr3[i30] ^ ((int) (j2 << i10));
|
||
|
|
}
|
||
|
|
iArr3[i29] = (int) (iArr3[i29] ^ (j2 >>> (32 - i10)));
|
||
|
|
int i31 = i25 - i12;
|
||
|
|
int i32 = i31 - 1;
|
||
|
|
if (i32 >= 0) {
|
||
|
|
iArr3[i32] = iArr3[i32] ^ ((int) (j2 << i13));
|
||
|
|
}
|
||
|
|
iArr3[i31] = (int) ((j2 >>> (32 - i13)) ^ iArr3[i31]);
|
||
|
|
iArr3[i25] = iArr3[i25] & reverseRightMask[i26];
|
||
|
|
gF2Polynomial.blocks = ((i - 1) >>> 5) + 1;
|
||
|
|
gF2Polynomial.len = i;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void reduceN() {
|
||
|
|
int i;
|
||
|
|
int i2 = this.blocks;
|
||
|
|
do {
|
||
|
|
i2--;
|
||
|
|
i = this.value[i2];
|
||
|
|
if (i != 0) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
} while (i2 > 0);
|
||
|
|
int i3 = 0;
|
||
|
|
while (i != 0) {
|
||
|
|
i >>>= 1;
|
||
|
|
i3++;
|
||
|
|
}
|
||
|
|
this.len = (i2 << 5) + i3;
|
||
|
|
this.blocks = i2 + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void randomize(Random random) {
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
this.value[i] = random.nextInt();
|
||
|
|
}
|
||
|
|
zeroUnusedBits();
|
||
|
|
}
|
||
|
|
|
||
|
|
public void randomize() {
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
this.value[i] = rand.nextInt();
|
||
|
|
}
|
||
|
|
zeroUnusedBits();
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial quotient(GF2Polynomial gF2Polynomial) throws RuntimeException {
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(this.len);
|
||
|
|
GF2Polynomial gF2Polynomial3 = new GF2Polynomial(this);
|
||
|
|
GF2Polynomial gF2Polynomial4 = new GF2Polynomial(gF2Polynomial);
|
||
|
|
if (gF2Polynomial4.isZero()) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
gF2Polynomial3.reduceN();
|
||
|
|
gF2Polynomial4.reduceN();
|
||
|
|
int i = gF2Polynomial3.len;
|
||
|
|
int i2 = gF2Polynomial4.len;
|
||
|
|
if (i < i2) {
|
||
|
|
return new GF2Polynomial(0);
|
||
|
|
}
|
||
|
|
int i3 = i - i2;
|
||
|
|
gF2Polynomial2.expandN(i3 + 1);
|
||
|
|
while (i3 >= 0) {
|
||
|
|
gF2Polynomial3.subtractFromThis(gF2Polynomial4.shiftLeft(i3));
|
||
|
|
gF2Polynomial3.reduceN();
|
||
|
|
gF2Polynomial2.xorBit(i3);
|
||
|
|
i3 = gF2Polynomial3.len - gF2Polynomial4.len;
|
||
|
|
}
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial multiplyClassic(GF2Polynomial gF2Polynomial) {
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(Math.max(this.len, gF2Polynomial.len) << 1);
|
||
|
|
GF2Polynomial[] gF2PolynomialArr = new GF2Polynomial[32];
|
||
|
|
gF2PolynomialArr[0] = new GF2Polynomial(this);
|
||
|
|
for (int i = 1; i <= 31; i++) {
|
||
|
|
gF2PolynomialArr[i] = gF2PolynomialArr[i - 1].shiftLeft();
|
||
|
|
}
|
||
|
|
for (int i2 = 0; i2 < gF2Polynomial.blocks; i2++) {
|
||
|
|
for (int i3 = 0; i3 <= 31; i3++) {
|
||
|
|
if ((gF2Polynomial.value[i2] & bitMask[i3]) != 0) {
|
||
|
|
gF2Polynomial2.xorThisBy(gF2PolynomialArr[i3]);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
for (int i4 = 0; i4 <= 31; i4++) {
|
||
|
|
gF2PolynomialArr[i4].shiftBlocksLeft();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial multiply(GF2Polynomial gF2Polynomial) {
|
||
|
|
int max = Math.max(this.len, gF2Polynomial.len);
|
||
|
|
expandN(max);
|
||
|
|
gF2Polynomial.expandN(max);
|
||
|
|
return karaMult(gF2Polynomial);
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean isZero() {
|
||
|
|
if (this.len == 0) {
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
if (this.value[i] != 0) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean isOne() {
|
||
|
|
for (int i = 1; i < this.blocks; i++) {
|
||
|
|
if (this.value[i] != 0) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return this.value[0] == 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean isIrreducible() {
|
||
|
|
if (isZero()) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(this);
|
||
|
|
gF2Polynomial.reduceN();
|
||
|
|
int i = gF2Polynomial.len;
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(i, "X");
|
||
|
|
for (int i2 = 1; i2 <= ((i - 1) >> 1); i2++) {
|
||
|
|
gF2Polynomial2.squareThisPreCalc();
|
||
|
|
gF2Polynomial2 = gF2Polynomial2.remainder(gF2Polynomial);
|
||
|
|
GF2Polynomial add = gF2Polynomial2.add(new GF2Polynomial(32, "X"));
|
||
|
|
if (add.isZero() || !gF2Polynomial.gcd(add).isOne()) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void increaseThis() {
|
||
|
|
xorBit(0);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial increase() {
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(this);
|
||
|
|
gF2Polynomial.increaseThis();
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
public int hashCode() {
|
||
|
|
return this.len + this.value.hashCode();
|
||
|
|
}
|
||
|
|
|
||
|
|
public int getLength() {
|
||
|
|
return this.len;
|
||
|
|
}
|
||
|
|
|
||
|
|
public int getBit(int i) {
|
||
|
|
if (i < 0) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
if (i > this.len - 1) {
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
return (bitMask[i & 31] & this.value[i >>> 5]) != 0 ? 1 : 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial gcd(GF2Polynomial gF2Polynomial) throws RuntimeException {
|
||
|
|
if (isZero() && gF2Polynomial.isZero()) {
|
||
|
|
throw new ArithmeticException("Both operands of gcd equal zero.");
|
||
|
|
}
|
||
|
|
if (isZero()) {
|
||
|
|
return new GF2Polynomial(gF2Polynomial);
|
||
|
|
}
|
||
|
|
if (gF2Polynomial.isZero()) {
|
||
|
|
return new GF2Polynomial(this);
|
||
|
|
}
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(this);
|
||
|
|
GF2Polynomial gF2Polynomial3 = new GF2Polynomial(gF2Polynomial);
|
||
|
|
GF2Polynomial gF2Polynomial4 = gF2Polynomial2;
|
||
|
|
GF2Polynomial gF2Polynomial5 = gF2Polynomial3;
|
||
|
|
while (!gF2Polynomial5.isZero()) {
|
||
|
|
GF2Polynomial gF2Polynomial6 = gF2Polynomial5;
|
||
|
|
gF2Polynomial5 = gF2Polynomial4.remainder(gF2Polynomial5);
|
||
|
|
gF2Polynomial4 = gF2Polynomial6;
|
||
|
|
}
|
||
|
|
return gF2Polynomial4;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void expandN(int i) {
|
||
|
|
if (this.len >= i) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
this.len = i;
|
||
|
|
int i2 = ((i - 1) >>> 5) + 1;
|
||
|
|
int i3 = this.blocks;
|
||
|
|
if (i3 >= i2) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int[] iArr = this.value;
|
||
|
|
if (iArr.length >= i2) {
|
||
|
|
while (i3 < i2) {
|
||
|
|
this.value[i3] = 0;
|
||
|
|
i3++;
|
||
|
|
}
|
||
|
|
this.blocks = i2;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int[] iArr2 = new int[i2];
|
||
|
|
System.arraycopy(iArr, 0, iArr2, 0, i3);
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = iArr2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean equals(Object obj) {
|
||
|
|
if (obj == null || !(obj instanceof GF2Polynomial)) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
GF2Polynomial gF2Polynomial = (GF2Polynomial) obj;
|
||
|
|
if (this.len != gF2Polynomial.len) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
if (this.value[i] != gF2Polynomial.value[i]) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial[] divide(GF2Polynomial gF2Polynomial) throws RuntimeException {
|
||
|
|
GF2Polynomial[] gF2PolynomialArr = new GF2Polynomial[2];
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(this.len);
|
||
|
|
GF2Polynomial gF2Polynomial3 = new GF2Polynomial(this);
|
||
|
|
GF2Polynomial gF2Polynomial4 = new GF2Polynomial(gF2Polynomial);
|
||
|
|
if (gF2Polynomial4.isZero()) {
|
||
|
|
throw new RuntimeException();
|
||
|
|
}
|
||
|
|
gF2Polynomial3.reduceN();
|
||
|
|
gF2Polynomial4.reduceN();
|
||
|
|
int i = gF2Polynomial3.len;
|
||
|
|
int i2 = gF2Polynomial4.len;
|
||
|
|
if (i < i2) {
|
||
|
|
gF2PolynomialArr[0] = new GF2Polynomial(0);
|
||
|
|
gF2PolynomialArr[1] = gF2Polynomial3;
|
||
|
|
return gF2PolynomialArr;
|
||
|
|
}
|
||
|
|
int i3 = i - i2;
|
||
|
|
gF2Polynomial2.expandN(i3 + 1);
|
||
|
|
while (i3 >= 0) {
|
||
|
|
gF2Polynomial3.subtractFromThis(gF2Polynomial4.shiftLeft(i3));
|
||
|
|
gF2Polynomial3.reduceN();
|
||
|
|
gF2Polynomial2.xorBit(i3);
|
||
|
|
i3 = gF2Polynomial3.len - gF2Polynomial4.len;
|
||
|
|
}
|
||
|
|
gF2PolynomialArr[0] = gF2Polynomial2;
|
||
|
|
gF2PolynomialArr[1] = gF2Polynomial3;
|
||
|
|
return gF2PolynomialArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
public Object clone() {
|
||
|
|
return new GF2Polynomial(this);
|
||
|
|
}
|
||
|
|
|
||
|
|
public void assignZero() {
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
this.value[i] = 0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public void assignX() {
|
||
|
|
for (int i = 1; i < this.blocks; i++) {
|
||
|
|
this.value[i] = 0;
|
||
|
|
}
|
||
|
|
this.value[0] = 2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void assignOne() {
|
||
|
|
for (int i = 1; i < this.blocks; i++) {
|
||
|
|
this.value[i] = 0;
|
||
|
|
}
|
||
|
|
this.value[0] = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void assignAll() {
|
||
|
|
for (int i = 0; i < this.blocks; i++) {
|
||
|
|
this.value[i] = -1;
|
||
|
|
}
|
||
|
|
zeroUnusedBits();
|
||
|
|
}
|
||
|
|
|
||
|
|
public void addToThis(GF2Polynomial gF2Polynomial) {
|
||
|
|
expandN(gF2Polynomial.len);
|
||
|
|
xorThisBy(gF2Polynomial);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial add(GF2Polynomial gF2Polynomial) {
|
||
|
|
return xor(gF2Polynomial);
|
||
|
|
}
|
||
|
|
|
||
|
|
private void zeroUnusedBits() {
|
||
|
|
int i = this.len & 31;
|
||
|
|
if (i != 0) {
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i2 = this.blocks - 1;
|
||
|
|
iArr[i2] = reverseRightMask[i] & iArr[i2];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
private GF2Polynomial upper(int i) {
|
||
|
|
int min = Math.min(i, this.blocks - i);
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(min << 5);
|
||
|
|
if (this.blocks >= i) {
|
||
|
|
System.arraycopy(this.value, i, gF2Polynomial.value, 0, min);
|
||
|
|
}
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int[] mult64(int[] iArr, int[] iArr2) {
|
||
|
|
int[] iArr3 = new int[4];
|
||
|
|
int i = iArr[0];
|
||
|
|
int i2 = iArr.length > 1 ? iArr[1] : 0;
|
||
|
|
int i3 = iArr2[0];
|
||
|
|
int i4 = iArr2.length > 1 ? iArr2[1] : 0;
|
||
|
|
if (i2 != 0 || i4 != 0) {
|
||
|
|
int[] mult32 = mult32(i2, i4);
|
||
|
|
int i5 = iArr3[3];
|
||
|
|
int i6 = mult32[1];
|
||
|
|
iArr3[3] = i5 ^ i6;
|
||
|
|
int i7 = iArr3[2];
|
||
|
|
int i8 = mult32[0];
|
||
|
|
iArr3[2] = i7 ^ (i8 ^ i6);
|
||
|
|
iArr3[1] = i8 ^ iArr3[1];
|
||
|
|
}
|
||
|
|
int[] mult322 = mult32(i2 ^ i, i4 ^ i3);
|
||
|
|
iArr3[2] = iArr3[2] ^ mult322[1];
|
||
|
|
iArr3[1] = mult322[0] ^ iArr3[1];
|
||
|
|
int[] mult323 = mult32(i, i3);
|
||
|
|
int i9 = iArr3[2];
|
||
|
|
int i10 = mult323[1];
|
||
|
|
iArr3[2] = i9 ^ i10;
|
||
|
|
int i11 = iArr3[1];
|
||
|
|
int i12 = mult323[0];
|
||
|
|
iArr3[1] = i11 ^ (i10 ^ i12);
|
||
|
|
iArr3[0] = i12 ^ iArr3[0];
|
||
|
|
return iArr3;
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int[] mult512(int[] iArr, int[] iArr2) {
|
||
|
|
int[] iArr3 = new int[32];
|
||
|
|
int[] iArr4 = new int[8];
|
||
|
|
System.arraycopy(iArr, 0, iArr4, 0, Math.min(8, iArr.length));
|
||
|
|
int[] iArr5 = new int[8];
|
||
|
|
if (iArr.length > 8) {
|
||
|
|
System.arraycopy(iArr, 8, iArr5, 0, Math.min(8, iArr.length - 8));
|
||
|
|
}
|
||
|
|
int[] iArr6 = new int[8];
|
||
|
|
System.arraycopy(iArr2, 0, iArr6, 0, Math.min(8, iArr2.length));
|
||
|
|
int[] iArr7 = new int[8];
|
||
|
|
if (iArr2.length > 8) {
|
||
|
|
System.arraycopy(iArr2, 8, iArr7, 0, Math.min(8, iArr2.length - 8));
|
||
|
|
}
|
||
|
|
int[] mult256 = mult256(iArr5, iArr7);
|
||
|
|
int i = iArr3[31];
|
||
|
|
int i2 = mult256[15];
|
||
|
|
iArr3[31] = i ^ i2;
|
||
|
|
int i3 = iArr3[30];
|
||
|
|
int i4 = mult256[14];
|
||
|
|
iArr3[30] = i3 ^ i4;
|
||
|
|
int i5 = iArr3[29];
|
||
|
|
int i6 = mult256[13];
|
||
|
|
iArr3[29] = i5 ^ i6;
|
||
|
|
int i7 = iArr3[28];
|
||
|
|
int i8 = mult256[12];
|
||
|
|
iArr3[28] = i7 ^ i8;
|
||
|
|
int i9 = iArr3[27];
|
||
|
|
int i10 = mult256[11];
|
||
|
|
iArr3[27] = i9 ^ i10;
|
||
|
|
int i11 = iArr3[26];
|
||
|
|
int i12 = mult256[10];
|
||
|
|
iArr3[26] = i11 ^ i12;
|
||
|
|
int i13 = iArr3[25];
|
||
|
|
int i14 = mult256[9];
|
||
|
|
iArr3[25] = i13 ^ i14;
|
||
|
|
int i15 = iArr3[24];
|
||
|
|
int i16 = mult256[8];
|
||
|
|
iArr3[24] = i15 ^ i16;
|
||
|
|
int i17 = iArr3[23];
|
||
|
|
int i18 = mult256[7];
|
||
|
|
iArr3[23] = i17 ^ (i18 ^ i2);
|
||
|
|
int i19 = iArr3[22];
|
||
|
|
int i20 = mult256[6];
|
||
|
|
iArr3[22] = i19 ^ (i20 ^ i4);
|
||
|
|
int i21 = iArr3[21];
|
||
|
|
int i22 = mult256[5];
|
||
|
|
iArr3[21] = i21 ^ (i22 ^ i6);
|
||
|
|
int i23 = iArr3[20];
|
||
|
|
int i24 = mult256[4];
|
||
|
|
iArr3[20] = i23 ^ (i24 ^ i8);
|
||
|
|
int i25 = iArr3[19];
|
||
|
|
int i26 = mult256[3];
|
||
|
|
iArr3[19] = i25 ^ (i26 ^ i10);
|
||
|
|
int i27 = iArr3[18];
|
||
|
|
int i28 = mult256[2];
|
||
|
|
iArr3[18] = i27 ^ (i28 ^ i12);
|
||
|
|
int i29 = iArr3[17];
|
||
|
|
int i30 = mult256[1];
|
||
|
|
iArr3[17] = i29 ^ (i30 ^ i14);
|
||
|
|
int i31 = iArr3[16];
|
||
|
|
int i32 = mult256[0];
|
||
|
|
iArr3[16] = i31 ^ (i32 ^ i16);
|
||
|
|
iArr3[15] = iArr3[15] ^ i18;
|
||
|
|
iArr3[14] = iArr3[14] ^ i20;
|
||
|
|
iArr3[13] = iArr3[13] ^ i22;
|
||
|
|
iArr3[12] = iArr3[12] ^ i24;
|
||
|
|
iArr3[11] = iArr3[11] ^ i26;
|
||
|
|
iArr3[10] = iArr3[10] ^ i28;
|
||
|
|
iArr3[9] = iArr3[9] ^ i30;
|
||
|
|
iArr3[8] = iArr3[8] ^ i32;
|
||
|
|
iArr5[0] = iArr5[0] ^ iArr4[0];
|
||
|
|
iArr5[1] = iArr5[1] ^ iArr4[1];
|
||
|
|
iArr5[2] = iArr5[2] ^ iArr4[2];
|
||
|
|
iArr5[3] = iArr5[3] ^ iArr4[3];
|
||
|
|
iArr5[4] = iArr5[4] ^ iArr4[4];
|
||
|
|
iArr5[5] = iArr5[5] ^ iArr4[5];
|
||
|
|
iArr5[6] = iArr5[6] ^ iArr4[6];
|
||
|
|
iArr5[7] = iArr5[7] ^ iArr4[7];
|
||
|
|
iArr7[0] = iArr7[0] ^ iArr6[0];
|
||
|
|
iArr7[1] = iArr7[1] ^ iArr6[1];
|
||
|
|
iArr7[2] = iArr7[2] ^ iArr6[2];
|
||
|
|
iArr7[3] = iArr7[3] ^ iArr6[3];
|
||
|
|
iArr7[4] = iArr7[4] ^ iArr6[4];
|
||
|
|
iArr7[5] = iArr7[5] ^ iArr6[5];
|
||
|
|
iArr7[6] = iArr7[6] ^ iArr6[6];
|
||
|
|
iArr7[7] = iArr7[7] ^ iArr6[7];
|
||
|
|
int[] mult2562 = mult256(iArr5, iArr7);
|
||
|
|
iArr3[23] = iArr3[23] ^ mult2562[15];
|
||
|
|
iArr3[22] = iArr3[22] ^ mult2562[14];
|
||
|
|
iArr3[21] = iArr3[21] ^ mult2562[13];
|
||
|
|
iArr3[20] = iArr3[20] ^ mult2562[12];
|
||
|
|
iArr3[19] = iArr3[19] ^ mult2562[11];
|
||
|
|
iArr3[18] = iArr3[18] ^ mult2562[10];
|
||
|
|
iArr3[17] = iArr3[17] ^ mult2562[9];
|
||
|
|
iArr3[16] = iArr3[16] ^ mult2562[8];
|
||
|
|
iArr3[15] = iArr3[15] ^ mult2562[7];
|
||
|
|
iArr3[14] = iArr3[14] ^ mult2562[6];
|
||
|
|
iArr3[13] = iArr3[13] ^ mult2562[5];
|
||
|
|
iArr3[12] = iArr3[12] ^ mult2562[4];
|
||
|
|
iArr3[11] = iArr3[11] ^ mult2562[3];
|
||
|
|
iArr3[10] = iArr3[10] ^ mult2562[2];
|
||
|
|
iArr3[9] = iArr3[9] ^ mult2562[1];
|
||
|
|
iArr3[8] = mult2562[0] ^ iArr3[8];
|
||
|
|
int[] mult2563 = mult256(iArr4, iArr6);
|
||
|
|
int i33 = iArr3[23];
|
||
|
|
int i34 = mult2563[15];
|
||
|
|
iArr3[23] = i33 ^ i34;
|
||
|
|
int i35 = iArr3[22];
|
||
|
|
int i36 = mult2563[14];
|
||
|
|
iArr3[22] = i35 ^ i36;
|
||
|
|
int i37 = iArr3[21];
|
||
|
|
int i38 = mult2563[13];
|
||
|
|
iArr3[21] = i37 ^ i38;
|
||
|
|
int i39 = iArr3[20];
|
||
|
|
int i40 = mult2563[12];
|
||
|
|
iArr3[20] = i39 ^ i40;
|
||
|
|
int i41 = iArr3[19];
|
||
|
|
int i42 = mult2563[11];
|
||
|
|
iArr3[19] = i41 ^ i42;
|
||
|
|
int i43 = iArr3[18];
|
||
|
|
int i44 = mult2563[10];
|
||
|
|
iArr3[18] = i43 ^ i44;
|
||
|
|
int i45 = iArr3[17];
|
||
|
|
int i46 = mult2563[9];
|
||
|
|
iArr3[17] = i45 ^ i46;
|
||
|
|
int i47 = iArr3[16];
|
||
|
|
int i48 = mult2563[8];
|
||
|
|
iArr3[16] = i47 ^ i48;
|
||
|
|
int i49 = iArr3[15];
|
||
|
|
int i50 = mult2563[7];
|
||
|
|
iArr3[15] = i49 ^ (i34 ^ i50);
|
||
|
|
int i51 = iArr3[14];
|
||
|
|
int i52 = mult2563[6];
|
||
|
|
iArr3[14] = i51 ^ (i36 ^ i52);
|
||
|
|
int i53 = iArr3[13];
|
||
|
|
int i54 = mult2563[5];
|
||
|
|
iArr3[13] = i53 ^ (i38 ^ i54);
|
||
|
|
int i55 = iArr3[12];
|
||
|
|
int i56 = mult2563[4];
|
||
|
|
iArr3[12] = i55 ^ (i40 ^ i56);
|
||
|
|
int i57 = iArr3[11];
|
||
|
|
int i58 = mult2563[3];
|
||
|
|
iArr3[11] = i57 ^ (i42 ^ i58);
|
||
|
|
int i59 = iArr3[10];
|
||
|
|
int i60 = mult2563[2];
|
||
|
|
iArr3[10] = i59 ^ (i60 ^ i44);
|
||
|
|
int i61 = iArr3[9];
|
||
|
|
int i62 = mult2563[1];
|
||
|
|
iArr3[9] = i61 ^ (i62 ^ i46);
|
||
|
|
int i63 = iArr3[8];
|
||
|
|
int i64 = mult2563[0];
|
||
|
|
iArr3[8] = i63 ^ (i64 ^ i48);
|
||
|
|
iArr3[7] = iArr3[7] ^ i50;
|
||
|
|
iArr3[6] = iArr3[6] ^ i52;
|
||
|
|
iArr3[5] = iArr3[5] ^ i54;
|
||
|
|
iArr3[4] = iArr3[4] ^ i56;
|
||
|
|
iArr3[3] = iArr3[3] ^ i58;
|
||
|
|
iArr3[2] = iArr3[2] ^ i60;
|
||
|
|
iArr3[1] = iArr3[1] ^ i62;
|
||
|
|
iArr3[0] = i64 ^ iArr3[0];
|
||
|
|
return iArr3;
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int[] mult32(int i, int i2) {
|
||
|
|
int[] iArr = new int[2];
|
||
|
|
if (i != 0 && i2 != 0) {
|
||
|
|
long j = i2 & KeyboardMap.kValueMask;
|
||
|
|
long j2 = 0;
|
||
|
|
for (int i3 = 1; i3 <= 32; i3++) {
|
||
|
|
if ((bitMask[i3 - 1] & i) != 0) {
|
||
|
|
j2 ^= j;
|
||
|
|
}
|
||
|
|
j <<= 1;
|
||
|
|
}
|
||
|
|
iArr[1] = (int) (j2 >>> 32);
|
||
|
|
iArr[0] = (int) j2;
|
||
|
|
}
|
||
|
|
return iArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int[] mult256(int[] iArr, int[] iArr2) {
|
||
|
|
int[] iArr3 = new int[16];
|
||
|
|
int[] iArr4 = new int[4];
|
||
|
|
System.arraycopy(iArr, 0, iArr4, 0, Math.min(4, iArr.length));
|
||
|
|
int[] iArr5 = new int[4];
|
||
|
|
if (iArr.length > 4) {
|
||
|
|
System.arraycopy(iArr, 4, iArr5, 0, Math.min(4, iArr.length - 4));
|
||
|
|
}
|
||
|
|
int[] iArr6 = new int[4];
|
||
|
|
System.arraycopy(iArr2, 0, iArr6, 0, Math.min(4, iArr2.length));
|
||
|
|
int[] iArr7 = new int[4];
|
||
|
|
if (iArr2.length > 4) {
|
||
|
|
System.arraycopy(iArr2, 4, iArr7, 0, Math.min(4, iArr2.length - 4));
|
||
|
|
}
|
||
|
|
if (iArr5[3] != 0 || iArr5[2] != 0 || iArr7[3] != 0 || iArr7[2] != 0) {
|
||
|
|
int[] mult128 = mult128(iArr5, iArr7);
|
||
|
|
int i = iArr3[15];
|
||
|
|
int i2 = mult128[7];
|
||
|
|
iArr3[15] = i ^ i2;
|
||
|
|
int i3 = iArr3[14];
|
||
|
|
int i4 = mult128[6];
|
||
|
|
iArr3[14] = i3 ^ i4;
|
||
|
|
int i5 = iArr3[13];
|
||
|
|
int i6 = mult128[5];
|
||
|
|
iArr3[13] = i5 ^ i6;
|
||
|
|
int i7 = iArr3[12];
|
||
|
|
int i8 = mult128[4];
|
||
|
|
iArr3[12] = i7 ^ i8;
|
||
|
|
int i9 = iArr3[11];
|
||
|
|
int i10 = mult128[3];
|
||
|
|
iArr3[11] = i9 ^ (i10 ^ i2);
|
||
|
|
int i11 = iArr3[10];
|
||
|
|
int i12 = mult128[2];
|
||
|
|
iArr3[10] = i11 ^ (i12 ^ i4);
|
||
|
|
int i13 = iArr3[9];
|
||
|
|
int i14 = mult128[1];
|
||
|
|
iArr3[9] = i13 ^ (i14 ^ i6);
|
||
|
|
int i15 = iArr3[8];
|
||
|
|
int i16 = mult128[0];
|
||
|
|
iArr3[8] = i15 ^ (i16 ^ i8);
|
||
|
|
iArr3[7] = iArr3[7] ^ i10;
|
||
|
|
iArr3[6] = iArr3[6] ^ i12;
|
||
|
|
iArr3[5] = iArr3[5] ^ i14;
|
||
|
|
iArr3[4] = i16 ^ iArr3[4];
|
||
|
|
} else if (iArr5[1] == 0 && iArr7[1] == 0) {
|
||
|
|
int i17 = iArr5[0];
|
||
|
|
if (i17 != 0 || iArr7[0] != 0) {
|
||
|
|
int[] mult32 = mult32(i17, iArr7[0]);
|
||
|
|
int i18 = iArr3[9];
|
||
|
|
int i19 = mult32[1];
|
||
|
|
iArr3[9] = i18 ^ i19;
|
||
|
|
int i20 = iArr3[8];
|
||
|
|
int i21 = mult32[0];
|
||
|
|
iArr3[8] = i20 ^ i21;
|
||
|
|
iArr3[5] = iArr3[5] ^ i19;
|
||
|
|
iArr3[4] = i21 ^ iArr3[4];
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
int[] mult64 = mult64(iArr5, iArr7);
|
||
|
|
int i22 = iArr3[11];
|
||
|
|
int i23 = mult64[3];
|
||
|
|
iArr3[11] = i22 ^ i23;
|
||
|
|
int i24 = iArr3[10];
|
||
|
|
int i25 = mult64[2];
|
||
|
|
iArr3[10] = i24 ^ i25;
|
||
|
|
int i26 = iArr3[9];
|
||
|
|
int i27 = mult64[1];
|
||
|
|
iArr3[9] = i26 ^ i27;
|
||
|
|
int i28 = iArr3[8];
|
||
|
|
int i29 = mult64[0];
|
||
|
|
iArr3[8] = i28 ^ i29;
|
||
|
|
iArr3[7] = iArr3[7] ^ i23;
|
||
|
|
iArr3[6] = iArr3[6] ^ i25;
|
||
|
|
iArr3[5] = iArr3[5] ^ i27;
|
||
|
|
iArr3[4] = i29 ^ iArr3[4];
|
||
|
|
}
|
||
|
|
iArr5[0] = iArr5[0] ^ iArr4[0];
|
||
|
|
iArr5[1] = iArr5[1] ^ iArr4[1];
|
||
|
|
iArr5[2] = iArr5[2] ^ iArr4[2];
|
||
|
|
iArr5[3] = iArr5[3] ^ iArr4[3];
|
||
|
|
iArr7[0] = iArr7[0] ^ iArr6[0];
|
||
|
|
iArr7[1] = iArr7[1] ^ iArr6[1];
|
||
|
|
iArr7[2] = iArr7[2] ^ iArr6[2];
|
||
|
|
iArr7[3] = iArr7[3] ^ iArr6[3];
|
||
|
|
int[] mult1282 = mult128(iArr5, iArr7);
|
||
|
|
iArr3[11] = iArr3[11] ^ mult1282[7];
|
||
|
|
iArr3[10] = iArr3[10] ^ mult1282[6];
|
||
|
|
iArr3[9] = iArr3[9] ^ mult1282[5];
|
||
|
|
iArr3[8] = iArr3[8] ^ mult1282[4];
|
||
|
|
iArr3[7] = iArr3[7] ^ mult1282[3];
|
||
|
|
iArr3[6] = iArr3[6] ^ mult1282[2];
|
||
|
|
iArr3[5] = iArr3[5] ^ mult1282[1];
|
||
|
|
iArr3[4] = mult1282[0] ^ iArr3[4];
|
||
|
|
int[] mult1283 = mult128(iArr4, iArr6);
|
||
|
|
int i30 = iArr3[11];
|
||
|
|
int i31 = mult1283[7];
|
||
|
|
iArr3[11] = i30 ^ i31;
|
||
|
|
int i32 = iArr3[10];
|
||
|
|
int i33 = mult1283[6];
|
||
|
|
iArr3[10] = i32 ^ i33;
|
||
|
|
int i34 = iArr3[9];
|
||
|
|
int i35 = mult1283[5];
|
||
|
|
iArr3[9] = i34 ^ i35;
|
||
|
|
int i36 = iArr3[8];
|
||
|
|
int i37 = mult1283[4];
|
||
|
|
iArr3[8] = i36 ^ i37;
|
||
|
|
int i38 = iArr3[7];
|
||
|
|
int i39 = mult1283[3];
|
||
|
|
iArr3[7] = i38 ^ (i31 ^ i39);
|
||
|
|
int i40 = iArr3[6];
|
||
|
|
int i41 = mult1283[2];
|
||
|
|
iArr3[6] = i40 ^ (i33 ^ i41);
|
||
|
|
int i42 = iArr3[5];
|
||
|
|
int i43 = mult1283[1];
|
||
|
|
iArr3[5] = i42 ^ (i35 ^ i43);
|
||
|
|
int i44 = iArr3[4];
|
||
|
|
int i45 = mult1283[0];
|
||
|
|
iArr3[4] = i44 ^ (i45 ^ i37);
|
||
|
|
iArr3[3] = iArr3[3] ^ i39;
|
||
|
|
iArr3[2] = iArr3[2] ^ i41;
|
||
|
|
iArr3[1] = iArr3[1] ^ i43;
|
||
|
|
iArr3[0] = i45 ^ iArr3[0];
|
||
|
|
return iArr3;
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int[] mult128(int[] iArr, int[] iArr2) {
|
||
|
|
int[] iArr3 = new int[8];
|
||
|
|
int[] iArr4 = new int[2];
|
||
|
|
System.arraycopy(iArr, 0, iArr4, 0, Math.min(2, iArr.length));
|
||
|
|
int[] iArr5 = new int[2];
|
||
|
|
if (iArr.length > 2) {
|
||
|
|
System.arraycopy(iArr, 2, iArr5, 0, Math.min(2, iArr.length - 2));
|
||
|
|
}
|
||
|
|
int[] iArr6 = new int[2];
|
||
|
|
System.arraycopy(iArr2, 0, iArr6, 0, Math.min(2, iArr2.length));
|
||
|
|
int[] iArr7 = new int[2];
|
||
|
|
if (iArr2.length > 2) {
|
||
|
|
System.arraycopy(iArr2, 2, iArr7, 0, Math.min(2, iArr2.length - 2));
|
||
|
|
}
|
||
|
|
if (iArr5[1] == 0 && iArr7[1] == 0) {
|
||
|
|
int i = iArr5[0];
|
||
|
|
if (i != 0 || iArr7[0] != 0) {
|
||
|
|
int[] mult32 = mult32(i, iArr7[0]);
|
||
|
|
int i2 = iArr3[5];
|
||
|
|
int i3 = mult32[1];
|
||
|
|
iArr3[5] = i2 ^ i3;
|
||
|
|
int i4 = iArr3[4];
|
||
|
|
int i5 = mult32[0];
|
||
|
|
iArr3[4] = i4 ^ i5;
|
||
|
|
iArr3[3] = iArr3[3] ^ i3;
|
||
|
|
iArr3[2] = i5 ^ iArr3[2];
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
int[] mult64 = mult64(iArr5, iArr7);
|
||
|
|
int i6 = iArr3[7];
|
||
|
|
int i7 = mult64[3];
|
||
|
|
iArr3[7] = i6 ^ i7;
|
||
|
|
int i8 = iArr3[6];
|
||
|
|
int i9 = mult64[2];
|
||
|
|
iArr3[6] = i8 ^ i9;
|
||
|
|
int i10 = iArr3[5];
|
||
|
|
int i11 = mult64[1];
|
||
|
|
iArr3[5] = i10 ^ (i7 ^ i11);
|
||
|
|
int i12 = iArr3[4];
|
||
|
|
int i13 = mult64[0];
|
||
|
|
iArr3[4] = i12 ^ (i13 ^ i9);
|
||
|
|
iArr3[3] = iArr3[3] ^ i11;
|
||
|
|
iArr3[2] = i13 ^ iArr3[2];
|
||
|
|
}
|
||
|
|
iArr5[0] = iArr5[0] ^ iArr4[0];
|
||
|
|
iArr5[1] = iArr5[1] ^ iArr4[1];
|
||
|
|
int i14 = iArr7[0] ^ iArr6[0];
|
||
|
|
iArr7[0] = i14;
|
||
|
|
int i15 = iArr7[1] ^ iArr6[1];
|
||
|
|
iArr7[1] = i15;
|
||
|
|
if (iArr5[1] == 0 && i15 == 0) {
|
||
|
|
int[] mult322 = mult32(iArr5[0], i14);
|
||
|
|
iArr3[3] = iArr3[3] ^ mult322[1];
|
||
|
|
iArr3[2] = mult322[0] ^ iArr3[2];
|
||
|
|
} else {
|
||
|
|
int[] mult642 = mult64(iArr5, iArr7);
|
||
|
|
iArr3[5] = iArr3[5] ^ mult642[3];
|
||
|
|
iArr3[4] = iArr3[4] ^ mult642[2];
|
||
|
|
iArr3[3] = iArr3[3] ^ mult642[1];
|
||
|
|
iArr3[2] = mult642[0] ^ iArr3[2];
|
||
|
|
}
|
||
|
|
if (iArr4[1] == 0 && iArr6[1] == 0) {
|
||
|
|
int[] mult323 = mult32(iArr4[0], iArr6[0]);
|
||
|
|
int i16 = iArr3[3];
|
||
|
|
int i17 = mult323[1];
|
||
|
|
iArr3[3] = i16 ^ i17;
|
||
|
|
int i18 = iArr3[2];
|
||
|
|
int i19 = mult323[0];
|
||
|
|
iArr3[2] = i18 ^ i19;
|
||
|
|
iArr3[1] = iArr3[1] ^ i17;
|
||
|
|
iArr3[0] = i19 ^ iArr3[0];
|
||
|
|
} else {
|
||
|
|
int[] mult643 = mult64(iArr4, iArr6);
|
||
|
|
int i20 = iArr3[5];
|
||
|
|
int i21 = mult643[3];
|
||
|
|
iArr3[5] = i20 ^ i21;
|
||
|
|
int i22 = iArr3[4];
|
||
|
|
int i23 = mult643[2];
|
||
|
|
iArr3[4] = i22 ^ i23;
|
||
|
|
int i24 = iArr3[3];
|
||
|
|
int i25 = mult643[1];
|
||
|
|
iArr3[3] = i24 ^ (i21 ^ i25);
|
||
|
|
int i26 = iArr3[2];
|
||
|
|
int i27 = mult643[0];
|
||
|
|
iArr3[2] = i26 ^ (i27 ^ i23);
|
||
|
|
iArr3[1] = iArr3[1] ^ i25;
|
||
|
|
iArr3[0] = i27 ^ iArr3[0];
|
||
|
|
}
|
||
|
|
return iArr3;
|
||
|
|
}
|
||
|
|
|
||
|
|
private GF2Polynomial lower(int i) {
|
||
|
|
GF2Polynomial gF2Polynomial = new GF2Polynomial(i << 5);
|
||
|
|
System.arraycopy(this.value, 0, gF2Polynomial.value, 0, Math.min(i, this.blocks));
|
||
|
|
return gF2Polynomial;
|
||
|
|
}
|
||
|
|
|
||
|
|
private GF2Polynomial karaMult(GF2Polynomial gF2Polynomial) {
|
||
|
|
GF2Polynomial gF2Polynomial2 = new GF2Polynomial(this.len << 1);
|
||
|
|
int i = this.len;
|
||
|
|
if (i <= 32) {
|
||
|
|
gF2Polynomial2.value = mult32(this.value[0], gF2Polynomial.value[0]);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
if (i <= 64) {
|
||
|
|
gF2Polynomial2.value = mult64(this.value, gF2Polynomial.value);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
if (i <= 128) {
|
||
|
|
gF2Polynomial2.value = mult128(this.value, gF2Polynomial.value);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
if (i <= 256) {
|
||
|
|
gF2Polynomial2.value = mult256(this.value, gF2Polynomial.value);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
if (i <= 512) {
|
||
|
|
gF2Polynomial2.value = mult512(this.value, gF2Polynomial.value);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
int i2 = bitMask[IntegerFunctions.floorLog(i - 1)];
|
||
|
|
int i3 = ((i2 - 1) >> 5) + 1;
|
||
|
|
GF2Polynomial lower = lower(i3);
|
||
|
|
GF2Polynomial upper = upper(i3);
|
||
|
|
GF2Polynomial lower2 = gF2Polynomial.lower(i3);
|
||
|
|
GF2Polynomial upper2 = gF2Polynomial.upper(i3);
|
||
|
|
GF2Polynomial karaMult = upper.karaMult(upper2);
|
||
|
|
GF2Polynomial karaMult2 = lower.karaMult(lower2);
|
||
|
|
lower.addToThis(upper);
|
||
|
|
lower2.addToThis(upper2);
|
||
|
|
GF2Polynomial karaMult3 = lower.karaMult(lower2);
|
||
|
|
gF2Polynomial2.shiftLeftAddThis(karaMult, i2 << 1);
|
||
|
|
gF2Polynomial2.shiftLeftAddThis(karaMult, i2);
|
||
|
|
gF2Polynomial2.shiftLeftAddThis(karaMult3, i2);
|
||
|
|
gF2Polynomial2.shiftLeftAddThis(karaMult2, i2);
|
||
|
|
gF2Polynomial2.addToThis(karaMult2);
|
||
|
|
return gF2Polynomial2;
|
||
|
|
}
|
||
|
|
|
||
|
|
private void doShiftBlocksLeft(int i) {
|
||
|
|
int i2 = this.blocks;
|
||
|
|
int[] iArr = this.value;
|
||
|
|
if (i2 > iArr.length) {
|
||
|
|
int[] iArr2 = new int[i2];
|
||
|
|
System.arraycopy(iArr, 0, iArr2, i, i2 - i);
|
||
|
|
this.value = iArr2;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
while (true) {
|
||
|
|
i2--;
|
||
|
|
if (i2 < i) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int[] iArr3 = this.value;
|
||
|
|
iArr3[i2] = iArr3[i2 - i];
|
||
|
|
}
|
||
|
|
for (int i3 = 0; i3 < i; i3++) {
|
||
|
|
this.value[i3] = 0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(GF2Polynomial gF2Polynomial) {
|
||
|
|
this.len = gF2Polynomial.len;
|
||
|
|
this.blocks = gF2Polynomial.blocks;
|
||
|
|
this.value = IntUtils.clone(gF2Polynomial.value);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i, int[] iArr) {
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i2 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = new int[i2];
|
||
|
|
this.len = i;
|
||
|
|
System.arraycopy(iArr, 0, this.value, 0, Math.min(i2, iArr.length));
|
||
|
|
zeroUnusedBits();
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i, byte[] bArr) {
|
||
|
|
int i2;
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i3 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i3;
|
||
|
|
this.value = new int[i3];
|
||
|
|
this.len = i;
|
||
|
|
int min = Math.min(((bArr.length - 1) >> 2) + 1, i3);
|
||
|
|
int i4 = 0;
|
||
|
|
while (true) {
|
||
|
|
i2 = min - 1;
|
||
|
|
if (i4 >= i2) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int length = bArr.length - (i4 << 2);
|
||
|
|
int[] iArr = this.value;
|
||
|
|
int i5 = bArr[length - 1] & UnsignedBytes.MAX_VALUE;
|
||
|
|
iArr[i4] = i5;
|
||
|
|
int i6 = (65280 & (bArr[length - 2] << 8)) | i5;
|
||
|
|
iArr[i4] = i6;
|
||
|
|
int i7 = (16711680 & (bArr[length - 3] << 16)) | i6;
|
||
|
|
iArr[i4] = i7;
|
||
|
|
iArr[i4] = ((bArr[length - 4] << Ascii.CAN) & (-16777216)) | i7;
|
||
|
|
i4++;
|
||
|
|
}
|
||
|
|
int length2 = bArr.length - (i2 << 2);
|
||
|
|
int i8 = length2 - 1;
|
||
|
|
int[] iArr2 = this.value;
|
||
|
|
int i9 = bArr[i8] & UnsignedBytes.MAX_VALUE;
|
||
|
|
iArr2[i2] = i9;
|
||
|
|
if (i8 > 0) {
|
||
|
|
iArr2[i2] = (65280 & (bArr[length2 - 2] << 8)) | i9;
|
||
|
|
}
|
||
|
|
if (i8 > 1) {
|
||
|
|
iArr2[i2] = iArr2[i2] | (16711680 & (bArr[length2 - 3] << 16));
|
||
|
|
}
|
||
|
|
if (i8 > 2) {
|
||
|
|
iArr2[i2] = ((bArr[length2 - 4] << Ascii.CAN) & (-16777216)) | iArr2[i2];
|
||
|
|
}
|
||
|
|
zeroUnusedBits();
|
||
|
|
reduceN();
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i, Random random) {
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i2 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = new int[i2];
|
||
|
|
this.len = i;
|
||
|
|
randomize(random);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i, BigInteger bigInteger) {
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i2 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = new int[i2];
|
||
|
|
this.len = i;
|
||
|
|
byte[] byteArray = bigInteger.toByteArray();
|
||
|
|
if (byteArray[0] == 0) {
|
||
|
|
int length = byteArray.length - 1;
|
||
|
|
byte[] bArr = new byte[length];
|
||
|
|
System.arraycopy(byteArray, 1, bArr, 0, length);
|
||
|
|
byteArray = bArr;
|
||
|
|
}
|
||
|
|
int length2 = byteArray.length & 3;
|
||
|
|
int length3 = (byteArray.length - 1) >> 2;
|
||
|
|
for (int i3 = 0; i3 < length2; i3++) {
|
||
|
|
int[] iArr = this.value;
|
||
|
|
iArr[length3] = iArr[length3] | ((byteArray[i3] & UnsignedBytes.MAX_VALUE) << (((length2 - 1) - i3) << 3));
|
||
|
|
}
|
||
|
|
for (int i4 = 0; i4 <= ((byteArray.length - 4) >> 2); i4++) {
|
||
|
|
int length4 = (byteArray.length - 1) - (i4 << 2);
|
||
|
|
int[] iArr2 = this.value;
|
||
|
|
int i5 = byteArray[length4] & UnsignedBytes.MAX_VALUE;
|
||
|
|
iArr2[i4] = i5;
|
||
|
|
int i6 = i5 | ((byteArray[length4 - 1] << 8) & CipherSuite.DRAFT_TLS_DHE_RSA_WITH_AES_128_OCB);
|
||
|
|
iArr2[i4] = i6;
|
||
|
|
int i7 = i6 | ((byteArray[length4 - 2] << 16) & 16711680);
|
||
|
|
iArr2[i4] = i7;
|
||
|
|
iArr2[i4] = ((byteArray[length4 - 3] << Ascii.CAN) & (-16777216)) | i7;
|
||
|
|
}
|
||
|
|
int i8 = this.len & 31;
|
||
|
|
if (i8 != 0) {
|
||
|
|
int[] iArr3 = this.value;
|
||
|
|
int i9 = this.blocks - 1;
|
||
|
|
iArr3[i9] = reverseRightMask[i8] & iArr3[i9];
|
||
|
|
}
|
||
|
|
reduceN();
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i, String str) {
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i2 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = new int[i2];
|
||
|
|
this.len = i;
|
||
|
|
if (str.equalsIgnoreCase("ZERO")) {
|
||
|
|
assignZero();
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (str.equalsIgnoreCase("ONE")) {
|
||
|
|
assignOne();
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (str.equalsIgnoreCase("RANDOM")) {
|
||
|
|
randomize();
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (str.equalsIgnoreCase("X")) {
|
||
|
|
assignX();
|
||
|
|
} else {
|
||
|
|
if (str.equalsIgnoreCase("ALL")) {
|
||
|
|
assignAll();
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
StringBuilder sb = new StringBuilder("Error: GF2Polynomial was called using ");
|
||
|
|
sb.append(str);
|
||
|
|
sb.append(" as value!");
|
||
|
|
throw new IllegalArgumentException(sb.toString());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public GF2Polynomial(int i) {
|
||
|
|
i = i <= 0 ? 1 : i;
|
||
|
|
int i2 = ((i - 1) >> 5) + 1;
|
||
|
|
this.blocks = i2;
|
||
|
|
this.value = new int[i2];
|
||
|
|
this.len = i;
|
||
|
|
}
|
||
|
|
}
|