package p463.p473.p474.p478;

/* JADX INFO: renamed from: ޒ.ؠ.֏.އ.֏, reason: contains not printable characters */
/* JADX INFO: loaded from: classes.dex */
public class C7156 extends C7157 {

    /* JADX INFO: renamed from: ؠ, reason: contains not printable characters */
    public static byte[] f20753 = {1, 1, 1, 1, 1, 1, 1, 1, 31, 31, 31, 31, 14, 14, 14, 14, -32, -32, -32, -32, -15, -15, -15, -15, -2, -2, -2, -2, -2, -2, -2, -2, 1, -2, 1, -2, 1, -2, 1, -2, 31, -32, 31, -32, 14, -15, 14, -15, 1, -32, 1, -32, 1, -15, 1, -15, 31, -2, 31, -2, 14, -2, 14, -2, 1, 31, 1, 31, 1, 14, 1, 14, -32, -2, -32, -2, -15, -2, -15, -2, -2, 1, -2, 1, -2, 1, -2, 1, -32, 31, -32, 31, -15, 14, -15, 14, -32, 1, -32, 1, -15, 1, -15, 1, -2, 31, -2, 31, -2, 14, -2, 14, 31, 1, 31, 1, 14, 1, 14, 1, -2, -32, -2, -32, -2, -15, -2, -15};

    public C7156(byte[] bArr) {
        super(bArr);
        boolean z = false;
        if (m10533(bArr, 0)) {
            throw new IllegalArgumentException("attempt to create weak DES key");
        }
        int length = bArr.length;
        int i = 0;
        while (true) {
            if (i >= length) {
                break;
            }
            if (m10533(bArr, i)) {
                z = true;
                break;
            }
            i += 8;
        }
        if (z) {
            throw new IllegalArgumentException("attempt to create weak DESede key");
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x001c, code lost:
    
        r2 = r2 + 1;
     */
    /* JADX INFO: renamed from: ֏, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public static boolean m10533(byte[] bArr, int i) {
        if (bArr.length - i < 8) {
            throw new IllegalArgumentException("key material too short.");
        }
        int i2 = 0;
        while (i2 < 16) {
            for (int i3 = 0; i3 < 8; i3++) {
                if (bArr[i3 + i] != f20753[(i2 * 8) + i3]) {
                    break;
                }
            }
            return true;
        }
        return false;
    }
}