TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory
Published: Jul 1, 2009
Abstract
Since the introduction of bilinear pairing to public key cryptography in 2001, pairing has been considered as one of the most expensive public key operations in terms of both computational complexity and memory requirement. Recently some work has been done on improving the computation time of pairing on resource-constrained wireless sensors. However, little has been focused on reducing the memory consumption. In this paper, we propose three new...
Paper Details
Title
TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory
Published Date
Jul 1, 2009
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History