386 lines
12 KiB
Java
386 lines
12 KiB
Java
|
package org.bouncycastle.crypto.digests;
|
||
|
|
||
|
import com.google.common.primitives.UnsignedBytes;
|
||
|
import java.lang.reflect.Array;
|
||
|
import org.bouncycastle.crypto.BlockCipher;
|
||
|
import org.bouncycastle.crypto.ExtendedDigest;
|
||
|
import org.bouncycastle.crypto.engines.GOST28147Engine;
|
||
|
import org.bouncycastle.crypto.params.KeyParameter;
|
||
|
import org.bouncycastle.crypto.params.ParametersWithSBox;
|
||
|
import org.bouncycastle.crypto.tls.CipherSuite;
|
||
|
import org.bouncycastle.util.Arrays;
|
||
|
import org.bouncycastle.util.Memoable;
|
||
|
import org.bouncycastle.util.Pack;
|
||
|
|
||
|
/* loaded from: classes6.dex */
|
||
|
public class GOST3411Digest implements ExtendedDigest, Memoable {
|
||
|
private static final byte[] C2 = {0, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, 0, -1, 0, -1, 0, 0, -1, -1, 0, -1, 0, 0, -1, -1, 0, 0, 0, -1, -1, 0, -1};
|
||
|
private static final int DIGEST_LENGTH = 32;
|
||
|
private byte[][] C;
|
||
|
private byte[] H;
|
||
|
private byte[] K;
|
||
|
private byte[] L;
|
||
|
private byte[] M;
|
||
|
byte[] S;
|
||
|
private byte[] Sum;
|
||
|
byte[] U;
|
||
|
byte[] V;
|
||
|
byte[] W;
|
||
|
byte[] a;
|
||
|
private long byteCount;
|
||
|
private BlockCipher cipher;
|
||
|
private byte[] sBox;
|
||
|
short[] wS;
|
||
|
short[] w_S;
|
||
|
private byte[] xBuf;
|
||
|
private int xBufOff;
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.ExtendedDigest
|
||
|
public int getByteLength() {
|
||
|
return 32;
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public int getDigestSize() {
|
||
|
return 32;
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public void update(byte[] bArr, int i, int i2) {
|
||
|
while (this.xBufOff != 0 && i2 > 0) {
|
||
|
update(bArr[i]);
|
||
|
i++;
|
||
|
i2--;
|
||
|
}
|
||
|
while (true) {
|
||
|
byte[] bArr2 = this.xBuf;
|
||
|
if (i2 <= bArr2.length) {
|
||
|
break;
|
||
|
}
|
||
|
System.arraycopy(bArr, i, bArr2, 0, bArr2.length);
|
||
|
sumByteArray(this.xBuf);
|
||
|
processBlock(this.xBuf, 0);
|
||
|
byte[] bArr3 = this.xBuf;
|
||
|
i += bArr3.length;
|
||
|
i2 -= bArr3.length;
|
||
|
this.byteCount += bArr3.length;
|
||
|
}
|
||
|
while (i2 > 0) {
|
||
|
update(bArr[i]);
|
||
|
i++;
|
||
|
i2--;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public void update(byte b) {
|
||
|
byte[] bArr = this.xBuf;
|
||
|
int i = this.xBufOff;
|
||
|
int i2 = i + 1;
|
||
|
this.xBufOff = i2;
|
||
|
bArr[i] = b;
|
||
|
if (i2 == bArr.length) {
|
||
|
sumByteArray(bArr);
|
||
|
processBlock(this.xBuf, 0);
|
||
|
this.xBufOff = 0;
|
||
|
}
|
||
|
this.byteCount++;
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.util.Memoable
|
||
|
public void reset(Memoable memoable) {
|
||
|
GOST3411Digest gOST3411Digest = (GOST3411Digest) memoable;
|
||
|
byte[] bArr = gOST3411Digest.sBox;
|
||
|
this.sBox = bArr;
|
||
|
this.cipher.init(true, new ParametersWithSBox(null, bArr));
|
||
|
reset();
|
||
|
byte[] bArr2 = gOST3411Digest.H;
|
||
|
System.arraycopy(bArr2, 0, this.H, 0, bArr2.length);
|
||
|
byte[] bArr3 = gOST3411Digest.L;
|
||
|
System.arraycopy(bArr3, 0, this.L, 0, bArr3.length);
|
||
|
byte[] bArr4 = gOST3411Digest.M;
|
||
|
System.arraycopy(bArr4, 0, this.M, 0, bArr4.length);
|
||
|
byte[] bArr5 = gOST3411Digest.Sum;
|
||
|
System.arraycopy(bArr5, 0, this.Sum, 0, bArr5.length);
|
||
|
byte[] bArr6 = gOST3411Digest.C[1];
|
||
|
System.arraycopy(bArr6, 0, this.C[1], 0, bArr6.length);
|
||
|
byte[] bArr7 = gOST3411Digest.C[2];
|
||
|
System.arraycopy(bArr7, 0, this.C[2], 0, bArr7.length);
|
||
|
byte[] bArr8 = gOST3411Digest.C[3];
|
||
|
System.arraycopy(bArr8, 0, this.C[3], 0, bArr8.length);
|
||
|
byte[] bArr9 = gOST3411Digest.xBuf;
|
||
|
System.arraycopy(bArr9, 0, this.xBuf, 0, bArr9.length);
|
||
|
this.xBufOff = gOST3411Digest.xBufOff;
|
||
|
this.byteCount = gOST3411Digest.byteCount;
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public void reset() {
|
||
|
this.byteCount = 0L;
|
||
|
this.xBufOff = 0;
|
||
|
int i = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr = this.H;
|
||
|
if (i >= bArr.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr[i] = 0;
|
||
|
i++;
|
||
|
}
|
||
|
int i2 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr2 = this.L;
|
||
|
if (i2 >= bArr2.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr2[i2] = 0;
|
||
|
i2++;
|
||
|
}
|
||
|
int i3 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr3 = this.M;
|
||
|
if (i3 >= bArr3.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr3[i3] = 0;
|
||
|
i3++;
|
||
|
}
|
||
|
int i4 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr4 = this.C[1];
|
||
|
if (i4 >= bArr4.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr4[i4] = 0;
|
||
|
i4++;
|
||
|
}
|
||
|
int i5 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr5 = this.C[3];
|
||
|
if (i5 >= bArr5.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr5[i5] = 0;
|
||
|
i5++;
|
||
|
}
|
||
|
int i6 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr6 = this.Sum;
|
||
|
if (i6 >= bArr6.length) {
|
||
|
break;
|
||
|
}
|
||
|
bArr6[i6] = 0;
|
||
|
i6++;
|
||
|
}
|
||
|
int i7 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr7 = this.xBuf;
|
||
|
if (i7 >= bArr7.length) {
|
||
|
byte[] bArr8 = C2;
|
||
|
System.arraycopy(bArr8, 0, this.C[2], 0, bArr8.length);
|
||
|
return;
|
||
|
} else {
|
||
|
bArr7[i7] = 0;
|
||
|
i7++;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
protected void processBlock(byte[] bArr, int i) {
|
||
|
System.arraycopy(bArr, i, this.M, 0, 32);
|
||
|
System.arraycopy(this.H, 0, this.U, 0, 32);
|
||
|
System.arraycopy(this.M, 0, this.V, 0, 32);
|
||
|
for (int i2 = 0; i2 < 32; i2++) {
|
||
|
this.W[i2] = (byte) (this.U[i2] ^ this.V[i2]);
|
||
|
}
|
||
|
E(P(this.W), this.S, 0, this.H, 0);
|
||
|
for (int i3 = 1; i3 < 4; i3++) {
|
||
|
byte[] A = A(this.U);
|
||
|
for (int i4 = 0; i4 < 32; i4++) {
|
||
|
this.U[i4] = (byte) (A[i4] ^ this.C[i3][i4]);
|
||
|
}
|
||
|
this.V = A(A(this.V));
|
||
|
for (int i5 = 0; i5 < 32; i5++) {
|
||
|
this.W[i5] = (byte) (this.U[i5] ^ this.V[i5]);
|
||
|
}
|
||
|
int i6 = i3 << 3;
|
||
|
E(P(this.W), this.S, i6, this.H, i6);
|
||
|
}
|
||
|
for (int i7 = 0; i7 < 12; i7++) {
|
||
|
fw(this.S);
|
||
|
}
|
||
|
for (int i8 = 0; i8 < 32; i8++) {
|
||
|
byte[] bArr2 = this.S;
|
||
|
bArr2[i8] = (byte) (bArr2[i8] ^ this.M[i8]);
|
||
|
}
|
||
|
fw(this.S);
|
||
|
for (int i9 = 0; i9 < 32; i9++) {
|
||
|
byte[] bArr3 = this.S;
|
||
|
bArr3[i9] = (byte) (this.H[i9] ^ bArr3[i9]);
|
||
|
}
|
||
|
for (int i10 = 0; i10 < 61; i10++) {
|
||
|
fw(this.S);
|
||
|
}
|
||
|
byte[] bArr4 = this.S;
|
||
|
byte[] bArr5 = this.H;
|
||
|
System.arraycopy(bArr4, 0, bArr5, 0, bArr5.length);
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public String getAlgorithmName() {
|
||
|
return "GOST3411";
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.crypto.Digest
|
||
|
public int doFinal(byte[] bArr, int i) {
|
||
|
finish();
|
||
|
byte[] bArr2 = this.H;
|
||
|
System.arraycopy(bArr2, 0, bArr, i, bArr2.length);
|
||
|
reset();
|
||
|
return 32;
|
||
|
}
|
||
|
|
||
|
@Override // org.bouncycastle.util.Memoable
|
||
|
public Memoable copy() {
|
||
|
return new GOST3411Digest(this);
|
||
|
}
|
||
|
|
||
|
private void sumByteArray(byte[] bArr) {
|
||
|
int i = 0;
|
||
|
int i2 = 0;
|
||
|
while (true) {
|
||
|
byte[] bArr2 = this.Sum;
|
||
|
if (i == bArr2.length) {
|
||
|
return;
|
||
|
}
|
||
|
int i3 = (bArr2[i] & UnsignedBytes.MAX_VALUE) + (bArr[i] & UnsignedBytes.MAX_VALUE) + i2;
|
||
|
bArr2[i] = (byte) i3;
|
||
|
i2 = i3 >>> 8;
|
||
|
i++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
private void fw(byte[] bArr) {
|
||
|
cpyBytesToShort(bArr, this.wS);
|
||
|
short[] sArr = this.w_S;
|
||
|
short[] sArr2 = this.wS;
|
||
|
sArr[15] = (short) (((((sArr2[0] ^ sArr2[1]) ^ sArr2[2]) ^ sArr2[3]) ^ sArr2[12]) ^ sArr2[15]);
|
||
|
System.arraycopy(sArr2, 1, sArr, 0, 15);
|
||
|
cpyShortToBytes(this.w_S, bArr);
|
||
|
}
|
||
|
|
||
|
private void finish() {
|
||
|
Pack.longToLittleEndian(this.byteCount << 3, this.L, 0);
|
||
|
while (this.xBufOff != 0) {
|
||
|
update((byte) 0);
|
||
|
}
|
||
|
processBlock(this.L, 0);
|
||
|
processBlock(this.Sum, 0);
|
||
|
}
|
||
|
|
||
|
private void cpyShortToBytes(short[] sArr, byte[] bArr) {
|
||
|
for (int i = 0; i < bArr.length / 2; i++) {
|
||
|
int i2 = i << 1;
|
||
|
short s = sArr[i];
|
||
|
bArr[i2 + 1] = (byte) (s >> 8);
|
||
|
bArr[i2] = (byte) s;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
private void cpyBytesToShort(byte[] bArr, short[] sArr) {
|
||
|
for (int i = 0; i < bArr.length / 2; i++) {
|
||
|
int i2 = i << 1;
|
||
|
sArr[i] = (short) ((bArr[i2] & UnsignedBytes.MAX_VALUE) | ((bArr[i2 + 1] << 8) & CipherSuite.DRAFT_TLS_DHE_RSA_WITH_AES_128_OCB));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
private byte[] P(byte[] bArr) {
|
||
|
for (int i = 0; i < 8; i++) {
|
||
|
byte[] bArr2 = this.K;
|
||
|
int i2 = i << 2;
|
||
|
bArr2[i2] = bArr[i];
|
||
|
bArr2[i2 + 1] = bArr[i + 8];
|
||
|
bArr2[i2 + 2] = bArr[i + 16];
|
||
|
bArr2[i2 + 3] = bArr[i + 24];
|
||
|
}
|
||
|
return this.K;
|
||
|
}
|
||
|
|
||
|
private void E(byte[] bArr, byte[] bArr2, int i, byte[] bArr3, int i2) {
|
||
|
this.cipher.init(true, new KeyParameter(bArr));
|
||
|
this.cipher.processBlock(bArr3, i2, bArr2, i);
|
||
|
}
|
||
|
|
||
|
private byte[] A(byte[] bArr) {
|
||
|
for (int i = 0; i < 8; i++) {
|
||
|
this.a[i] = (byte) (bArr[i] ^ bArr[i + 8]);
|
||
|
}
|
||
|
System.arraycopy(bArr, 8, bArr, 0, 24);
|
||
|
System.arraycopy(this.a, 0, bArr, 24, 8);
|
||
|
return bArr;
|
||
|
}
|
||
|
|
||
|
public GOST3411Digest(byte[] bArr) {
|
||
|
this.H = new byte[32];
|
||
|
this.L = new byte[32];
|
||
|
this.M = new byte[32];
|
||
|
this.Sum = new byte[32];
|
||
|
this.C = (byte[][]) Array.newInstance((Class<?>) Byte.TYPE, 4, 32);
|
||
|
this.xBuf = new byte[32];
|
||
|
this.cipher = new GOST28147Engine();
|
||
|
this.K = new byte[32];
|
||
|
this.a = new byte[8];
|
||
|
this.wS = new short[16];
|
||
|
this.w_S = new short[16];
|
||
|
this.S = new byte[32];
|
||
|
this.U = new byte[32];
|
||
|
this.V = new byte[32];
|
||
|
this.W = new byte[32];
|
||
|
byte[] clone = Arrays.clone(bArr);
|
||
|
this.sBox = clone;
|
||
|
this.cipher.init(true, new ParametersWithSBox(null, clone));
|
||
|
reset();
|
||
|
}
|
||
|
|
||
|
public GOST3411Digest(GOST3411Digest gOST3411Digest) {
|
||
|
this.H = new byte[32];
|
||
|
this.L = new byte[32];
|
||
|
this.M = new byte[32];
|
||
|
this.Sum = new byte[32];
|
||
|
this.C = (byte[][]) Array.newInstance((Class<?>) Byte.TYPE, 4, 32);
|
||
|
this.xBuf = new byte[32];
|
||
|
this.cipher = new GOST28147Engine();
|
||
|
this.K = new byte[32];
|
||
|
this.a = new byte[8];
|
||
|
this.wS = new short[16];
|
||
|
this.w_S = new short[16];
|
||
|
this.S = new byte[32];
|
||
|
this.U = new byte[32];
|
||
|
this.V = new byte[32];
|
||
|
this.W = new byte[32];
|
||
|
reset(gOST3411Digest);
|
||
|
}
|
||
|
|
||
|
public GOST3411Digest() {
|
||
|
this.H = new byte[32];
|
||
|
this.L = new byte[32];
|
||
|
this.M = new byte[32];
|
||
|
this.Sum = new byte[32];
|
||
|
this.C = (byte[][]) Array.newInstance((Class<?>) Byte.TYPE, 4, 32);
|
||
|
this.xBuf = new byte[32];
|
||
|
this.cipher = new GOST28147Engine();
|
||
|
this.K = new byte[32];
|
||
|
this.a = new byte[8];
|
||
|
this.wS = new short[16];
|
||
|
this.w_S = new short[16];
|
||
|
this.S = new byte[32];
|
||
|
this.U = new byte[32];
|
||
|
this.V = new byte[32];
|
||
|
this.W = new byte[32];
|
||
|
byte[] sBox = GOST28147Engine.getSBox("D-A");
|
||
|
this.sBox = sBox;
|
||
|
this.cipher.init(true, new ParametersWithSBox(null, sBox));
|
||
|
reset();
|
||
|
}
|
||
|
}
|