Cryptography, Blockchain, Ethereum, ICO, Bitcoin.
party) Let H be a secure hash function such as SHA256 Let p be a large safe prime Let g < p be a randomly chosen generator of the multiplicative group of integers modulo p, p in 𝔽p Key generation (performed once by the prover) Randomly choose a secret integer x with 1 < x < p − 2. Compute y = gˣ