Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields

Authors:
Chang Shu;Soonhak Kwon;Kris Gaj
Affiliations:
George Mason University, Fairfax;Sungkyunkwan University, Suwon;George Mason University, Fairfax
Venue:
IEEE Transactions on Computers
Year:
2009

Citing 0
Cited 6

Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Network-on-Chip interconnect for pairing-based cryptographic IP cores

Journal of Systems Architecture: the EUROMICRO Journal
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Compact hardware for computing the tate pairing over 128-bit-security supersingular curves

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
High speed cryptoprocessor for ηT pairing on 128-bit secure supersingular elliptic curves over characteristic two fields

CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Cryptography with fast point multiplication by using ASCII codes and its implementation

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Tate-pairing-based cryptosystems, because of their ability to be used in multiparty identity-based key management schemes, have recently emerged as an alternative to traditional public key cryptosystems. Due to the inherent parallelism of the existing pairing algorithms, high performance can be achieved via hardware realizations. Three schemes for Tate pairing computations have been proposed in the literature: cubic elliptic, binary elliptic, and binary hyperelliptic. In this paper, we propose a new FPGA-based architecture of the Tate-pairing-based computation over binary fields. Even though our field sizes are larger than in the architectures based on cubic elliptic curves or binary hyperelliptic curves with the same security strength, nevertheless fewer multiplications in the underlying field need to be performed. As a result, the computational latency for a pairing computation has been reduced, and our implementation runs 2-20 times faster than the equivalent implementations of other pairing-based schemes at the same level of security strength. Furthermore, we ported our pairing designs for eight field sizes ranging from 239 to 557 bits to the reconfigurable computer, SGI Altix 4700 supported by Silicon Graphics, Inc., and performance and cost are demonstrated.