I am curious whether one can do Pedersen commitment on $GF(2^n)$. One method I thought of was to get a prime order multiplicative subgroup of $GF(2^n)$. But for efficiency and security, what would be an appropriate value of $n$ for a security strength of 128-bit security?
Asked
Active
Viewed 92 times
