Abstract
In [2] the authors show how to construct the building blocks for perfect zero-knowledge proofs called “blobs” using the discrete log problem. Contrary to what they remark on p. 73 of [2], we argue that the Mordell group of an elliptic curve is more suitable than the multiplicative group of a finite field for the construction of a hard cryptographic suite of problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
L. Adleman and M. Huang, Recognizing primes in random polynomial time, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 462–469.
J. F. Boyar, S. A. Kurtz, and M. W. Krentel, A discrete logarithm implementation of perfect zero-knowledge blobs, J. Cryptology, 2 (1990), 63–76.
G. Brassard and C. Crépeau, Nontransitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond, Proc. 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 188–195.
G. Brassard, D. Chaum, and C. Crépeau, Minimum disclosure proofs of knowledge, J. Comput. System Sci., 37 (1988), 156–189.
D. M. Gordon, Discrete logarithms in GF(p) using the number field sieve, Preprint.
N. Koblitz, Elliptic curve cryptosystems, Math. Comp., 48 (1987), 203–209.
N. Koblitz, Primality of the number of points on an elliptic curve over a finite field, Pacific J. Math., 131 (1988), 157–165.
H. W. Lenstra, Factoring integers with elliptic curves, Ann. of Math., 126 (1987), 649–673.
A. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, Preprint.
V. Miller, Short programs for functions on curves, Unpublished manuscript, 1986.
V. Miller, Uses of elliptic curves in cryptography, Advances in Cryptology: Proceedings of Crypto '85, Springer-Verlag, Berlin, 1986, pp. 417–426.
R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp., 44 (1985), 483–494.
J. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koblitz, N. Elliptic curve implementation of zero-knowledge blobs. J. Cryptology 4, 207–213 (1991). https://doi.org/10.1007/BF00196728
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00196728