what-the-bank/sources/org/bouncycastle/pqc/crypto/sphincs/Horst.java

package org.bouncycastle.pqc.crypto.sphincs;

import com.google.common.primitives.UnsignedBytes;
import org.bouncycastle.asn1.cmp.PKIFailureInfo;

/* loaded from: classes6.dex */
class Horst {
    static final int HORST_K = 32;
    static final int HORST_LOGT = 16;
    static final int HORST_SIGBYTES = 13312;
    static final int HORST_SKBYTES = 32;
    static final int HORST_T = 65536;
    static final int N_MASKS = 32;

    /* JADX INFO: Access modifiers changed from: package-private */
    public static int horst_verify(HashFunctions hashFunctions, byte[] bArr, byte[] bArr2, int i, byte[] bArr3, byte[] bArr4) {
        int i2;
        byte[] bArr5 = new byte[1024];
        int i3 = i + 2048;
        int i4 = 0;
        while (i4 < 32) {
            int i5 = i4 << 1;
            int i6 = (bArr4[i5] & UnsignedBytes.MAX_VALUE) + ((bArr4[i5 + 1] & UnsignedBytes.MAX_VALUE) << 8);
            if ((i6 & 1) == 0) {
                hashFunctions.hash_n_n(bArr5, 0, bArr2, i3);
                for (int i7 = 0; i7 < 32; i7++) {
                    bArr5[i7 + 32] = bArr2[i3 + 32 + i7];
                }
            } else {
                hashFunctions.hash_n_n(bArr5, 32, bArr2, i3);
                for (int i8 = 0; i8 < 32; i8++) {
                    bArr5[i8] = bArr2[i3 + 32 + i8];
                }
            }
            int i9 = i3 + 64;
            int i10 = i6;
            int i11 = 1;
            while (i11 < 10) {
                i10 >>>= 1;
                if ((i10 & 1) == 0) {
                    i2 = i11;
                    hashFunctions.hash_2n_n_mask(bArr5, 0, bArr5, 0, bArr3, (i11 - 1) << 6);
                    for (int i12 = 0; i12 < 32; i12++) {
                        bArr5[i12 + 32] = bArr2[i9 + i12];
                    }
                } else {
                    i2 = i11;
                    hashFunctions.hash_2n_n_mask(bArr5, 32, bArr5, 0, bArr3, (i2 - 1) << 6);
                    for (int i13 = 0; i13 < 32; i13++) {
                        bArr5[i13] = bArr2[i9 + i13];
                    }
                }
                i9 += 32;
                i11 = i2 + 1;
            }
            hashFunctions.hash_2n_n_mask(bArr5, 0, bArr5, 0, bArr3, 576);
            for (int i14 = 0; i14 < 32; i14++) {
                if (bArr2[((i10 >>> 1) << 5) + i + i14] != bArr5[i14]) {
                    for (int i15 = 0; i15 < 32; i15++) {
                        bArr[i15] = 0;
                    }
                    return -1;
                }
            }
            i4++;
            i3 = i9;
        }
        for (int i16 = 0; i16 < 32; i16++) {
            hashFunctions.hash_2n_n_mask(bArr5, i16 << 5, bArr2, i + (i16 << 6), bArr3, 640);
        }
        for (int i17 = 0; i17 < 16; i17++) {
            hashFunctions.hash_2n_n_mask(bArr5, i17 << 5, bArr5, i17 << 6, bArr3, 704);
        }
        for (int i18 = 0; i18 < 8; i18++) {
            hashFunctions.hash_2n_n_mask(bArr5, i18 << 5, bArr5, i18 << 6, bArr3, 768);
        }
        for (int i19 = 0; i19 < 4; i19++) {
            hashFunctions.hash_2n_n_mask(bArr5, i19 << 5, bArr5, i19 << 6, bArr3, 832);
        }
        for (int i20 = 0; i20 < 2; i20++) {
            hashFunctions.hash_2n_n_mask(bArr5, i20 << 5, bArr5, i20 << 6, bArr3, 896);
        }
        hashFunctions.hash_2n_n_mask(bArr, 0, bArr5, 0, bArr3, 960);
        return 0;
    }

    /* JADX INFO: Access modifiers changed from: package-private */
    public static int horst_sign(HashFunctions hashFunctions, byte[] bArr, int i, byte[] bArr2, byte[] bArr3, byte[] bArr4, byte[] bArr5) {
        byte[] bArr6 = new byte[PKIFailureInfo.badSenderNonce];
        byte[] bArr7 = new byte[4194272];
        expand_seed(bArr6, bArr3);
        for (int i2 = 0; i2 < 65536; i2++) {
            hashFunctions.hash_n_n(bArr7, (65535 + i2) << 5, bArr6, i2 << 5);
        }
        for (int i3 = 0; i3 < 16; i3++) {
            long j = (1 << (16 - i3)) - 1;
            int i4 = 1 << (15 - i3);
            long j2 = i4 - 1;
            int i5 = 0;
            while (i5 < i4) {
                hashFunctions.hash_2n_n_mask(bArr7, (int) ((i5 + j2) << 5), bArr7, (int) (((i5 << 1) + j) << 5), bArr4, i3 << 6);
                i5++;
                i4 = i4;
                j2 = j2;
            }
        }
        int i6 = 2016;
        int i7 = i;
        while (i6 < 4064) {
            bArr[i7] = bArr7[i6];
            i6++;
            i7++;
        }
        for (int i8 = 0; i8 < 32; i8++) {
            int i9 = i8 << 1;
            int i10 = (bArr5[i9] & UnsignedBytes.MAX_VALUE) + ((bArr5[i9 + 1] & UnsignedBytes.MAX_VALUE) << 8);
            int i11 = 0;
            while (i11 < 32) {
                bArr[i7] = bArr6[(i10 << 5) + i11];
                i11++;
                i7++;
            }
            int i12 = i10 + 65535;
            for (int i13 = 0; i13 < 10; i13++) {
                int i14 = (i12 & 1) != 0 ? i12 + 1 : i12 - 1;
                int i15 = 0;
                while (i15 < 32) {
                    bArr[i7] = bArr7[(i14 << 5) + i15];
                    i15++;
                    i7++;
                }
                i12 = (i14 - 1) / 2;
            }
        }
        for (int i16 = 0; i16 < 32; i16++) {
            bArr2[i16] = bArr7[i16];
        }
        return HORST_SIGBYTES;
    }

    static void expand_seed(byte[] bArr, byte[] bArr2) {
        Seed.prg(bArr, 0, 2097152L, bArr2, 0);
    }
}