On the public citation graph
Simplified pairing computation and security implications
0 signed · 30 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.1006/jsco.1996.0125openalex-snapshot
The Magma Algebra System I: The User Language
inferredcites →https://doi.org/10.1007/3-540-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-45455-1_3openalex-snapshot
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-58691-1_39openalex-snapshot
A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields
inferredcites →https://doi.org/10.1007/978-3-540-30539-2_24openalex-snapshot
Comparison Between XL and Gröbner Basis Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-40061-5_7openalex-snapshot
Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p – x + d
inferredcites →https://doi.org/10.1007/978-3-540-72540-4_25openalex-snapshot
Ate Pairing on Hyperelliptic Curves
inferredcites →https://doi.org/10.1007/s00145-004-0313-xopenalex-snapshot
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1007/s10623-006-9033-6openalex-snapshot
Efficient pairing computation on supersingular Abelian varieties
inferredcites →https://doi.org/10.1109/18.259647openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites →https://doi.org/10.1109/tc.2006.134openalex-snapshot
A Fault Attack on Pairing-Based Cryptography
inferredcites →https://doi.org/10.1112/s1461157000001224openalex-snapshot
On Polynomial Interpolations related to Verheul Homomorphisms
inferredcites →https://doi.org/10.1137/s0097539796302749openalex-snapshot
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
inferredcites →https://doi.org/10.2307/2153546openalex-snapshot
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of 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/978-3-319-04873-4_5openalex-snapshot
Pairing Inversion via Non-degenerate Auxiliary Pairings
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_25openalex-snapshot
Ate Pairing on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_12openalex-snapshot
The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_18openalex-snapshot
On Pairing Inversion Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-40026-1_10openalex-snapshot
Improved Side Channel Attacks on Pairing Based Cryptography
inferred← citeshttps://doi.org/10.1007/s10623-009-9287-xopenalex-snapshot
The Diffie–Hellman problem and generalization of Verheul’s theorem
inferred← citeshttps://doi.org/10.1016/j.ffa.2007.12.003openalex-snapshot
Closed formulae for the Weil pairing inversion
inferred← citeshttps://doi.org/10.1109/imis.2013.36openalex-snapshot
Instruction Fault Attack on the Miller Algorithm in a Pairing-Based Cryptosystem
inferred← citeshttps://doi.org/10.1109/tit.2008.2006431openalex-snapshot
Aspects of Pairing Inversion
inferred← citeshttps://doi.org/10.1109/tit.2011.2173714openalex-snapshot
Approach to Pairing Inversions Without Solving Miller Inversion
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03651openalex-snapshot
Research and Development on Efficient Pairing Computations
inferred← citeshttps://doi.org/10.3934/amc.2013.7.103openalex-snapshot
Generalizations of Verheul's theorem to asymmetric pairings
inferred← citeshttps://doi.org/10.5772/56295openalex-snapshot
Efficient Computation for Pairing Based Cryptography: A State of the Art
inferred← citeshttps://doi.org/10.5815/ijcnis.2016.08.08openalex-snapshot
A Study of Hyperelliptic Curves in Cryptography
inferred← citeshttps://doi.org/10.70675/49fdc695z5ef2z491fz8d46z171a50f8e37copenalex-snapshot
Contribution à la sécurite physique des cryptosystèmes embarqués
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.