TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory

@article{Xiong2009TinyPairingCT,
  title={TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory},
  author={Xiaokang Xiong and Duncan S. Wong and Xiaotie Deng},
  journal={2009 Eighth IEEE International Symposium on Network Computing and Applications},
  year={2009},
  pages={187-194}
}
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 algorithms for speeding up the computation and… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Efficient implementation of pairing on sensor nodes

  • T. Ishiguro, M. Shirase, T.Takagi
  • Identity Based Encryption Workshop, NIST, 2008…
  • 2008
3 Excerpts

Efficient implementation of ηt pairing on ATmega128L

  • T. Ishiguro, M. Shirase, T. Takagi
  • IPSJ Journal (in Japanese), vol. Vol.49, No.11…
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…