ispi Mon, 19 Mar 2001 01:52:58 -0800
Are there any zero-knowledge proof protocols for possession of discrete logarithm such that X=g^x mod N? N is a composite number, e.g. N=PQ is a RSA module. Thanks.
