Efficient hardware architecture of ηT pairing accelerator over characteristic three

Szu Chi Chung, Jing Yu Wu, Hsing Ping Fu, Jen Wei Lee, Hsie-Chia Chang, Chen-Yi Lee

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

To support emerging pairing-based protocols related to cloud computing, an efficient algorithm/hardware codesign methodology of ηT pairing over characteristic three is presented. By mathematical manipulation and hardware scheduling, a single Miller's loop can be executed within 17 clock cycles. Furthermore, we employ torus representation and exploit the Frobenius map to lower the computation cost of final exponentiation. Pipelining and parallelization datapath are also exploited to shorten the critical path delay. Finally, by choosing suitable multiplier architecture and selecting an appropriate number of multipliers, Miller's loop and final exponentiation can be computed in a fully pipelined manner. With these schemes, a test chip for the proposed pairing accelerator has been fabricated in 90-nm CMOS 1P9M technology with a core area of 1.52 × 0.97 mm2. It performs a bilinear pairing computation over F(397) in 4.76 μs under 1.0 V supply and achieves 178% improvement to relative works in terms of area-time (AT) product. To support higher level of security, a 126-bit secure pairing accelerator that can complete a bilinear pairing computation over F(3709) in 36.2 μs is implemented and this result is at least 31% better than relative works in terms of AT product.

Original languageEnglish
Article number6744586
Pages (from-to)88-97
Number of pages10
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume23
Issue number1
DOIs
StatePublished - 1 Jan 2015

Keywords

  • Application-specific integrated circuit (ASIC) implementation
  • Elliptic curve
  • η pairing

Fingerprint Dive into the research topics of 'Efficient hardware architecture of η<sub>T</sub> pairing accelerator over characteristic three'. Together they form a unique fingerprint.

Cite this