On the public citation graph

An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation

0 signed · 59 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11535218_16openalex-snapshot
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
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/11894063_11openalex-snapshot
Implementing Cryptographic Pairings on Smartcards
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-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-45682-1_30openalex-snapshot
Short Signatures from the Weil 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-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
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/s00145-004-0314-9openalex-snapshot
Short Signatures from the Weil Pairing
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.295852openalex-snapshot
More on squaring and multiplying large integers
inferredcites →https://doi.org/10.1109/fpt.2006.270309openalex-snapshot
FPGA accelerated tate pairing based cryptosystems over binary fields
inferredcites →https://doi.org/10.1109/iccias.2006.295256openalex-snapshot
Efficient Implementation of Tate Pairing on a Mobile Phone using Java
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.2004.43openalex-snapshot
Field inversion and point halving revisited
inferredcites →https://doi.org/10.1109/tc.2006.165openalex-snapshot
Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography
inferredcites →https://doi.org/10.1112/s1461157000000747openalex-snapshot
Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
inferredcites →https://doi.org/10.1137/s0097539701398521openalex-snapshot
Identity-Based Encryption from the Weil Pairing

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-540-72163-5_20openalex-snapshot
Some Efficient Algorithms for the Final Exponentiation of η T Pairing
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/978-3-540-74735-2_17openalex-snapshot
Arithmetic Operators for Pairing-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-75651-4_4openalex-snapshot
Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing
inferred← citeshttps://doi.org/10.1007/978-3-540-77535-5_1openalex-snapshot
Universal η T Pairing Algorithm over Arbitrary Extension Degree
inferred← citeshttps://doi.org/10.1007/978-3-540-77535-5_15openalex-snapshot
Efficient Implementation of the Pairing on Mobilephones Using BREW
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_21openalex-snapshot
An Efficient Countermeasure against Side Channel Attacks for Pairing Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-85538-5_19openalex-snapshot
Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
inferred← citeshttps://doi.org/10.1007/978-3-540-85538-5_20openalex-snapshot
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
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-19379-8_7openalex-snapshot
Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three
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.2009.05.001openalex-snapshot
FPGA and ASIC implementations of the pairing in characteristic three
inferred← citeshttps://doi.org/10.1016/j.ins.2009.10.015openalex-snapshot
Signcryption from randomness recoverable public key encryption
inferred← citeshttps://doi.org/10.1080/00207210801924099openalex-snapshot
Horner's rule-based multiplication over GF(p) and GF(pn): a survey
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.221openalex-snapshot
Some Efficient Algorithms for the Final Exponentiation of T Pairing
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.9.2379openalex-snapshot
Reduction Optimal Trinomials for Efficient Software Implementation of the T Pairing
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.5.1330openalex-snapshot
Efficient Implementation of the Pairing on Mobilephones Using BREW
inferred← citeshttps://doi.org/10.1109/depcos-relcomex.2009.37openalex-snapshot
On Hardware and Software Implementation of Arithmetic in Finite Fields of Characteristic 7 for Calculation of Pairings
inferred← citeshttps://doi.org/10.1109/fpt.2009.5377681openalex-snapshot
HW/SW co-design of Identity-Based Encryption using a custom instruction set
inferred← citeshttps://doi.org/10.1109/hite63532.2024.10777108openalex-snapshot
Fast Implementation of Eta-T pairing on FPGAs
inferred← citeshttps://doi.org/10.1109/hpcc.2008.52openalex-snapshot
A New Path Verification Protocol for Securing BGP
inferred← citeshttps://doi.org/10.1109/iccs.2008.4737331openalex-snapshot
IBAPV: An identity-Based aggregate path verification protocol for securing BGP
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/iita.2008.142openalex-snapshot
A Secure Inter-Domain Routing Protocol
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/mines.2009.211openalex-snapshot
A Security Scheme of BGP Base on Aggregate Signatures Algorithm
inferred← citeshttps://doi.org/10.1109/nca.2009.30openalex-snapshot
TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory
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/wcnc.2010.5506580openalex-snapshot
TinyPairing: A Fast and Lightweight Pairing-Based Cryptographic Library for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.12785/amis/080613openalex-snapshot
Towards Secure Data Exchange in Peer-to-Peer Data Management Systems
inferred← citeshttps://doi.org/10.1504/ijhpsa.2007.015393openalex-snapshot
A flexible processor for the characteristic 3 ηT pairing
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.508openalex-snapshot
Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.909openalex-snapshot
Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
inferred← citeshttps://doi.org/10.22201/icat.16656423.2011.9.03.427openalex-snapshot
Achieving Identity-Based Cryptography in a Personal Digital Assistant Device
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.