On the public citation graph
An Embedded Processor for a Pairing-Based Cryptosystem
0 signed · 35 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-44499-8_3openalex-snapshot
A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m)
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-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-69053-0_25openalex-snapshot
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
inferredcites →https://doi.org/10.1007/978-1-4615-3198-2openalex-snapshot
Elliptic Curve Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/978-3-030-92062-3openalex-snapshot
Advances in Cryptology – ASIACRYPT 2021
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-46588-1_27openalex-snapshot
Fast Implementation of Elliptic Curve Arithmetic in GF(p n )
inferredcites →https://doi.org/10.1007/bfb0052247openalex-snapshot
Efficient algorithms for elliptic curve cryptosystems
inferredcites →https://doi.org/10.1007/s00145-004-0311-zopenalex-snapshot
Efficient Implementation of Pairing-Based Cryptosystems
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.1023/a:1008013818413openalex-snapshot
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
inferredcites →https://doi.org/10.1109/12.238496openalex-snapshot
On computing multiplicative inverses in GF(2/sup m/)
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-031-13191-2_2openalex-snapshot
Information-Theoretic Cryptography: A Maneuver in the Trade-Off Space of Cryptography in IoT
inferred← citeshttps://doi.org/10.1007/978-3-540-71431-6_20openalex-snapshot
Multiplication over $\mathbb{F}_{{p}^{m}}$ on FPGA: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-73074-3_4openalex-snapshot
A Coprocessor for the Final Exponentiation of the η T Pairing in Characteristic Three
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/bf03167539openalex-snapshot
Tate and Ate pairings fory 2 =x 5 − αx in characteristic five
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.sysarc.2006.09.003openalex-snapshot
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
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/fpt.2006.270314openalex-snapshot
FPGA acceleration of the tate pairing in characteristic 2
inferred← citeshttps://doi.org/10.1109/hite63532.2024.10777108openalex-snapshot
Fast Implementation of Eta-T pairing on FPGAs
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/itng.2007.160openalex-snapshot
Programming Highly Parallel Reconfigurable Architectures for Public-Key Cryptographic Applications
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/reconf.2006.307766openalex-snapshot
A GF(24m) Inverter and its Application in a Reconfigurable Tate Pairing Processor
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.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.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.