On the public citation graph
Elliptic curve implementation of zero-knowledge blobs
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/bf00204448openalex-snapshot
A discrete logarithm implementation of perfect zero-knowledge blobs
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot
Elliptic curves over finite fields and the computation of square roots mod 𝑝
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/sfcs.1986.33openalex-snapshot
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
inferredcites →https://doi.org/10.1145/103418.103434openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites →https://doi.org/10.1145/28395.28445openalex-snapshot
Recognizing primes in random polynomial time
inferredcites →https://doi.org/10.2140/pjm.1988.131.157openalex-snapshot
Primality of the number of points on an elliptic curve over a finite field
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_5openalex-snapshot
GROUP STRUCTURE OF ELLIPTIC CURVES OVER FINITE FIELDS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_6openalex-snapshot
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_7openalex-snapshot
Counting the number of points on elliptic curves over finite fields: strategies and performances
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_26openalex-snapshot
Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$
inferred← citeshttps://doi.org/10.1007/978-1-4614-5389-5_4openalex-snapshot
Elliptic Curves over Finite Fields: Number Theoretic and Cryptographic Aspects
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_8openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_5openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_1openalex-snapshot
Revisiting Cycles of Pairing-Friendly Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-0348-7023-8_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-93-86279-02-6_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-93-86279-15-6_23openalex-snapshot
Elliptic Curves and Cryptography
inferred← citeshttps://doi.org/10.1007/bf00203817openalex-snapshot
Elliptic curve cryptosystems and their implementation
inferred← citeshttps://doi.org/10.1007/bfb0028485openalex-snapshot
Efficient construction of secure hyperelliptic discrete logarithm problems
inferred← citeshttps://doi.org/10.1007/s001459900040openalex-snapshot
The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
inferred← citeshttps://doi.org/10.1007/s10208-013-9181-9openalex-snapshot
On the Distribution of Atkin and Elkies Primes
inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1080/19393555.2011.560925openalex-snapshot
Web Authentication Protocol Using Zero Knowledge Proof
inferred← citeshttps://doi.org/10.1109/icect.2004.1319747openalex-snapshot
Better privacy and security in e-commerce: using elliptic curve-based zero knowledge proofs
inferred← citeshttps://doi.org/10.1137/s0036144503439190openalex-snapshot
A Survey of Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.82308/20465openalex-snapshot
Elliptic curve cryptosystems : a survey
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.