1import unittest, operator
 2load("ring-signatures.sage")
 3
 4# A Rust implementation of this scheme can be found at:
 5# https://github.com/arnaucube/ring-signatures-rs
 6
 7# ethereum elliptic curve
 8p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
 9a = 0
10b = 7
11F = GF(p)
12E = EllipticCurve(F, [a,b])
13GX = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798
14GY = 0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8
15g = E(GX,GY)
16n = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141
17h = 1
18q = g.order()
19assert is_prime(p)
20assert is_prime(q)
21assert g * q == 0
22
23
24class TestRingSignatures(unittest.TestCase):
25        def test_bLSAG_ring_of_5(self):
26                test_bLSAG(5, 3)
27        def test_bLSAG_ring_of_20(self):
28                test_bLSAG(20, 14)
29
30def test_bLSAG(ring_size, pi):
31        print(f"[bLSAG] Testing with a ring of {ring_size} keys")
32        prover = Prover(F, g)
33        n = ring_size
34        R = [None] * n
35
36        # generate prover's key pair
37        K_pi = prover.new_key()
38
39        # generate other n public keys
40        for i in range(0, n):
41            R[i] = g * i
42
43        # set K_pi
44        R[pi] = K_pi
45
46        # sign m
47        m = 1234
48        print("sign")
49        sig = prover.sign(m, R)
50
51        print("verify")
52        key_image = prover.w * hashToPoint(prover.K)
53        verify(g, R, m, key_image, sig)
54
55if __name__ == '__main__':
56        unittest.main()