BoolQuadEqs/test.py at main · KAIST-CryptLab/BoolQuadEqs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
from count_eqs import CountEqs
from find_quad_eqs import FindEqs
from sage.all import *

def test_bi_affine(n, check_all_val=True):
    F = FindEqs(n)
    C = CountEqs(n)
    failed_list = []
    for a in range(2, (1 << n) - 1):
        print('Test for a = {}...'.format(a))
        eqs = F.find_bi_affine(a)
        num = C.num_bi_affine(a)
        if len(eqs) != num:
            print('  Test fails: found {} eqs but there are {} eqs'.format(len(eqs), num))
            failed_list.append(a)
            continue
        if len(eqs) == 0:
            print('  No bi-affine eqs')
            continue
        seq = Sequence(eqs)
        M, _ = seq.coefficient_matrix()
        if len(eqs) != M.rank():
            print('  Test fails: not linearly independent')
            failed_list.append(a)
            continue
        if check_all_val:
            for f in eqs:
                if not F.brute_force_check(f, a):
                    print('  Test fails: not valid equation')
                    print(f)
                    failed_list.append(a)
                    break
        print('  {} bi-affine eqs'.format(len(eqs)))
    if len(failed_list) == 0:
        if check_all_val:
            print('Pass for all a (checked all inputs)')
        else:
            print('Pass for all a (only checked linear independence)')
    else:
        print('Fail for a in', failed_list)
        exit()

def test_quadratic(n, check_all_val=True):
    F = FindEqs(n)
    C = CountEqs(n)
    failed_list = []
    for a in range(2, (1 << n) - 1):
        print('Test for a = {}...'.format(a))
        eqs = F.find_quad(a)
        num = C.num_quad(a)
        if len(eqs) != num:
            print('  Test fails: found {} eqs but there are {} eqs'.format(len(eqs), num))
            failed_list.append(a)
            continue
        if len(eqs) == 0:
            print('  No quadratic eqs')
            continue
        seq = Sequence(eqs)
        M, _ = seq.coefficient_matrix()
        if len(eqs) != M.rank():
            print('  Test fails: not linearly independent')
            failed_list.append(a)
            continue
        if check_all_val:
            for f in eqs:
                if not F.brute_force_check(f, a):
                    print('  Test fails: not valid equation')
                    print(f)
                    failed_list.append(a)
                    break
        print('  {} quadratic eqs'.format(len(eqs)))
    if len(failed_list) == 0:
        if check_all_val:
            print('Pass for all a (checked all inputs)')
        else:
            print('Pass for all a (only checked linear independence)')
    else:
        print('Fail for a in', failed_list)
        exit()

if __name__ == '__main__':
    n = 6
    print('==== Test Biaffine ====')
    test_bi_affine(n)

    print('\n==== Test Quadratic ====')
    test_quadratic(n)