Elliptic curve implementation of zero-knowledge blobs

DOI10.1007/BF00196728MaRDI QIDQ1180510zbMATH OpenFDO

Authors Neal Koblitz

Publication date 27 June 1992

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00196728

zbMATH Keywords

blobsdiscrete logarithmelliptic curveprimalityzero-knowledge proofs

Mathematics Subject Classification ID

Elliptic curves (14H52) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

In \textit{J. J. Boyar}, \textit{S. A. Kurtz} and \textit{M. W. Krentel} [J. Cryptology 2, 63-76 (1990; Zbl 0699.68035)] it is shown how to construct the building blocks for perfect zero-knowledge proofs (called blobs) using the discrete log problem. The purpose of this paper is to argue that a family of Mordell groups of suitably chosen elliptic curves is more likely to give a hard cryptographic suite than the multiplicative group of a prime finite field. The advantages arise because of the much greater choice available, the resulting possibility of limiting oneself to groups of prime order and the absence of any known discrete log algorithm which is not fully exponential.

Recommendations

• A discrete logarithm implementation of perfect zero-knowledge blobs
• Algorithms for elliptic curves
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• scientific article; zbMATH DE number 4145824
• Elliptic curve of the ring \(\mathbb{F}_q[\varepsilon]\), \(\varepsilon^n=0\)

Cites work

• A discrete logarithm implementation of perfect zero-knowledge blobs
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Elliptic Curve Cryptosystems
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factoring integers with elliptic curves
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• Minimum disclosure proofs of knowledge
• Primality of the number of points on an elliptic curve over a finite field
• Reducing elliptic curve logarithms to logarithms in a finite field

Cited in

(5)

• Elliptic curve cryptosystems and their implementation
• On the distribution of Atkin and Elkies primes
• Algorithms for elliptic curves
• Revisiting cycles of pairing-friendly elliptic curves
• A discrete logarithm implementation of perfect zero-knowledge blobs

This page was built for publication: Elliptic curve implementation of zero-knowledge blobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180510)