Elliptic curve implementation of zero-knowledge blobs

DOI10.1007/BF00196728zbMath0746.68029MaRDI QIDQ1180510

Neal Koblitz

Publication date: 27 June 1992

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

zbMATH Keywords

elliptic curveprimalityzero-knowledge proofsdiscrete logarithmblobs

Mathematics Subject Classification ID

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

Related Items (3)

On the distribution of Atkin and Elkies primes ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Elliptic curve cryptosystems and their implementation

Cites Work

• Unnamed Item
• Unnamed Item
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Primality of the number of points on an elliptic curve over a finite field
• Factoring integers with elliptic curves
• Minimum disclosure proofs of knowledge
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• Reducing elliptic curve logarithms to logarithms in a finite field
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

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