package org.bouncycastle.pqc.math.linearalgebra;

import android.graphics.Color;
import android.os.Process;
import android.text.AndroidCharacter;
import android.text.TextUtils;
import android.view.KeyEvent;
import android.view.MotionEvent;
import android.view.View;
import android.view.ViewConfiguration;
import com.google.common.primitives.Longs;
import io.flutter.embedding.android.KeyboardMap;
import java.lang.reflect.Method;
import java.math.BigInteger;
import java.security.SecureRandom;
import o.C4403bZM;
import o.xzZ;
import okhttp3.internal.http2.Http2Stream;
import okhttp3.internal.ws.RealWebSocket;
import okhttp3.internal.ws.WebSocketProtocol;
import org.bouncycastle.crypto.tls.CipherSuite;

/* loaded from: classes6.dex */
public class GF2nONBElement extends GF2nElement {
    private static final int MAXLONG = 64;
    private static int[] a;
    private static int e;
    private static final long[] mBitmask;
    private static final int[] mIBY64;
    private static final long[] mMaxmask;
    private int mBit;
    private int mLength;
    private long[] mPol;
    private static final byte[] $$a = {118, -18, 54, 121};
    private static final int $$b = CipherSuite.TLS_DH_anon_WITH_SEED_CBC_SHA;
    private static int $10 = 0;
    private static int $11 = 1;
    private static int c = 1;

    /* JADX WARN: Removed duplicated region for block: B:10:0x0029  */
    /* JADX WARN: Removed duplicated region for block: B:7:0x0021  */
    /* JADX WARN: Unsupported multi-entry loop pattern (BACK_EDGE: B:10:0x0029 -> B:4:0x002e). Please report as a decompilation issue!!! */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    private static void d(int r7, short r8, int r9, java.lang.Object[] r10) {
        /*
            int r8 = r8 * 4
            int r8 = r8 + 1
            byte[] r0 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.$$a
            int r9 = r9 * 2
            int r9 = 104 - r9
            int r7 = r7 * 4
            int r7 = 3 - r7
            byte[] r1 = new byte[r8]
            r2 = 0
            if (r0 != 0) goto L17
            r9 = r7
            r3 = r8
            r4 = r2
            goto L2e
        L17:
            r3 = r2
        L18:
            int r4 = r3 + 1
            byte r5 = (byte) r9
            r1[r3] = r5
            int r7 = r7 + 1
            if (r4 != r8) goto L29
            java.lang.String r7 = new java.lang.String
            r7.<init>(r1, r2)
            r10[r2] = r7
            return
        L29:
            r3 = r0[r7]
            r6 = r9
            r9 = r7
            r7 = r6
        L2e:
            int r7 = r7 + r3
            r3 = r4
            r6 = r9
            r9 = r7
            r7 = r6
            goto L18
        */
        throw new UnsupportedOperationException("Method not decompiled: org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.d(int, short, int, java.lang.Object[]):void");
    }

    private static void b(int[] iArr, int i, Object[] objArr) {
        int length;
        int[] iArr2;
        int i2;
        int[] iArr3;
        char c2;
        int i3 = 2 % 2;
        C4403bZM c4403bZM = new C4403bZM();
        char[] cArr = new char[4];
        char[] cArr2 = new char[iArr.length * 2];
        int[] iArr4 = a;
        char c3 = '0';
        int i4 = 1;
        int i5 = 0;
        if (iArr4 != null) {
            int length2 = iArr4.length;
            int[] iArr5 = new int[length2];
            int i6 = 0;
            while (i6 < length2) {
                try {
                    Object[] objArr2 = new Object[i4];
                    objArr2[0] = Integer.valueOf(iArr4[i6]);
                    Object obj = xzZ.y.get(729798706);
                    if (obj == null) {
                        obj = ((Class) xzZ.c(View.resolveSize(0, 0) + 15, 5 - Color.blue(0), (char) (TextUtils.lastIndexOf("", c3, 0) + 58135))).getMethod("i", Integer.TYPE);
                        xzZ.y.put(729798706, obj);
                    }
                    iArr5[i6] = ((Integer) ((Method) obj).invoke(null, objArr2)).intValue();
                    i6++;
                    c3 = '0';
                    i4 = 1;
                } catch (Throwable th) {
                    Throwable cause = th.getCause();
                    if (cause == null) {
                        throw th;
                    }
                    throw cause;
                }
            }
            iArr4 = iArr5;
        }
        int length3 = iArr4.length;
        int[] iArr6 = new int[length3];
        int[] iArr7 = a;
        if (iArr7 != null) {
            int i7 = $10 + 13;
            $11 = i7 % 128;
            if (i7 % 2 == 0) {
                length = iArr7.length;
                iArr2 = new int[length];
                i2 = 1;
            } else {
                length = iArr7.length;
                iArr2 = new int[length];
                i2 = 0;
            }
            while (i2 < length) {
                Object[] objArr3 = new Object[1];
                objArr3[i5] = Integer.valueOf(iArr7[i2]);
                Object obj2 = xzZ.y.get(729798706);
                if (obj2 != null) {
                    iArr3 = iArr7;
                    c2 = 55346;
                } else {
                    obj2 = ((Class) xzZ.c(15 - (ViewConfiguration.getTapTimeout() >> 16), 5 - KeyEvent.normalizeMetaState(0), (char) (TextUtils.getOffsetAfter("", 0) + 58134))).getMethod("i", Integer.TYPE);
                    iArr3 = iArr7;
                    c2 = 55346;
                    xzZ.y.put(729798706, obj2);
                }
                iArr2[i2] = ((Integer) ((Method) obj2).invoke(null, objArr3)).intValue();
                i2++;
                iArr7 = iArr3;
                i5 = 0;
            }
            iArr7 = iArr2;
        }
        int i8 = i5;
        System.arraycopy(iArr7, i8, iArr6, i8, length3);
        c4403bZM.b = i8;
        while (c4403bZM.b < iArr.length) {
            cArr[i8] = (char) (iArr[c4403bZM.b] >> 16);
            cArr[1] = (char) iArr[c4403bZM.b];
            cArr[2] = (char) (iArr[c4403bZM.b + 1] >> 16);
            cArr[3] = (char) iArr[c4403bZM.b + 1];
            c4403bZM.e = (cArr[0] << 16) + cArr[1];
            c4403bZM.a = (cArr[2] << 16) + cArr[3];
            C4403bZM.d(iArr6);
            int i9 = 0;
            for (int i10 = 16; i9 < i10; i10 = 16) {
                c4403bZM.e ^= iArr6[i9];
                try {
                    Object[] objArr4 = {c4403bZM, Integer.valueOf(C4403bZM.d(c4403bZM.e)), c4403bZM, c4403bZM};
                    Object obj3 = xzZ.y.get(-1196964548);
                    if (obj3 == null) {
                        Class cls = (Class) xzZ.c(AndroidCharacter.getMirror('0') + 'F', 4 - TextUtils.lastIndexOf("", '0', 0, 0), (char) (Process.myTid() >> 22));
                        byte b = (byte) 0;
                        byte b2 = b;
                        Object[] objArr5 = new Object[1];
                        d(b, b2, b2, objArr5);
                        obj3 = cls.getMethod((String) objArr5[0], Object.class, Integer.TYPE, Object.class, Object.class);
                        xzZ.y.put(-1196964548, obj3);
                    }
                    int intValue = ((Integer) ((Method) obj3).invoke(null, objArr4)).intValue();
                    c4403bZM.e = c4403bZM.a;
                    c4403bZM.a = intValue;
                    i9++;
                    int i11 = $11 + 29;
                    $10 = i11 % 128;
                    int i12 = i11 % 2;
                } catch (Throwable th2) {
                    Throwable cause2 = th2.getCause();
                    if (cause2 == null) {
                        throw th2;
                    }
                    throw cause2;
                }
            }
            int i13 = c4403bZM.e;
            c4403bZM.e = c4403bZM.a;
            c4403bZM.a = i13;
            c4403bZM.a ^= iArr6[16];
            c4403bZM.e ^= iArr6[17];
            int i14 = c4403bZM.e;
            int i15 = c4403bZM.a;
            cArr[0] = (char) (c4403bZM.e >>> 16);
            cArr[1] = (char) c4403bZM.e;
            cArr[2] = (char) (c4403bZM.a >>> 16);
            cArr[3] = (char) c4403bZM.a;
            C4403bZM.d(iArr6);
            cArr2[c4403bZM.b * 2] = cArr[0];
            cArr2[(c4403bZM.b * 2) + 1] = cArr[1];
            cArr2[(c4403bZM.b * 2) + 2] = cArr[2];
            cArr2[(c4403bZM.b * 2) + 3] = cArr[3];
            Object[] objArr6 = {c4403bZM, c4403bZM};
            Object obj4 = xzZ.y.get(1914371176);
            if (obj4 == null) {
                Class cls2 = (Class) xzZ.c(KeyEvent.keyCodeFromString("") + 98, (ViewConfiguration.getWindowTouchSlop() >> 8) + 5, (char) ((-1) - MotionEvent.axisFromString("")));
                byte b3 = (byte) 0;
                byte b4 = b3;
                Object[] objArr7 = new Object[1];
                d(b3, b4, (byte) (b4 + 1), objArr7);
                obj4 = cls2.getMethod((String) objArr7[0], Object.class, Object.class);
                xzZ.y.put(1914371176, obj4);
            }
            ((Method) obj4).invoke(null, objArr6);
            i8 = 0;
        }
        objArr[0] = new String(cArr2, 0, i);
    }

