I'm trying to confirm a vulnerability in a signing scheme I'm helping with. To do this I need to simulate a rogue key attack on a BLS aggregate signature using the golang bn256 library https://godoc.org/golang.org/x/crypto/bn256 This requires computing the inverse of a public key.
I'm not a crypto expert but do have a fairly strong algebra background... So if
g is the generator of order
n then the inverse of
p is just
p^(n-1) right? But I have no idea what
Any help would be greatly appreciated