On the public citation graph
Parallel Hardware Architectures for the Cryptographic Tate Pairing
0 signed · 40 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_29openalex-snapshot
Hardware Acceleration of the Tate Pairing in Characteristic Three
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/3-540-36400-5_38openalex-snapshot
Hardware Implementation of Finite Fields of Characteristic Three
inferredcites →https://doi.org/10.1007/3-540-36563-x_11openalex-snapshot
Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
inferredcites →https://doi.org/10.1007/3-540-39568-7_5openalex-snapshot
Identity-Based Cryptosystems and Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-44647-8_13openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites →https://doi.org/10.1007/3-540-44987-6_13openalex-snapshot
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-45325-3_32openalex-snapshot
An Identity Based Encryption Scheme Based on Quadratic Residues
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-45708-9_23openalex-snapshot
Efficient Algorithms for Pairing-Based Cryptosystems
inferredcites →https://doi.org/10.1007/978-3-540-30117-2_10openalex-snapshot
Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption Schemes
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/s10623-006-9033-6openalex-snapshot
Efficient pairing computation on supersingular Abelian varieties
inferredcites →https://doi.org/10.1109/18.771254openalex-snapshot
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
inferredcites →https://doi.org/10.1109/mdt.2009.69openalex-snapshot
An Introduction to High-Level Synthesis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11935070_11openalex-snapshot
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_11openalex-snapshot
Instruction Set Extensions for Pairing-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-74735-2_17openalex-snapshot
Arithmetic Operators for Pairing-Based Cryptography
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/s00500-019-03857-zopenalex-snapshot
Medical big data analysis: preserving security and privacy with hybrid cloud technology
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.12.034openalex-snapshot
A new bit-serial multiplier over GF(pm) using irreducible trinomials
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2007.05.002openalex-snapshot
Hardware architectures for the Tate pairing over GF(2m)
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.1016/j.sysarc.2006.09.003openalex-snapshot
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
inferred← citeshttps://doi.org/10.1049/iet-cdt:20070077openalex-snapshot
Versatile processor for GF( p m ) arithmetic for use in cryptographic applications
inferred← citeshttps://doi.org/10.1109/arith.2007.10openalex-snapshot
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation
inferred← citeshttps://doi.org/10.1109/icons.2008.27openalex-snapshot
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
inferred← citeshttps://doi.org/10.1109/itng.2007.160openalex-snapshot
Programming Highly Parallel Reconfigurable Architectures for Public-Key Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/itng.2007.185openalex-snapshot
SPA resistant Elliptic Curve Cryptosystem using Addition Chains
inferred← citeshttps://doi.org/10.1109/itng.2007.19openalex-snapshot
A Reconfigurable Processor for the Cryptographic ηT Pairing in Characteristic 3
inferred← citeshttps://doi.org/10.1109/itng.2008.260openalex-snapshot
A FPGA Coprocessor for the Cryptographic Tate Pairing over Fp
inferred← citeshttps://doi.org/10.1109/tc.2008.103openalex-snapshot
Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
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/tcsi.2014.2334992openalex-snapshot
Efficient $M$ -ary Exponentiation over $GF(2^{m})$ Using Subquadratic KA-Based Three-Operand Montgomery Multiplier
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2303489openalex-snapshot
Efficient Hardware Architecture of $\eta_{T}$ Pairing Accelerator Over Characteristic Three
inferred← citeshttps://doi.org/10.1504/ijhpsa.2007.015393openalex-snapshot
A flexible processor for the characteristic 3 ηT pairing
inferred← citeshttps://doi.org/10.1504/ijhpsa.2007.015399openalex-snapshot
SPA resistant elliptic curve cryptosystem using addition chains
inferred← citeshttps://doi.org/10.4218/etrij.08.0107.0079openalex-snapshot
Power Analysis Attacks and Countermeasures on ηT Pairing over Binary Fields
inferred← citeshttps://doi.org/10.4304/jcp.2.10.52-62openalex-snapshot
Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
inferred← citeshttps://doi.org/10.4304/jcp.2.9.50-59openalex-snapshot
Programming Highly Parallel Reconfigurable Architectures for Symmetric and Asymmetric Cryptographic Applications
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.