Skip to main navigation Skip to search Skip to main content

Hardware implementation of pairings

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

In this chapter the efficient hardware implementation of pairings is considered. For each of the three fields F2m, F3m and Fp suitable curves, pairing algorithms and field arithmetic architectures are presented. An example architecture for computing the ηT pairing in characteristic 2 or 3 is presented and its implementation results on a Xilinx FPGA considered. Finally the implementation results of several pairing architectures from the literature are discussed.

Original languageEnglish
Title of host publicationIdentity-Based Cryptography
PublisherIOS Press
Pages207-225
Number of pages19
ISBN (Print)9781586039479
DOIs
Publication statusPublished - 2009

Publication series

NameCryptology and Information Security Series
Volume2
ISSN (Print)1871-6431
ISSN (Electronic)1879-8101

Keywords

  • BKLS
  • FPGA
  • hardware implementation
  • parallel arithmetic
  • Tate pairing

Cite this