On the public citation graph
A FPGA Coprocessor for the Cryptographic Tate Pairing over Fp
0 signed · 38 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/11545262_30openalex-snapshot
Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
inferredcites →https://doi.org/10.1007/11586821_2openalex-snapshot
Pairing-Based Cryptography at High Security Levels
inferredcites →https://doi.org/10.1007/3-540-36413-7_19openalex-snapshot
Constructing Elliptic Curves with Prescribed Embedding Degrees
inferredcites →https://doi.org/10.1007/3-540-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-45708-9_23openalex-snapshot
Efficient Algorithms for Pairing-Based Cryptosystems
inferredcites →https://doi.org/10.1007/978-3-540-24654-1_2openalex-snapshot
On the Selection of Pairing-Friendly Groups
inferredcites →https://doi.org/10.1007/978-3-540-30574-3_20openalex-snapshot
Computing the Tate Pairing
inferredcites →https://doi.org/10.1007/978-3-540-74735-2_17openalex-snapshot
Arithmetic Operators for Pairing-Based Cryptography
inferredcites →https://doi.org/10.1007/s001459900040openalex-snapshot
The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
inferredcites →https://doi.org/10.1007/s10623-006-9033-6openalex-snapshot
Efficient pairing computation on supersingular Abelian varieties
inferredcites →https://doi.org/10.1017/cbo9780511546570openalex-snapshot
Advances in Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/itng.2006.107openalex-snapshot
Parallel Hardware Architectures for the Cryptographic Tate Pairing
inferredcites →https://doi.org/10.1109/itng.2006.29openalex-snapshot
An Embedded Processor for a Pairing-Based Cryptosystem
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1109/tec.1960.5219822openalex-snapshot
Conditional-Sum Addition Logic
inferredcites →https://doi.org/10.1109/tit.1984.1056941openalex-snapshot
Fast evaluation of logarithms in fields of characteristic two
inferredcites →https://doi.org/10.1137/s0097539701398521openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites →https://doi.org/10.5860/choice.41-4097openalex-snapshot
Elliptic curves: number theory and cryptography
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-642-04138-9_17openalex-snapshot
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
inferred← citeshttps://doi.org/10.1007/978-3-642-04138-9_19openalex-snapshot
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-17455-1openalex-snapshot
Pairing-based cryptography - Pairing 2010 : 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-17455-1_25openalex-snapshot
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-17455-1_28openalex-snapshot
High Speed Flexible Pairing Cryptoprocessor on FPGA Platform
inferred← citeshttps://doi.org/10.1007/978-3-642-41488-6_14openalex-snapshot
Security Analysis of Building Automation Networks
inferred← citeshttps://doi.org/10.1007/s12095-014-0114-5openalex-snapshot
A survey of fault attacks in pairing based cryptography
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2009.05.001openalex-snapshot
FPGA and ASIC implementations of the pairing in characteristic three
inferred← citeshttps://doi.org/10.1109/icgccee.2014.6922282openalex-snapshot
FPGA implementation of an efficient and highly secure cryptoprocessor over Barreto-Naehrig curves
inferred← citeshttps://doi.org/10.1109/isvlsi.2011.39openalex-snapshot
Design and Analysis of Pairing Based Cryptographic Hardware for Prime Fields
inferred← citeshttps://doi.org/10.1109/tc.2010.163openalex-snapshot
Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2188655openalex-snapshot
Secure Dual-Core Cryptoprocessor for Pairings Over Barreto-Naehrig Curves on FPGA Platform
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.