    static void c() {
        a = new int[]{1973206795, 831688933, -26304764, -791323380, 1952840814, -1060267879, -520180913, 625981071, -1437617085, -1416005278, 137243450, 1198063374, -1086074843, -317981528, -1798087377, -765834910, -700499373, 1383637943};
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public int trace() {
        int i = 2 % 2;
        int i2 = e + 7;
        c = i2 % 128;
        int i3 = i2 % 2;
        int i4 = this.mLength - 1;
        int i5 = 0;
        for (int i6 = 0; i6 < i4; i6++) {
            int i7 = c + 43;
            e = i7 % 128;
            int i8 = i7 % 2;
            for (int i9 = 0; i9 < 64; i9++) {
                if ((this.mPol[i6] & mBitmask[i9]) != 0) {
                    int i10 = e + 93;
                    c = i10 % 128;
                    if (i10 % 2 != 0) {
                        i5 ^= 1;
                    }
                }
            }
        }
        int i11 = this.mBit;
        for (int i12 = 0; i12 < i11; i12++) {
            if ((this.mPol[i4] & mBitmask[i12]) != 0) {
                int i13 = e + 55;
                c = i13 % 128;
                if (i13 % 2 != 0) {
                    i5 ^= 1;
                }
            }
        }
        int i14 = e + 85;
        c = i14 % 128;
        int i15 = i14 % 2;
        return i5;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public String toString(int i) {
        int i2;
        int i3;
        StringBuilder sb;
        StringBuilder sb2;
        Object obj;
        int i4 = 2 % 2;
        long[] element = getElement();
        int i5 = this.mBit;
        String str = "";
        if (i == 2) {
            int i6 = i5 - 1;
            String str2 = "";
            while (true) {
                i2 = 2110326623;
                i3 = -482439789;
                if (i6 < 0) {
                    break;
                }
                int i7 = c + 15;
                e = i7 % 128;
                if (i7 % 2 == 0 ? (element[element.length - 1] & (1 << i6)) != 0 : element[element.length >> 1] * (1 >> i6) != 0) {
                    sb2 = new StringBuilder();
                    sb2.append(str2);
                    Object[] objArr = new Object[1];
                    b(new int[]{-545993922, 1037563523}, -MotionEvent.axisFromString(""), objArr);
                    obj = objArr[0];
                } else {
                    sb2 = new StringBuilder();
                    sb2.append(str2);
                    Object[] objArr2 = new Object[1];
                    b(new int[]{-482439789, 2110326623}, 1 - KeyEvent.getDeadChar(0, 0), objArr2);
                    obj = objArr2[0];
                }
                sb2.append(((String) obj).intern());
                str2 = sb2.toString();
                i6--;
            }
            int length = element.length - 2;
            str = str2;
            while (length >= 0) {
                int i8 = 63;
                while (i8 >= 0) {
                    int i9 = c + 105;
                    e = i9 % 128;
                    if (i9 % 2 == 0 ? (element[length] & mBitmask[i8]) != 0 : element[length] + mBitmask[i8] != 1) {
                        sb = new StringBuilder();
                        sb.append(str);
                        Object[] objArr3 = new Object[1];
                        b(new int[]{-545993922, 1037563523}, 1 - (ViewConfiguration.getTapTimeout() >> 16), objArr3);
                        sb.append(((String) objArr3[0]).intern());
                    } else {
                        sb = new StringBuilder();
                        sb.append(str);
                        Object[] objArr4 = new Object[1];
                        b(new int[]{i3, i2}, (-16777215) - Color.rgb(0, 0, 0), objArr4);
                        sb.append(((String) objArr4[0]).intern());
                    }
                    str = sb.toString();
                    i8--;
                    i2 = 2110326623;
                    i3 = -482439789;
                }
                length--;
                i2 = 2110326623;
                i3 = -482439789;
            }
        } else if (i == 16) {
            char[] cArr = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'};
            for (int length2 = element.length - 1; length2 >= 0; length2--) {
                StringBuilder sb3 = new StringBuilder();
                sb3.append(str);
                sb3.append(cArr[((int) (element[length2] >>> 60)) & 15]);
                String obj2 = sb3.toString();
                StringBuilder sb4 = new StringBuilder();
                sb4.append(obj2);
                sb4.append(cArr[((int) (element[length2] >>> 56)) & 15]);
                String obj3 = sb4.toString();
                StringBuilder sb5 = new StringBuilder();
                sb5.append(obj3);
                sb5.append(cArr[((int) (element[length2] >>> 52)) & 15]);
                String obj4 = sb5.toString();
                StringBuilder sb6 = new StringBuilder();
                sb6.append(obj4);
                sb6.append(cArr[((int) (element[length2] >>> 48)) & 15]);
                String obj5 = sb6.toString();
                StringBuilder sb7 = new StringBuilder();
                sb7.append(obj5);
                sb7.append(cArr[((int) (element[length2] >>> 44)) & 15]);
                String obj6 = sb7.toString();
                StringBuilder sb8 = new StringBuilder();
                sb8.append(obj6);
                sb8.append(cArr[((int) (element[length2] >>> 40)) & 15]);
                String obj7 = sb8.toString();
                StringBuilder sb9 = new StringBuilder();
                sb9.append(obj7);
                sb9.append(cArr[((int) (element[length2] >>> 36)) & 15]);
                String obj8 = sb9.toString();
                StringBuilder sb10 = new StringBuilder();
                sb10.append(obj8);
                sb10.append(cArr[((int) (element[length2] >>> 32)) & 15]);
                String obj9 = sb10.toString();
                StringBuilder sb11 = new StringBuilder();
                sb11.append(obj9);
                sb11.append(cArr[((int) (element[length2] >>> 28)) & 15]);
                String obj10 = sb11.toString();
                StringBuilder sb12 = new StringBuilder();
                sb12.append(obj10);
                sb12.append(cArr[((int) (element[length2] >>> 24)) & 15]);
                String obj11 = sb12.toString();
                StringBuilder sb13 = new StringBuilder();
                sb13.append(obj11);
                sb13.append(cArr[((int) (element[length2] >>> 20)) & 15]);
                String obj12 = sb13.toString();
                StringBuilder sb14 = new StringBuilder();
                sb14.append(obj12);
                sb14.append(cArr[((int) (element[length2] >>> 16)) & 15]);
                String obj13 = sb14.toString();
                StringBuilder sb15 = new StringBuilder();
                sb15.append(obj13);
                sb15.append(cArr[((int) (element[length2] >>> 12)) & 15]);
                String obj14 = sb15.toString();
                StringBuilder sb16 = new StringBuilder();
                sb16.append(obj14);
                sb16.append(cArr[((int) (element[length2] >>> 8)) & 15]);
                String obj15 = sb16.toString();
                StringBuilder sb17 = new StringBuilder();
                sb17.append(obj15);
                sb17.append(cArr[((int) (element[length2] >>> 4)) & 15]);
                String obj16 = sb17.toString();
                StringBuilder sb18 = new StringBuilder();
                sb18.append(obj16);
                sb18.append(cArr[((int) element[length2]) & 15]);
                String obj17 = sb18.toString();
                StringBuilder sb19 = new StringBuilder();
                sb19.append(obj17);
                sb19.append(" ");
                str = sb19.toString();
            }
        }
        int i10 = c + 33;
        e = i10 % 128;
        int i11 = i10 % 2;
        return str;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public String toString() {
        int i = 2 % 2;
        int i2 = e + 113;
        c = i2 % 128;
        int i3 = i2 % 2;
        String gF2nONBElement = toString(16);
        int i4 = c + 115;
        e = i4 % 128;
        int i5 = i4 % 2;
        return gF2nONBElement;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public BigInteger toFlexiBigInt() {
        int i = 2 % 2;
        BigInteger bigInteger = new BigInteger(1, toByteArray());
        int i2 = c + 41;
        e = i2 % 128;
        if (i2 % 2 == 0) {
            return bigInteger;
        }
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public byte[] toByteArray() {
        int i = 2 % 2;
        int i2 = ((this.mDegree - 1) >> 3) + 1;
        byte[] bArr = new byte[i2];
        int i3 = 0;
        while (i3 < i2) {
            int i4 = (i3 & 7) << 3;
            bArr[(i2 - i3) - 1] = (byte) ((this.mPol[i3 >>> 3] & (255 << i4)) >>> i4);
            i3++;
            int i5 = c + 67;
            e = i5 % 128;
            int i6 = i5 % 2;
        }
        int i7 = e + 53;
        c = i7 % 128;
        int i8 = i7 % 2;
        return bArr;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public boolean testRightmostBit() {
        int i = 2 % 2;
        int i2 = e + 73;
        int i3 = i2 % 128;
        c = i3;
        int i4 = i2 % 2;
        if ((this.mPol[this.mLength - 1] & mBitmask[this.mBit - 1]) != 0) {
            return true;
        }
        int i5 = i3 + 41;
        e = i5 % 128;
        return i5 % 2 != 0;
    }

    /* JADX INFO: Access modifiers changed from: package-private */
    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public boolean testBit(int i) {
        int i2 = 2 % 2;
        if (i < 0) {
            return false;
        }
        int i3 = e + 17;
        c = i3 % 128;
        int i4 = i3 % 2;
        if (i > this.mDegree) {
            int i5 = c + 9;
            e = i5 % 128;
            if (i5 % 2 == 0) {
                return false;
            }
        } else if ((this.mPol[i >>> 6] & mBitmask[i & 63]) == 0) {
            return false;
        }
        return true;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public void squareThis() {
        boolean z;
        int i = 2 % 2;
        long[] element = getElement();
        int i2 = this.mLength - 1;
        int i3 = this.mBit;
        int i4 = i3 - 1;
        long[] jArr = mBitmask;
        long j = jArr[63];
        long j2 = 0;
        boolean z2 = (element[i2] & jArr[i4]) != 0;
        int i5 = e + 119;
        c = i5 % 128;
        int i6 = i5 % 2;
        int i7 = 0;
        while (i7 < i2) {
            long j3 = element[i7];
            if ((j3 & j) != j2) {
                z = true;
            } else {
                int i8 = c + 5;
                e = i8 % 128;
                int i9 = i8 % 2;
                z = false;
            }
            long j4 = j3 << 1;
            element[i7] = j4;
            if (!(!z2)) {
                element[i7] = j4 ^ 1;
            }
            i7++;
            z2 = z;
            j2 = 0;
        }
        long j5 = element[i2];
        long[] jArr2 = mBitmask;
        boolean z3 = (jArr2[i4] & j5) != 0;
        long j6 = j5 << 1;
        element[i2] = j6;
        if (z2) {
            element[i2] = j6 ^ 1;
        }
        if (z3) {
            element[i2] = jArr2[i3] ^ element[i2];
        }
        assign(element);
    }

    /* JADX WARN: Code restructure failed: missing block: B:10:0x0052, code lost:
    
        r15 = r15 + 113;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r15 % 128;
        r15 = r15 % 2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:11:0x0059, code lost:
    
        r4 = 1;
        r16 = false;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x005c, code lost:
    
        r17 = r17 >>> r4;
        r2[r10] = r17;
     */
    /* JADX WARN: Code restructure failed: missing block: B:13:0x0060, code lost:
    
        if (r9 == false) goto L33;
     */
    /* JADX WARN: Code restructure failed: missing block: B:14:0x0062, code lost:
    
        if (r10 != r3) goto L27;
     */
    /* JADX WARN: Code restructure failed: missing block: B:15:0x0064, code lost:
    
        r2[r10] = r17 ^ org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask[r5 - 1];
        r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c + 101;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r6 % 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0078, code lost:
    
        if ((r6 % 2) == 0) goto L34;
     */
    /* JADX WARN: Code restructure failed: missing block: B:17:0x007a, code lost:
    
        r6 = 5 / 2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x0081, code lost:
    
        r10 = r10 - 1;
        r9 = r16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:21:0x007d, code lost:
    
        r2[r10] = r17 ^ r7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:24:0x0044, code lost:
    
        r15 = r15 + 117;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r15 % 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:25:0x004b, code lost:
    
        if ((r15 % 2) != 0) goto L18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:26:0x004e, code lost:
    
        r4 = 1;
        r16 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0042, code lost:
    
        if ((r17 & 1) != 0) goto L15;
     */
    /* JADX WARN: Code restructure failed: missing block: B:9:0x0039, code lost:
    
        if ((r17 % 0) != 1) goto L15;
     */
    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    public void squareRootThis() {
        /*
            r21 = this;
            r0 = r21
            r1 = 2
            int r2 = r1 % r1
            long[] r2 = r21.getElement()
            int r3 = r0.mLength
            r4 = 1
            int r3 = r3 - r4
            int r5 = r0.mBit
            long[] r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask
            r7 = 63
            r7 = r6[r7]
            r6 = 0
            r9 = r2[r6]
            r11 = 1
            long r9 = r9 & r11
            r13 = 0
            int r9 = (r9 > r13 ? 1 : (r9 == r13 ? 0 : -1))
            if (r9 == 0) goto L23
            r9 = r4
            goto L24
        L23:
            r9 = r6
        L24:
            r10 = r3
        L25:
            if (r10 < 0) goto L87
            int r15 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e
            int r6 = r15 + 65
            int r4 = r6 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4
            int r6 = r6 % 2
            if (r6 != 0) goto L3c
            r17 = r2[r10]
            long r19 = r17 % r13
            int r4 = (r19 > r11 ? 1 : (r19 == r11 ? 0 : -1))
            if (r4 == 0) goto L52
            goto L44
        L3c:
            r17 = r2[r10]
            long r19 = r17 & r11
            int r4 = (r19 > r13 ? 1 : (r19 == r13 ? 0 : -1))
            if (r4 == 0) goto L52
        L44:
            int r15 = r15 + 117
            int r4 = r15 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4
            int r15 = r15 % r1
            if (r15 != 0) goto L4e
            goto L59
        L4e:
            r4 = 1
            r16 = 1
            goto L5c
        L52:
            int r15 = r15 + 113
            int r4 = r15 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4
            int r15 = r15 % r1
        L59:
            r4 = 1
            r16 = 0
        L5c:
            long r17 = r17 >>> r4
            r2[r10] = r17
            if (r9 == 0) goto L81
            if (r10 != r3) goto L7d
            long[] r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask
            int r9 = r5 + (-1)
            r19 = r6[r9]
            long r17 = r17 ^ r19
            r2[r10] = r17
            int r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c
            int r6 = r6 + 101
            int r9 = r6 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r9
            int r6 = r6 % 2
            if (r6 == 0) goto L81
            r6 = 5
            int r6 = r6 / r1
            goto L81
        L7d:
            long r17 = r17 ^ r7
            r2[r10] = r17
        L81:
            int r10 = r10 + (-1)
            r9 = r16
            r6 = 0
            goto L25
        L87:
            r0.assign(r2)
            return
        */
        throw new UnsupportedOperationException("Method not decompiled: org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.squareRootThis():void");
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public GF2nElement squareRoot() {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.squareRootThis();
        int i2 = e + 73;
        c = i2 % 128;
        if (i2 % 2 != 0) {
            return gF2nONBElement;
        }
        Object obj = null;
        obj.hashCode();
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public GF2nElement square() {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.squareThis();
        int i2 = c + 53;
        e = i2 % 128;
        if (i2 % 2 == 0) {
            return gF2nONBElement;
        }
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public GF2nElement solveQuadraticEquation() throws RuntimeException {
        long j;
        long[] jArr;
        int i;
        long j2;
        int i2 = 2 % 2;
        int i3 = c + 121;
        e = i3 % 128;
        if (i3 % 2 == 0 ? trace() == 1 : trace() == 1) {
            throw new RuntimeException();
        }
        int i4 = e + 117;
        c = i4 % 128;
        if (i4 % 2 == 0) {
            j = mBitmask[29];
            jArr = new long[this.mLength];
            i = 1;
            j2 = 1;
        } else {
            j = mBitmask[63];
            jArr = new long[this.mLength];
            i = 0;
            j2 = 0;
        }
        for (int i5 = 1; i < this.mLength - i5; i5 = 1) {
            for (int i6 = i5; i6 < 64; i6++) {
                long[] jArr2 = mBitmask;
                long j3 = jArr2[i6];
                long j4 = j3 & this.mPol[i];
                if (j4 == 0 || (j2 & jArr2[i6 - 1]) == 0) {
                    if (j4 == 0) {
                        int i7 = c + 85;
                        e = i7 % 128;
                        int i8 = i7 % 2;
                        if ((jArr2[i6 - 1] & j2) == 0) {
                        }
                    }
                    j2 ^= j3;
                }
            }
            jArr[i] = j2;
            long j5 = j2 & j;
            j2 = ((j5 == 0 || (this.mPol[i + 1] & 1) != 1) && !(j5 == 0 && (this.mPol[i + 1] & 1) == 0)) ? 1L : 0L;
            i++;
            int i9 = c + 51;
            e = i9 % 128;
            int i10 = i9 % 2;
        }
        int i11 = this.mDegree;
        long j6 = this.mPol[this.mLength - 1];
        for (int i12 = 1; i12 < (i11 & 63); i12++) {
            long[] jArr3 = mBitmask;
            long j7 = jArr3[i12];
            long j8 = j7 & j6;
            if ((j8 == 0 || (jArr3[i12 - 1] & j2) == 0) && (j8 != 0 || (jArr3[i12 - 1] & j2) != 0)) {
                j2 ^= j7;
            }
        }
        jArr[this.mLength - 1] = j2;
        return new GF2nONBElement((GF2nONBField) this.mField, jArr);
    }

    /* JADX INFO: Access modifiers changed from: package-private */
    public void reverseOrder() {
        int i = 2 % 2;
        int i2 = c + 89;
        e = i2 % 128;
        int i3 = i2 % 2;
        long[] elementReverseOrder = getElementReverseOrder();
        if (i3 == 0) {
            this.mPol = elementReverseOrder;
        } else {
            this.mPol = elementReverseOrder;
            int i4 = 47 / 0;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:101:0x01bf, code lost:
    
        assign(r5);
     */
    /* JADX WARN: Code restructure failed: missing block: B:102:0x01c2, code lost:
    
        return;
     */
    /* JADX WARN: Code restructure failed: missing block: B:104:0x0032, code lost:
    
        squareThis();
     */
    /* JADX WARN: Code restructure failed: missing block: B:105:0x0035, code lost:
    
        return;
     */
    /* JADX WARN: Code restructure failed: missing block: B:106:0x0030, code lost:
    
        if (r1 != false) goto L12;
     */
    /* JADX WARN: Code restructure failed: missing block: B:11:0x0056, code lost:
    
        if (r14 >= r29.mDegree) goto L97;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0058, code lost:
    
        r15 = r6;
        r16 = r15;
     */
    /* JADX WARN: Code restructure failed: missing block: B:14:0x005f, code lost:
    
        if (r15 >= r29.mDegree) goto L101;
     */
    /* JADX WARN: Code restructure failed: missing block: B:15:0x0061, code lost:
    
        r4 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e + 19;
        r6 = r4 % 128;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r6;
        r4 = r4 % 2;
        r4 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mIBY64;
        r21 = r4[r15];
        r22 = r7[r15];
        r23 = r22[0];
        r24 = r4[r23];
        r25 = r1[r21];
        r21 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0082, code lost:
    
        if ((r25 & r21[r15 & 63]) == 0) goto L34;
     */
    /* JADX WARN: Code restructure failed: missing block: B:18:0x008e, code lost:
    
        if ((r3[r24] & r21[r23 & 63]) == 0) goto L28;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x0090, code lost:
    
        r6 = r6 + 53;
        r23 = r7;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r6 % 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:20:0x0099, code lost:
    
        if ((r6 % 2) == 0) goto L27;
     */
    /* JADX WARN: Code restructure failed: missing block: B:21:0x009c, code lost:
    
        r16 = r16 ^ 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:22:0x00a1, code lost:
    
        r7 = r22[1];
     */
    /* JADX WARN: Code restructure failed: missing block: B:23:0x00a5, code lost:
    
        if (r7 == (-1)) goto L103;
     */
    /* JADX WARN: Code restructure failed: missing block: B:25:0x00b3, code lost:
    
        if ((r3[r4[r7]] & r21[r7 & 63]) == 0) goto L104;
     */
    /* JADX WARN: Code restructure failed: missing block: B:26:0x00b5, code lost:
    
        r16 = r16 ^ 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x00ba, code lost:
    
        r15 = r15 + 1;
        r7 = r23;
     */
    /* JADX WARN: Code restructure failed: missing block: B:31:0x009f, code lost:
    
        r23 = r7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:32:0x00b8, code lost:
    
        r23 = r7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:35:0x00c0, code lost:
    
        r23 = r7;
        r4 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mIBY64[r14];
     */
    /* JADX WARN: Code restructure failed: missing block: B:36:0x00c6, code lost:
    
        if (r16 == 0) goto L39;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x00c8, code lost:
    
        r5[r4] = r5[r4] ^ org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask[r14 & 63];
     */
    /* JADX WARN: Code restructure failed: missing block: B:39:0x00d9, code lost:
    
        if (r29.mLength <= 1) goto L75;
     */
    /* JADX WARN: Code restructure failed: missing block: B:41:0x00e0, code lost:
    
        if ((r1[r9] & 1) != 1) goto L44;
     */
    /* JADX WARN: Code restructure failed: missing block: B:42:0x00e2, code lost:
    
        r4 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:43:0x00e5, code lost:
    
        r15 = r8 - 2;
        r16 = r15;
     */
    /* JADX WARN: Code restructure failed: missing block: B:44:0x00e9, code lost:
    
        if (r16 < 0) goto L106;
     */
    /* JADX WARN: Code restructure failed: missing block: B:45:0x00eb, code lost:
    
        r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e + 105;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r6 % 128;
        r6 = r6 % 2;
        r6 = r1[r16];
     */
    /* JADX WARN: Code restructure failed: missing block: B:46:0x00fc, code lost:
    
        if ((r6 & 1) == 0) goto L50;
     */
    /* JADX WARN: Code restructure failed: missing block: B:47:0x00fe, code lost:
    
        r17 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:48:0x0103, code lost:
    
        r6 = r6 >>> 1;
        r1[r16] = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:49:0x0109, code lost:
    
        if (r4 == false) goto L108;
     */
    /* JADX WARN: Code restructure failed: missing block: B:50:0x010b, code lost:
    
        r1[r16] = r6 ^ r12;
     */
    /* JADX WARN: Code restructure failed: missing block: B:52:0x010e, code lost:
    
        r16 = r16 - 1;
        r4 = r17;
     */
    /* JADX WARN: Code restructure failed: missing block: B:54:0x0101, code lost:
    
        r17 = false;
     */
    /* JADX WARN: Code restructure failed: missing block: B:56:0x0115, code lost:
    
        r6 = r1[r9] >>> 1;
        r1[r9] = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:57:0x011d, code lost:
    
        if (r4 == false) goto L58;
     */
    /* JADX WARN: Code restructure failed: missing block: B:58:0x011f, code lost:
    
        r1[r9] = r6 ^ r10;
     */
    /* JADX WARN: Code restructure failed: missing block: B:60:0x012a, code lost:
    
        if ((r3[r9] & 1) != 1) goto L61;
     */
    /* JADX WARN: Code restructure failed: missing block: B:61:0x012c, code lost:
    
        r4 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e + 111;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4 % 128;
        r4 = r4 % 2;
        r4 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:63:0x0138, code lost:
    
        if (r15 < 0) goto L109;
     */
    /* JADX WARN: Code restructure failed: missing block: B:64:0x013a, code lost:
    
        r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e + 71;
        r7 = r6 % 128;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r7;
        r6 = r6 % 2;
        r21 = r3[r15];
     */
    /* JADX WARN: Code restructure failed: missing block: B:65:0x014c, code lost:
    
        if ((r21 & 1) == 0) goto L66;
     */
    /* JADX WARN: Code restructure failed: missing block: B:66:0x014e, code lost:
    
        r7 = r7 + 89;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r7 % 128;
        r7 = r7 % 2;
        r6 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:67:0x0158, code lost:
    
        r21 = r21 >>> 1;
        r3[r15] = r21;
     */
    /* JADX WARN: Code restructure failed: missing block: B:68:0x015d, code lost:
    
        if (r4 == false) goto L111;
     */
    /* JADX WARN: Code restructure failed: missing block: B:69:0x015f, code lost:
    
        r3[r15] = r21 ^ r12;
     */
    /* JADX WARN: Code restructure failed: missing block: B:71:0x0163, code lost:
    
        r15 = r15 - 1;
        r4 = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:73:0x0157, code lost:
    
        r6 = false;
     */
    /* JADX WARN: Code restructure failed: missing block: B:75:0x0167, code lost:
    
        r6 = r3[r9] >>> 1;
        r3[r9] = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:76:0x016d, code lost:
    
        if (r4 == false) goto L74;
     */
    /* JADX WARN: Code restructure failed: missing block: B:77:0x016f, code lost:
    
        r3[r9] = r6 ^ r10;
     */
    /* JADX WARN: Code restructure failed: missing block: B:78:0x0172, code lost:
    
        r20 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:80:0x01b7, code lost:
    
        r14 = r14 + 1;
        r6 = r20;
        r7 = r23;
     */
    /* JADX WARN: Code restructure failed: missing block: B:81:0x0137, code lost:
    
        r4 = false;
     */
    /* JADX WARN: Code restructure failed: missing block: B:82:0x00e4, code lost:
    
        r4 = false;
     */
    /* JADX WARN: Code restructure failed: missing block: B:83:0x0176, code lost:
    
        r6 = r1[0];
     */
    /* JADX WARN: Code restructure failed: missing block: B:84:0x017f, code lost:
    
        if ((r6 & 1) != 1) goto L78;
     */
    /* JADX WARN: Code restructure failed: missing block: B:85:0x0181, code lost:
    
        r15 = 1;
        r17 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:86:0x0188, code lost:
    
        r6 = r6 >>> r15;
        r1[0] = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:87:0x018b, code lost:
    
        if (r17 == false) goto L82;
     */
    /* JADX WARN: Code restructure failed: missing block: B:88:0x018d, code lost:
    
        r4 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e + r15;
        org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4 % 128;
        r4 = r4 % 2;
        r20 = 0;
        r1[0] = r6 ^ r10;
     */
    /* JADX WARN: Code restructure failed: missing block: B:89:0x019e, code lost:
    
        r6 = r3[r20];
     */
    /* JADX WARN: Code restructure failed: missing block: B:8:0x002d, code lost:
    
        if (r1 != false) goto L12;
     */
    /* JADX WARN: Code restructure failed: missing block: B:90:0x01a6, code lost:
    
        if ((r6 & 1) != 1) goto L86;
     */
    /* JADX WARN: Code restructure failed: missing block: B:91:0x01a8, code lost:
    
        r4 = 1;
        r17 = 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:92:0x01af, code lost:
    
        r6 = r6 >>> r4;
        r3[r20] = r6;
     */
    /* JADX WARN: Code restructure failed: missing block: B:93:0x01b2, code lost:
    
        if (r17 == 0) goto L100;
     */
    /* JADX WARN: Code restructure failed: missing block: B:94:0x01b4, code lost:
    
        r3[r20] = r6 ^ r10;
     */
    /* JADX WARN: Code restructure failed: missing block: B:97:0x01ac, code lost:
    
        r17 = r20;
        r4 = 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:98:0x019c, code lost:
    
        r20 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:99:0x0185, code lost:
    
        r17 = false;
        r15 = 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:9:0x0036, code lost:
    
        r1 = r29.mPol;
        r3 = r5.mPol;
        r5 = new long[r29.mLength];
        r7 = ((org.bouncycastle.pqc.math.linearalgebra.GF2nONBField) r29.mField).mMult;
        r8 = r29.mLength;
        r9 = r8 - 1;
        r10 = r29.mBit;
        r11 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mBitmask;
        r12 = r11[63];
        r10 = r11[r10 - 1];
        r14 = 0;
     */
    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    public void multiplyThisBy(org.bouncycastle.pqc.math.linearalgebra.GFElement r30) throws java.lang.RuntimeException {
        /*
            Method dump skipped, instructions count: 465
            To view this dump add '--comments-level debug' option
        */
        throw new UnsupportedOperationException("Method not decompiled: org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.multiplyThisBy(org.bouncycastle.pqc.math.linearalgebra.GFElement):void");
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public GFElement multiply(GFElement gFElement) throws RuntimeException {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.multiplyThisBy(gFElement);
        int i2 = c + 15;
        e = i2 % 128;
        int i3 = i2 % 2;
        return gF2nONBElement;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public boolean isZero() {
        int i = 2 % 2;
        boolean z = true;
        for (int i2 = 0; i2 < this.mLength; i2++) {
            int i3 = e;
            int i4 = i3 + 105;
            c = i4 % 128;
            if (i4 % 2 == 0) {
                Object obj = null;
                obj.hashCode();
                throw null;
            }
            if (!z) {
                break;
            }
            if (z && this.mPol[i2] == 0) {
                int i5 = i3 + 27;
                c = i5 % 128;
                if (i5 % 2 != 0) {
                    z = true;
                }
            }
            z = false;
        }
        return z;
    }

    /* JADX WARN: Code restructure failed: missing block: B:22:0x0060, code lost:
    
        if ((r3 / r0[r5 % 1]) == r0[r5]) goto L24;
     */
    /* JADX WARN: Code restructure failed: missing block: B:23:0x0071, code lost:
    
        r1 = true;
     */
    /* JADX WARN: Code restructure failed: missing block: B:25:0x006f, code lost:
    
        if ((r3 & r5) == r5) goto L24;
     */
    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    public boolean isOne() {
        /*
            r9 = this;
            r0 = 2
            int r1 = r0 % r0
            r1 = 0
            r2 = 1
            r3 = r1
            r4 = r2
        L7:
            int r5 = r9.mLength
            int r5 = r5 - r2
            if (r3 >= r5) goto L39
            int r6 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c
            int r7 = r6 + 63
            int r8 = r7 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r8
            int r7 = r7 % r0
            if (r4 == 0) goto L39
            int r6 = r6 + 37
            int r5 = r6 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e = r5
            int r6 = r6 % r0
            r4 = r4 ^ 1
            if (r4 == r2) goto L35
            int r5 = r5 + 61
            int r4 = r5 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4
            int r5 = r5 % r0
            long[] r4 = r9.mPol
            r5 = r4[r3]
            r7 = -1
            int r4 = (r5 > r7 ? 1 : (r5 == r7 ? 0 : -1))
            if (r4 != 0) goto L35
            r4 = r2
            goto L36
        L35:
            r4 = r1
        L36:
            int r3 = r3 + 1
            goto L7
        L39:
            if (r4 == 0) goto L73
            int r3 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.e
            int r6 = r3 + 75
            int r7 = r6 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r7
            int r6 = r6 % r0
            if (r4 == 0) goto L72
            int r3 = r3 + 53
            int r4 = r3 % 128
            org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.c = r4
            int r3 = r3 % r0
            long[] r0 = r9.mPol
            if (r3 != 0) goto L63
            r3 = r0[r1]
            long[] r0 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mMaxmask
            int r5 = r9.mBit
            int r6 = r5 % 1
            r6 = r0[r6]
            long r3 = r3 / r6
            r5 = r0[r5]
            int r0 = (r3 > r5 ? 1 : (r3 == r5 ? 0 : -1))
            if (r0 != 0) goto L72
            goto L71
        L63:
            r3 = r0[r5]
            long[] r0 = org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.mMaxmask
            int r5 = r9.mBit
            int r5 = r5 - r2
            r5 = r0[r5]
            long r3 = r3 & r5
            int r0 = (r3 > r5 ? 1 : (r3 == r5 ? 0 : -1))
            if (r0 != 0) goto L72
        L71:
            r1 = r2
        L72:
            r4 = r1
        L73:
            return r4
        */
        throw new UnsupportedOperationException("Method not decompiled: org.bouncycastle.pqc.math.linearalgebra.GF2nONBElement.isOne():boolean");
    }

    public void invertThis() throws ArithmeticException {
        int i = 2 % 2;
        int i2 = c + 23;
        e = i2 % 128;
        if (i2 % 2 != 0) {
            isZero();
            Object obj = null;
            obj.hashCode();
            throw null;
        }
        if (isZero()) {
            throw new ArithmeticException();
        }
        int i3 = c + 55;
        e = i3 % 128;
        if (i3 % 2 != 0) {
            int i4 = 3 / 4;
        }
        int i5 = 31;
        boolean z = false;
        while (!z && i5 >= 0) {
            if (((this.mDegree - 1) & mBitmask[i5]) != 0) {
                z = true;
            }
            i5--;
        }
        ZERO((GF2nONBField) this.mField);
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        int i6 = 1;
        while (i5 >= 0) {
            int i7 = c + 71;
            e = i7 % 128;
            int i8 = i7 % 2;
            GF2nElement gF2nElement = (GF2nElement) gF2nONBElement.clone();
            for (int i9 = 1; i9 <= i6; i9++) {
                gF2nElement.squareThis();
            }
            gF2nONBElement.multiplyThisBy(gF2nElement);
            i6 <<= 1;
            if (((this.mDegree - 1) & mBitmask[i5]) != 0) {
                gF2nONBElement.squareThis();
                gF2nONBElement.multiplyThisBy(this);
                i6++;
            }
            i5--;
        }
        gF2nONBElement.squareThis();
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public GFElement invert() throws ArithmeticException {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.invertThis();
        int i2 = c + 3;
        e = i2 % 128;
        int i3 = i2 % 2;
        return gF2nONBElement;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public void increaseThis() {
        int i = 2 % 2;
        int i2 = e + 79;
        c = i2 % 128;
        int i3 = i2 % 2;
        addToThis(ONE((GF2nONBField) this.mField));
        if (i3 != 0) {
            return;
        }
        Object obj = null;
        obj.hashCode();
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public GF2nElement increase() {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.increaseThis();
        int i2 = e + 5;
        c = i2 % 128;
        if (i2 % 2 != 0) {
            return gF2nONBElement;
        }
        Object obj = null;
        obj.hashCode();
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public int hashCode() {
        int i = 2 % 2;
        int i2 = e + 59;
        c = i2 % 128;
        int i3 = i2 % 2;
        int hashCode = this.mPol.hashCode();
        int i4 = e + 89;
        c = i4 % 128;
        if (i4 % 2 != 0) {
            return hashCode;
        }
        Object obj = null;
        obj.hashCode();
        throw null;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public boolean equals(Object obj) {
        int i = 2 % 2;
        int i2 = e + 123;
        c = i2 % 128;
        int i3 = i2 % 2;
        if (obj == null || !(obj instanceof GF2nONBElement)) {
            return false;
        }
        GF2nONBElement gF2nONBElement = (GF2nONBElement) obj;
        for (int i4 = 0; i4 < this.mLength; i4++) {
            int i5 = c + 115;
            e = i5 % 128;
            if (i5 % 2 != 0) {
                long j = this.mPol[i4];
                long j2 = gF2nONBElement.mPol[i4];
                throw null;
            }
            if (this.mPol[i4] != gF2nONBElement.mPol[i4]) {
                return false;
            }
        }
        return true;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement, org.bouncycastle.pqc.math.linearalgebra.GFElement
    public Object clone() {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        int i2 = e + 1;
        c = i2 % 128;
        if (i2 % 2 != 0) {
            return gF2nONBElement;
        }
        Object obj = null;
        obj.hashCode();
        throw null;
    }

    /* JADX INFO: Access modifiers changed from: package-private */
    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    public void assignZero() {
        int i = 2 % 2;
        int i2 = e + 15;
        int i3 = i2 % 128;
        c = i3;
        int i4 = i2 % 2;
        this.mPol = new long[this.mLength];
        int i5 = i3 + 81;
        e = i5 % 128;
        int i6 = i5 % 2;
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GF2nElement
    void assignOne() {
        int i = 2 % 2;
        int i2 = c;
        int i3 = i2 + 85;
        e = i3 % 128;
        int i4 = i3 % 2;
        int i5 = i2 + 89;
        e = i5 % 128;
        int i6 = i5 % 2;
        int i7 = 0;
        while (true) {
            int i8 = this.mLength - 1;
            if (i7 >= i8) {
                this.mPol[i8] = mMaxmask[this.mBit - 1];
                return;
            }
            int i9 = c + 19;
            e = i9 % 128;
            if (i9 % 2 != 0) {
                this.mPol[i7] = -1;
                i7 += 28;
            } else {
                this.mPol[i7] = -1;
                i7++;
            }
        }
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public void addToThis(GFElement gFElement) throws RuntimeException {
        int i = 2 % 2;
        int i2 = c + 21;
        e = i2 % 128;
        if (i2 % 2 != 0) {
            boolean z = gFElement instanceof GF2nONBElement;
            Object obj = null;
            obj.hashCode();
            throw null;
        }
        if (!(gFElement instanceof GF2nONBElement)) {
            throw new RuntimeException();
        }
        GF2nONBElement gF2nONBElement = (GF2nONBElement) gFElement;
        if (!this.mField.equals(gF2nONBElement.mField)) {
            throw new RuntimeException();
        }
        int i3 = e + 105;
        c = i3 % 128;
        int i4 = i3 % 2;
        for (int i5 = 0; i5 < this.mLength; i5++) {
            long[] jArr = this.mPol;
            jArr[i5] = jArr[i5] ^ gF2nONBElement.mPol[i5];
        }
    }

    @Override // org.bouncycastle.pqc.math.linearalgebra.GFElement
    public GFElement add(GFElement gFElement) throws RuntimeException {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(this);
        gF2nONBElement.addToThis(gFElement);
        int i2 = c + 1;
        e = i2 % 128;
        if (i2 % 2 != 0) {
            int i3 = 54 / 0;
        }
        return gF2nONBElement;
    }

    private long[] getElementReverseOrder() {
        int i;
        int i2 = 2 % 2;
        int i3 = c + 17;
        e = i3 % 128;
        long[] jArr = new long[i3 % 2 != 0 ? this.mPol.length : this.mPol.length];
        for (0; i < this.mDegree; i + 1) {
            int i4 = e + 97;
            c = i4 % 128;
            if (i4 % 2 == 0) {
                int i5 = this.mDegree;
                i = testBit(0) ? 0 : i + 1;
                int i6 = i >>> 6;
                jArr[i6] = jArr[i6] | mBitmask[i & 63];
            } else {
                if (!testBit((this.mDegree - i) - 1)) {
                }
                int i62 = i >>> 6;
                jArr[i62] = jArr[i62] | mBitmask[i & 63];
            }
        }
        return jArr;
    }

    private long[] getElement() {
        long[] jArr;
        int i = 2 % 2;
        int i2 = e + 35;
        c = i2 % 128;
        if (i2 % 2 == 0) {
            long[] jArr2 = this.mPol;
            jArr = new long[jArr2.length];
            System.arraycopy(jArr2, 1, jArr, 1, jArr2.length);
        } else {
            long[] jArr3 = this.mPol;
            jArr = new long[jArr3.length];
            System.arraycopy(jArr3, 0, jArr, 0, jArr3.length);
        }
        int i3 = e + 109;
        c = i3 % 128;
        if (i3 % 2 == 0) {
            int i4 = 29 / 0;
        }
        return jArr;
    }

    private void assign(long[] jArr) {
        int i = 2 % 2;
        int i2 = e + 59;
        c = i2 % 128;
        if (i2 % 2 == 0) {
            System.arraycopy(jArr, 0, this.mPol, 0, this.mLength);
        } else {
            System.arraycopy(jArr, 0, this.mPol, 0, this.mLength);
        }
    }

    private void assign(byte[] bArr) {
        int i = 2 % 2;
        int i2 = c + 37;
        e = i2 % 128;
        if (i2 % 2 != 0) {
            this.mPol = new long[this.mLength];
        } else {
            this.mPol = new long[this.mLength];
        }
        for (int i3 = 0; i3 < bArr.length; i3++) {
            int i4 = c + 99;
            e = i4 % 128;
            int i5 = i4 % 2;
            long[] jArr = this.mPol;
            int i6 = i3 >>> 3;
            jArr[i6] = jArr[i6] | ((bArr[(bArr.length - 1) - i3] & 255) << ((i3 & 7) << 3));
        }
    }

    private void assign(BigInteger bigInteger) {
        int i = 2 % 2;
        int i2 = e + 89;
        c = i2 % 128;
        int i3 = i2 % 2;
        byte[] byteArray = bigInteger.toByteArray();
        if (i3 != 0) {
            assign(byteArray);
        } else {
            assign(byteArray);
            int i4 = 67 / 0;
        }
    }

    public static GF2nONBElement ZERO(GF2nONBField gF2nONBField) {
        int i = 2 % 2;
        GF2nONBElement gF2nONBElement = new GF2nONBElement(gF2nONBField, new long[gF2nONBField.getONBLength()]);
        int i2 = c + 55;
        e = i2 % 128;
        if (i2 % 2 != 0) {
            int i3 = 81 / 0;
        }
        return gF2nONBElement;
    }

    public static GF2nONBElement ONE(GF2nONBField gF2nONBField) {
        int i = 2 % 2;
        int oNBLength = gF2nONBField.getONBLength();
        long[] jArr = new long[oNBLength];
        int i2 = 0;
        while (true) {
            int i3 = oNBLength - 1;
            if (i2 >= i3) {
                jArr[i3] = mMaxmask[gF2nONBField.getONBBit() - 1];
                return new GF2nONBElement(gF2nONBField, jArr);
            }
            int i4 = c;
            int i5 = i4 + 67;
            e = i5 % 128;
            if (i5 % 2 != 0) {
                jArr[i2] = -1;
            } else {
                jArr[i2] = -1;
                i2++;
            }
            int i6 = i4 + 97;
            e = i6 % 128;
            int i7 = i6 % 2;
        }
    }

    private GF2nONBElement(GF2nONBField gF2nONBField, long[] jArr) {
        this.mField = gF2nONBField;
        this.mDegree = this.mField.getDegree();
        this.mLength = gF2nONBField.getONBLength();
        this.mBit = gF2nONBField.getONBBit();
        this.mPol = jArr;
    }

    public GF2nONBElement(GF2nONBField gF2nONBField, byte[] bArr) {
        this.mField = gF2nONBField;
        this.mDegree = this.mField.getDegree();
        this.mLength = gF2nONBField.getONBLength();
        this.mBit = gF2nONBField.getONBBit();
        this.mPol = new long[this.mLength];
        assign(bArr);
    }

    public GF2nONBElement(GF2nONBField gF2nONBField, SecureRandom secureRandom) {
        this.mField = gF2nONBField;
        this.mDegree = this.mField.getDegree();
        this.mLength = gF2nONBField.getONBLength();
        this.mBit = gF2nONBField.getONBBit();
        int i = this.mLength;
        long[] jArr = new long[i];
        this.mPol = jArr;
        int i2 = 0;
        if (i <= 1) {
            jArr[0] = secureRandom.nextLong();
            long[] jArr2 = this.mPol;
            jArr2[0] = jArr2[0] >>> (64 - this.mBit);
            int i3 = e + 5;
            c = i3 % 128;
            if (i3 % 2 == 0) {
                int i4 = 35 / 0;
                return;
            }
            return;
        }
        while (i2 < this.mLength - 1) {
            this.mPol[i2] = secureRandom.nextLong();
            i2++;
            int i5 = e + 93;
            c = i5 % 128;
            if (i5 % 2 == 0) {
                int i6 = 4 / 3;
            } else {
                int i7 = 2 % 2;
            }
        }
        this.mPol[this.mLength - 1] = secureRandom.nextLong() >>> (64 - this.mBit);
    }

    public GF2nONBElement(GF2nONBField gF2nONBField, BigInteger bigInteger) {
        this.mField = gF2nONBField;
        this.mDegree = this.mField.getDegree();
        this.mLength = gF2nONBField.getONBLength();
        this.mBit = gF2nONBField.getONBBit();
        this.mPol = new long[this.mLength];
        assign(bigInteger);
    }

    public GF2nONBElement(GF2nONBElement gF2nONBElement) {
        this.mField = gF2nONBElement.mField;
        this.mDegree = this.mField.getDegree();
        this.mLength = ((GF2nONBField) this.mField).getONBLength();
        this.mBit = ((GF2nONBField) this.mField).getONBBit();
        this.mPol = new long[this.mLength];
        assign(gF2nONBElement.getElement());
    }

    static {
        e = 0;
        c();
        mBitmask = new long[]{1, 2, 4, 8, 16, 32, 64, 128, 256, 512, RealWebSocket.DEFAULT_MINIMUM_DEFLATE_SIZE, 2048, 4096, 8192, Http2Stream.EMIT_BUFFER_SIZE, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648L, 4294967296L, 8589934592L, 17179869184L, 34359738368L, 68719476736L, 137438953472L, 274877906944L, 549755813888L, 1099511627776L, 2199023255552L, 4398046511104L, 8796093022208L, 17592186044416L, 35184372088832L, 70368744177664L, 140737488355328L, 281474976710656L, 562949953421312L, 1125899906842624L, 2251799813685248L, 4503599627370496L, 9007199254740992L, 18014398509481984L, 36028797018963968L, 72057594037927936L, 144115188075855872L, 288230376151711744L, 576460752303423488L, 1152921504606846976L, 2305843009213693952L, Longs.MAX_POWER_OF_TWO, Long.MIN_VALUE};
        mMaxmask = new long[]{1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, WebSocketProtocol.PAYLOAD_SHORT_MAX, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647L, KeyboardMap.kValueMask, 8589934591L, 17179869183L, 34359738367L, 68719476735L, 137438953471L, 274877906943L, 549755813887L, 1099511627775L, 2199023255551L, 4398046511103L, 8796093022207L, 17592186044415L, 35184372088831L, 70368744177663L, 140737488355327L, 281474976710655L, 562949953421311L, 1125899906842623L, 2251799813685247L, 4503599627370495L, 9007199254740991L, 18014398509481983L, 36028797018963967L, 72057594037927935L, 144115188075855871L, 288230376151711743L, 576460752303423487L, 1152921504606846975L, 2305843009213693951L, 4611686018427387903L, Long.MAX_VALUE, -1};
        mIBY64 = new int[]{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5};
        int i = c + 89;
        e = i % 128;
        int i2 = i % 2;
    }
}