Computing cryptographic pairing in sensors

Authors:
Zhibin Zhou;Dijiang Huang
Affiliations:
Arizona State University;Arizona State University
Venue:
ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Year:
2008

Citing 2
Cited 0

Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a methodology and preliminary result of computing the Tate Pairing on a supersingular curve over a prime field in the wireless sensors (MICAz Mote). The aim of this work is to study the feasibility of pairing based protocols and applications in sensors with limited computational resources. Tate pairing is the most computationally intensive computation in most pairing-based cryptographic algorithms. Our preliminary results showed that without hardware upgrades (esp. memory) or further optimization of algorithms and parameters, sensors not yet ready for computing pairing-based cryptographic algorithms.