ElGamal算法既能用于数据加密也能用于数字签名,其安全性依赖于计算有限域上离散对数这一难题。
密钥对产生办法。首先选择一个素数p,两个随机数, g 和x,g, x < p, 计算 y = g^x ( mod p ),则其公钥为 y, g 和p。私钥是x。g和p可由一组用户共享。
ElGamal用于数字签名。被签信息为M,首先选择一个-ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two random numbers, g and x, g, x