427 lines
15 KiB
Java
427 lines
15 KiB
Java
|
package org.bouncycastle.pqc.crypto.gmss;
|
||
|
|
|
||
|
|
import com.google.common.primitives.UnsignedBytes;
|
||
|
|
import java.lang.reflect.Array;
|
||
|
|
import org.bouncycastle.crypto.Digest;
|
||
|
|
import org.bouncycastle.pqc.crypto.gmss.util.GMSSRandom;
|
||
|
|
import org.bouncycastle.util.encoders.Hex;
|
||
|
|
|
||
|
|
/* loaded from: classes6.dex */
|
||
|
|
public class GMSSRootSig {
|
||
|
|
private long big8;
|
||
|
|
private int checksum;
|
||
|
|
private int counter;
|
||
|
|
private GMSSRandom gmssRandom;
|
||
|
|
private byte[] hash;
|
||
|
|
private int height;
|
||
|
|
private int ii;
|
||
|
|
private int k;
|
||
|
|
private int keysize;
|
||
|
|
private int mdsize;
|
||
|
|
private Digest messDigestOTS;
|
||
|
|
private int messagesize;
|
||
|
|
private byte[] privateKeyOTS;
|
||
|
|
private int r;
|
||
|
|
private byte[] seed;
|
||
|
|
private byte[] sign;
|
||
|
|
private int steps;
|
||
|
|
private int test;
|
||
|
|
private long test8;
|
||
|
|
private int w;
|
||
|
|
|
||
|
|
public int getLog(int i) {
|
||
|
|
int i2 = 1;
|
||
|
|
int i3 = 2;
|
||
|
|
while (i3 < i) {
|
||
|
|
i3 <<= 1;
|
||
|
|
i2++;
|
||
|
|
}
|
||
|
|
return i2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public boolean updateSign() {
|
||
|
|
for (int i = 0; i < this.steps; i++) {
|
||
|
|
if (this.counter < this.keysize) {
|
||
|
|
oneStep();
|
||
|
|
}
|
||
|
|
if (this.counter == this.keysize) {
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
public String toString() {
|
||
|
|
StringBuilder sb = new StringBuilder("");
|
||
|
|
sb.append(this.big8);
|
||
|
|
sb.append(" ");
|
||
|
|
String obj = sb.toString();
|
||
|
|
int[] statInt = getStatInt();
|
||
|
|
byte[][] statByte = getStatByte();
|
||
|
|
for (int i = 0; i < 9; i++) {
|
||
|
|
StringBuilder sb2 = new StringBuilder();
|
||
|
|
sb2.append(obj);
|
||
|
|
sb2.append(statInt[i]);
|
||
|
|
sb2.append(" ");
|
||
|
|
obj = sb2.toString();
|
||
|
|
}
|
||
|
|
for (int i2 = 0; i2 < 5; i2++) {
|
||
|
|
StringBuilder sb3 = new StringBuilder();
|
||
|
|
sb3.append(obj);
|
||
|
|
sb3.append(new String(Hex.encode(statByte[i2])));
|
||
|
|
sb3.append(" ");
|
||
|
|
obj = sb3.toString();
|
||
|
|
}
|
||
|
|
return obj;
|
||
|
|
}
|
||
|
|
|
||
|
|
public void initSign(byte[] bArr, byte[] bArr2) {
|
||
|
|
int i;
|
||
|
|
int i2;
|
||
|
|
this.hash = new byte[this.mdsize];
|
||
|
|
this.messDigestOTS.update(bArr2, 0, bArr2.length);
|
||
|
|
byte[] bArr3 = new byte[this.messDigestOTS.getDigestSize()];
|
||
|
|
this.hash = bArr3;
|
||
|
|
this.messDigestOTS.doFinal(bArr3, 0);
|
||
|
|
int i3 = this.mdsize;
|
||
|
|
byte[] bArr4 = new byte[i3];
|
||
|
|
System.arraycopy(this.hash, 0, bArr4, 0, i3);
|
||
|
|
int log = getLog((this.messagesize << this.w) + 1);
|
||
|
|
int i4 = this.w;
|
||
|
|
int i5 = 8;
|
||
|
|
if (8 % i4 == 0) {
|
||
|
|
int i6 = 8 / i4;
|
||
|
|
i = 0;
|
||
|
|
for (int i7 = 0; i7 < this.mdsize; i7++) {
|
||
|
|
for (int i8 = 0; i8 < i6; i8++) {
|
||
|
|
byte b = bArr4[i7];
|
||
|
|
i += this.k & b;
|
||
|
|
bArr4[i7] = (byte) (b >>> this.w);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int i9 = (this.messagesize << this.w) - i;
|
||
|
|
this.checksum = i9;
|
||
|
|
int i10 = 0;
|
||
|
|
while (i10 < log) {
|
||
|
|
i += this.k & i9;
|
||
|
|
int i11 = this.w;
|
||
|
|
i9 >>>= i11;
|
||
|
|
i10 += i11;
|
||
|
|
}
|
||
|
|
} else if (i4 < 8) {
|
||
|
|
int i12 = this.mdsize / i4;
|
||
|
|
int i13 = 0;
|
||
|
|
int i14 = 0;
|
||
|
|
int i15 = 0;
|
||
|
|
while (i13 < i12) {
|
||
|
|
long j = 0;
|
||
|
|
for (int i16 = 0; i16 < this.w; i16++) {
|
||
|
|
j ^= (bArr4[i14] & UnsignedBytes.MAX_VALUE) << (i16 << 3);
|
||
|
|
i14++;
|
||
|
|
}
|
||
|
|
int i17 = 0;
|
||
|
|
while (i17 < i5) {
|
||
|
|
i15 += (int) (this.k & j);
|
||
|
|
j >>>= this.w;
|
||
|
|
i17++;
|
||
|
|
i12 = i12;
|
||
|
|
i5 = 8;
|
||
|
|
}
|
||
|
|
i13++;
|
||
|
|
i5 = 8;
|
||
|
|
}
|
||
|
|
int i18 = this.mdsize % this.w;
|
||
|
|
long j2 = 0;
|
||
|
|
for (int i19 = 0; i19 < i18; i19++) {
|
||
|
|
j2 ^= (bArr4[i14] & UnsignedBytes.MAX_VALUE) << (i19 << 3);
|
||
|
|
i14++;
|
||
|
|
}
|
||
|
|
int i20 = 0;
|
||
|
|
while (i20 < (i18 << 3)) {
|
||
|
|
i15 += (int) (this.k & j2);
|
||
|
|
int i21 = this.w;
|
||
|
|
j2 >>>= i21;
|
||
|
|
i20 += i21;
|
||
|
|
}
|
||
|
|
int i22 = (this.messagesize << this.w) - i15;
|
||
|
|
this.checksum = i22;
|
||
|
|
int i23 = 0;
|
||
|
|
i = i15;
|
||
|
|
while (i23 < log) {
|
||
|
|
i += this.k & i22;
|
||
|
|
int i24 = this.w;
|
||
|
|
i22 >>>= i24;
|
||
|
|
i23 += i24;
|
||
|
|
}
|
||
|
|
} else if (i4 < 57) {
|
||
|
|
int i25 = 0;
|
||
|
|
int i26 = 0;
|
||
|
|
while (true) {
|
||
|
|
i2 = this.mdsize;
|
||
|
|
int i27 = this.w;
|
||
|
|
if (i25 > (i2 << 3) - i27) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
int i28 = i27 + i25;
|
||
|
|
int i29 = 0;
|
||
|
|
long j3 = 0;
|
||
|
|
for (int i30 = i25 >>> 3; i30 < ((i28 + 7) >>> 3); i30++) {
|
||
|
|
j3 ^= (bArr4[i30] & UnsignedBytes.MAX_VALUE) << (i29 << 3);
|
||
|
|
i29++;
|
||
|
|
}
|
||
|
|
i26 = (int) (i26 + ((j3 >>> (i25 % 8)) & this.k));
|
||
|
|
i25 = i28;
|
||
|
|
}
|
||
|
|
int i31 = i25 >>> 3;
|
||
|
|
if (i31 < i2) {
|
||
|
|
int i32 = 0;
|
||
|
|
long j4 = 0;
|
||
|
|
while (i31 < this.mdsize) {
|
||
|
|
j4 ^= (bArr4[i31] & UnsignedBytes.MAX_VALUE) << (i32 << 3);
|
||
|
|
i32++;
|
||
|
|
i31++;
|
||
|
|
}
|
||
|
|
i26 = (int) (i26 + ((j4 >>> (i25 % 8)) & this.k));
|
||
|
|
}
|
||
|
|
int i33 = (this.messagesize << this.w) - i26;
|
||
|
|
this.checksum = i33;
|
||
|
|
int i34 = 0;
|
||
|
|
i = i26;
|
||
|
|
while (i34 < log) {
|
||
|
|
i += this.k & i33;
|
||
|
|
int i35 = this.w;
|
||
|
|
i33 >>>= i35;
|
||
|
|
i34 += i35;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
i = 0;
|
||
|
|
}
|
||
|
|
this.keysize = this.messagesize + ((int) Math.ceil(log / this.w));
|
||
|
|
this.steps = (int) Math.ceil((r2 + i) / (1 << this.height));
|
||
|
|
int i36 = this.keysize;
|
||
|
|
int i37 = this.mdsize;
|
||
|
|
this.sign = new byte[i36 * i37];
|
||
|
|
this.counter = 0;
|
||
|
|
this.test = 0;
|
||
|
|
this.ii = 0;
|
||
|
|
this.test8 = 0L;
|
||
|
|
this.r = 0;
|
||
|
|
this.privateKeyOTS = new byte[i37];
|
||
|
|
byte[] bArr5 = new byte[i37];
|
||
|
|
this.seed = bArr5;
|
||
|
|
System.arraycopy(bArr, 0, bArr5, 0, i37);
|
||
|
|
}
|
||
|
|
|
||
|
|
public byte[] getStatLong() {
|
||
|
|
long j = this.test8;
|
||
|
|
long j2 = this.big8;
|
||
|
|
return new byte[]{(byte) (j & 255), (byte) ((j >> 8) & 255), (byte) ((j >> 16) & 255), (byte) ((j >> 24) & 255), (byte) ((j >> 32) & 255), (byte) ((j >> 40) & 255), (byte) ((j >> 48) & 255), (byte) ((j >> 56) & 255), (byte) (j2 & 255), (byte) ((j2 >> 8) & 255), (byte) ((j2 >> 16) & 255), (byte) ((j2 >> 24) & 255), (byte) ((j2 >> 32) & 255), (byte) ((j2 >> 40) & 255), (byte) ((j2 >> 48) & 255), (byte) (255 & (j2 >> 56))};
|
||
|
|
}
|
||
|
|
|
||
|
|
public int[] getStatInt() {
|
||
|
|
return new int[]{this.counter, this.test, this.ii, this.r, this.steps, this.keysize, this.height, this.w, this.checksum};
|
||
|
|
}
|
||
|
|
|
||
|
|
public byte[][] getStatByte() {
|
||
|
|
byte[][] bArr = (byte[][]) Array.newInstance((Class<?>) Byte.TYPE, 5, this.mdsize);
|
||
|
|
bArr[0] = this.privateKeyOTS;
|
||
|
|
bArr[1] = this.seed;
|
||
|
|
bArr[2] = this.hash;
|
||
|
|
bArr[3] = this.sign;
|
||
|
|
bArr[4] = getStatLong();
|
||
|
|
return bArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
public byte[] getSig() {
|
||
|
|
return this.sign;
|
||
|
|
}
|
||
|
|
|
||
|
|
private void oneStep() {
|
||
|
|
long j;
|
||
|
|
int i = this.w;
|
||
|
|
if (8 % i == 0) {
|
||
|
|
int i2 = this.test;
|
||
|
|
if (i2 == 0) {
|
||
|
|
this.privateKeyOTS = this.gmssRandom.nextSeed(this.seed);
|
||
|
|
int i3 = this.ii;
|
||
|
|
if (i3 < this.mdsize) {
|
||
|
|
byte[] bArr = this.hash;
|
||
|
|
byte b = bArr[i3];
|
||
|
|
this.test = this.k & b;
|
||
|
|
bArr[i3] = (byte) (b >>> this.w);
|
||
|
|
} else {
|
||
|
|
int i4 = this.checksum;
|
||
|
|
this.test = this.k & i4;
|
||
|
|
this.checksum = i4 >>> this.w;
|
||
|
|
}
|
||
|
|
} else if (i2 > 0) {
|
||
|
|
Digest digest = this.messDigestOTS;
|
||
|
|
byte[] bArr2 = this.privateKeyOTS;
|
||
|
|
digest.update(bArr2, 0, bArr2.length);
|
||
|
|
byte[] bArr3 = new byte[this.messDigestOTS.getDigestSize()];
|
||
|
|
this.privateKeyOTS = bArr3;
|
||
|
|
this.messDigestOTS.doFinal(bArr3, 0);
|
||
|
|
this.test--;
|
||
|
|
}
|
||
|
|
if (this.test == 0) {
|
||
|
|
byte[] bArr4 = this.privateKeyOTS;
|
||
|
|
byte[] bArr5 = this.sign;
|
||
|
|
int i5 = this.counter;
|
||
|
|
int i6 = this.mdsize;
|
||
|
|
System.arraycopy(bArr4, 0, bArr5, i5 * i6, i6);
|
||
|
|
int i7 = this.counter + 1;
|
||
|
|
this.counter = i7;
|
||
|
|
if (i7 % (8 / this.w) == 0) {
|
||
|
|
this.ii++;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (i < 8) {
|
||
|
|
int i8 = this.test;
|
||
|
|
if (i8 == 0) {
|
||
|
|
int i9 = this.counter;
|
||
|
|
if (i9 % 8 == 0) {
|
||
|
|
int i10 = this.ii;
|
||
|
|
int i11 = this.mdsize;
|
||
|
|
if (i10 < i11) {
|
||
|
|
this.big8 = 0L;
|
||
|
|
if (i9 < ((i11 / i) << 3)) {
|
||
|
|
for (int i12 = 0; i12 < this.w; i12++) {
|
||
|
|
long j2 = this.big8;
|
||
|
|
byte[] bArr6 = this.hash;
|
||
|
|
int i13 = this.ii;
|
||
|
|
this.big8 = j2 ^ ((bArr6[i13] & UnsignedBytes.MAX_VALUE) << (i12 << 3));
|
||
|
|
this.ii = i13 + 1;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
for (int i14 = 0; i14 < this.mdsize % this.w; i14++) {
|
||
|
|
long j3 = this.big8;
|
||
|
|
byte[] bArr7 = this.hash;
|
||
|
|
int i15 = this.ii;
|
||
|
|
this.big8 = j3 ^ ((bArr7[i15] & UnsignedBytes.MAX_VALUE) << (i14 << 3));
|
||
|
|
this.ii = i15 + 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (this.counter == this.messagesize) {
|
||
|
|
this.big8 = this.checksum;
|
||
|
|
}
|
||
|
|
this.test = (int) (this.big8 & this.k);
|
||
|
|
this.privateKeyOTS = this.gmssRandom.nextSeed(this.seed);
|
||
|
|
} else if (i8 > 0) {
|
||
|
|
Digest digest2 = this.messDigestOTS;
|
||
|
|
byte[] bArr8 = this.privateKeyOTS;
|
||
|
|
digest2.update(bArr8, 0, bArr8.length);
|
||
|
|
byte[] bArr9 = new byte[this.messDigestOTS.getDigestSize()];
|
||
|
|
this.privateKeyOTS = bArr9;
|
||
|
|
this.messDigestOTS.doFinal(bArr9, 0);
|
||
|
|
this.test--;
|
||
|
|
}
|
||
|
|
if (this.test != 0) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
byte[] bArr10 = this.privateKeyOTS;
|
||
|
|
byte[] bArr11 = this.sign;
|
||
|
|
int i16 = this.counter;
|
||
|
|
int i17 = this.mdsize;
|
||
|
|
System.arraycopy(bArr10, 0, bArr11, i16 * i17, i17);
|
||
|
|
this.big8 >>>= this.w;
|
||
|
|
} else {
|
||
|
|
if (i >= 57) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
long j4 = this.test8;
|
||
|
|
if (j4 == 0) {
|
||
|
|
this.big8 = 0L;
|
||
|
|
this.ii = 0;
|
||
|
|
int i18 = this.r;
|
||
|
|
int i19 = i18 >>> 3;
|
||
|
|
int i20 = this.mdsize;
|
||
|
|
if (i19 < i20) {
|
||
|
|
int i21 = (i20 << 3) - i;
|
||
|
|
int i22 = i + i18;
|
||
|
|
this.r = i22;
|
||
|
|
if (i18 <= i21) {
|
||
|
|
i20 = (i22 + 7) >>> 3;
|
||
|
|
}
|
||
|
|
while (true) {
|
||
|
|
j = this.big8;
|
||
|
|
if (i19 >= i20) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
byte b2 = this.hash[i19];
|
||
|
|
int i23 = this.ii;
|
||
|
|
this.big8 = j ^ ((b2 & UnsignedBytes.MAX_VALUE) << (i23 << 3));
|
||
|
|
this.ii = i23 + 1;
|
||
|
|
i19++;
|
||
|
|
}
|
||
|
|
long j5 = j >>> (i18 % 8);
|
||
|
|
this.big8 = j5;
|
||
|
|
this.test8 = j5 & this.k;
|
||
|
|
} else {
|
||
|
|
int i24 = this.checksum;
|
||
|
|
this.test8 = this.k & i24;
|
||
|
|
this.checksum = i24 >>> i;
|
||
|
|
}
|
||
|
|
this.privateKeyOTS = this.gmssRandom.nextSeed(this.seed);
|
||
|
|
} else if (j4 > 0) {
|
||
|
|
Digest digest3 = this.messDigestOTS;
|
||
|
|
byte[] bArr12 = this.privateKeyOTS;
|
||
|
|
digest3.update(bArr12, 0, bArr12.length);
|
||
|
|
byte[] bArr13 = new byte[this.messDigestOTS.getDigestSize()];
|
||
|
|
this.privateKeyOTS = bArr13;
|
||
|
|
this.messDigestOTS.doFinal(bArr13, 0);
|
||
|
|
this.test8--;
|
||
|
|
}
|
||
|
|
if (this.test8 != 0) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
byte[] bArr14 = this.privateKeyOTS;
|
||
|
|
byte[] bArr15 = this.sign;
|
||
|
|
int i25 = this.counter;
|
||
|
|
int i26 = this.mdsize;
|
||
|
|
System.arraycopy(bArr14, 0, bArr15, i25 * i26, i26);
|
||
|
|
}
|
||
|
|
this.counter++;
|
||
|
|
}
|
||
|
|
|
||
|
|
public GMSSRootSig(Digest digest, byte[][] bArr, int[] iArr) {
|
||
|
|
this.messDigestOTS = digest;
|
||
|
|
this.gmssRandom = new GMSSRandom(digest);
|
||
|
|
this.counter = iArr[0];
|
||
|
|
this.test = iArr[1];
|
||
|
|
this.ii = iArr[2];
|
||
|
|
this.r = iArr[3];
|
||
|
|
this.steps = iArr[4];
|
||
|
|
this.keysize = iArr[5];
|
||
|
|
this.height = iArr[6];
|
||
|
|
this.w = iArr[7];
|
||
|
|
this.checksum = iArr[8];
|
||
|
|
this.mdsize = this.messDigestOTS.getDigestSize();
|
||
|
|
int i = this.w;
|
||
|
|
this.k = (1 << i) - 1;
|
||
|
|
this.messagesize = (int) Math.ceil((r10 << 3) / i);
|
||
|
|
this.privateKeyOTS = bArr[0];
|
||
|
|
this.seed = bArr[1];
|
||
|
|
this.hash = bArr[2];
|
||
|
|
this.sign = bArr[3];
|
||
|
|
byte[] bArr2 = bArr[4];
|
||
|
|
this.test8 = ((bArr2[1] & UnsignedBytes.MAX_VALUE) << 8) | (bArr2[0] & UnsignedBytes.MAX_VALUE) | ((bArr2[2] & UnsignedBytes.MAX_VALUE) << 16) | ((bArr2[3] & UnsignedBytes.MAX_VALUE) << 24) | ((bArr2[4] & UnsignedBytes.MAX_VALUE) << 32) | ((bArr2[5] & UnsignedBytes.MAX_VALUE) << 40) | ((bArr2[6] & UnsignedBytes.MAX_VALUE) << 48) | ((bArr2[7] & UnsignedBytes.MAX_VALUE) << 56);
|
||
|
|
this.big8 = (bArr2[8] & UnsignedBytes.MAX_VALUE) | ((bArr2[9] & UnsignedBytes.MAX_VALUE) << 8) | ((bArr2[10] & UnsignedBytes.MAX_VALUE) << 16) | ((bArr2[11] & UnsignedBytes.MAX_VALUE) << 24) | ((bArr2[12] & UnsignedBytes.MAX_VALUE) << 32) | ((bArr2[13] & UnsignedBytes.MAX_VALUE) << 40) | ((bArr2[14] & UnsignedBytes.MAX_VALUE) << 48) | ((bArr2[15] & UnsignedBytes.MAX_VALUE) << 56);
|
||
|
|
}
|
||
|
|
|
||
|
|
public GMSSRootSig(Digest digest, int i, int i2) {
|
||
|
|
this.messDigestOTS = digest;
|
||
|
|
this.gmssRandom = new GMSSRandom(digest);
|
||
|
|
this.mdsize = this.messDigestOTS.getDigestSize();
|
||
|
|
this.w = i;
|
||
|
|
this.height = i2;
|
||
|
|
this.k = (1 << i) - 1;
|
||
|
|
this.messagesize = (int) Math.ceil((r3 << 3) / i);
|
||
|
|
}
|
||
|
|
}
|