public class BLS12_381SubgroupCheckTest
extends junit.framework.TestCase
[r] P == 0 test on every input we throw at it" — that's what
proves the optimisation is correct.| Constructor and Description |
|---|
BLS12_381SubgroupCheckTest() |
| Modifier and Type | Method and Description |
|---|---|
void |
testG1FastCheckAgreesWithSlow() |
void |
testG1FastCheckAgreesWithSlowOffSubgroup()
The fast G1 check against
[r] P == 0 on points outside the
subgroup: random curve points, their components of small order
dividing the cofactor h = 3 * 11^2 * 10177^2 * 859267^2 * 52437899^2
(orders 3 and 11 make the double-and-add by |x| meet its doubling and
inverse cases), and the same points with the cofactor cleared. |
void |
testG1GeneratorIsInSubgroup() |
void |
testG1InfinityIsInSubgroup() |
void |
testG1ScalarMultiplesAreInSubgroup() |
void |
testG2FastCheckAgreesWithSlow() |
void |
testG2GeneratorIsInSubgroup() |
void |
testG2InfinityIsInSubgroup() |
void |
testG2RejectsOffSubgroupPoint() |
void |
testG2ScalarMultiplesAreInSubgroup() |
void |
testPsiG2IsOnCurve() |
void |
testSigmaG1IsOnCurve() |
assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertFalse, assertFalse, assertNotNull, assertNotNull, assertNotSame, assertNotSame, assertNull, assertNull, assertSame, assertSame, assertTrue, assertTrue, countTestCases, createResult, fail, fail, failNotEquals, failNotSame, failSame, format, getName, run, run, runBare, runTest, setName, setUp, tearDown, toStringpublic void testG1GeneratorIsInSubgroup()
public void testG1ScalarMultiplesAreInSubgroup()
public void testG1InfinityIsInSubgroup()
public void testG1FastCheckAgreesWithSlow()
public void testG1FastCheckAgreesWithSlowOffSubgroup()
[r] P == 0 on points outside the
subgroup: random curve points, their components of small order
dividing the cofactor h = 3 * 11^2 * 10177^2 * 859267^2 * 52437899^2
(orders 3 and 11 make the double-and-add by |x| meet its doubling and
inverse cases), and the same points with the cofactor cleared.public void testG2GeneratorIsInSubgroup()
public void testG2ScalarMultiplesAreInSubgroup()
public void testG2InfinityIsInSubgroup()
public void testG2FastCheckAgreesWithSlow()
public void testG2RejectsOffSubgroupPoint()
public void testSigmaG1IsOnCurve()
public void testPsiG2IsOnCurve()