GF (2^128) -> x^128 + x^7 + x^2 + x + 1The representation is little-endian arrays of 64-bit words
| Modifier and Type | Field and Description |
|---|---|
| public static final int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public static void | |
| public static void | |
| public static boolean | |
| public static void | |
| public static void | |
| public static void | |
| public static void | |
| public static void | |
| public static void | |
| public static void |
| SIZE | back to summary |
|---|---|
| public static final int SIZE | |
| KGCMUtil_128 | back to summary |
|---|---|
| public KGCMUtil_128() | |
| add | back to summary |
|---|---|
| public static void add(long[] x, long[] y, long[] z) | |
| copy | back to summary |
|---|---|
| public static void copy(long[] x, long[] z) | |
| equal | back to summary |
|---|---|
| public static boolean equal(long[] x, long[] y) | |
| multiply | back to summary |
|---|---|
| public static void multiply(long[] x, long[] y, long[] z) | |
| multiplyX | back to summary |
|---|---|
| public static void multiplyX(long[] x, long[] z) | |
| multiplyX8 | back to summary |
|---|---|
| public static void multiplyX8(long[] x, long[] z) | |
| one | back to summary |
|---|---|
| public static void one(long[] z) | |
| square | back to summary |
|---|---|
| public static void square(long[] x, long[] z) | |
| x | back to summary |
|---|---|
| public static void x(long[] z) | |
| zero | back to summary |
|---|---|
| public static void zero(long[] z) | |