✳flâneur — a map of the web's best reading

Pairing

zeroknowledgeblog.com · 1,685 words · saved by 1 readers

The Zero Knowledge Blog

Empty  Print  Email Let’s look at the tools that we’ve covered so far to build a homomorphic hiding mapping. We have a finite field of order p , where p is a prime number, and a group of points ( x , y ) , whose coordinates belong to the same finite field . These points satisfy an elliptic curve , whose coefficients A and B belong to the same finite field . We’ll call the finite field “base field” or “F p ”, and “G1” the subgroup of points with generator g1 . We’ll choose p and the curve such as r, the order of the group G1, i.e. the number of elements on this group, is a prime numbe

Explore this link on the map →

related reading