A reconfigurable implementation of the tate pairing computation over GF(2m)*

Authors:
Weibo Pan;William Marnane
Affiliations:
Dept. of Electrical and Electronic Engineering, University College Cork, Cork City, Ireland;Dept. of Electrical and Electronic Engineering, University College Cork, Cork City, Ireland
Venue:
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Year:
2010

Citing 11
Cited 1

Performance analysis of elliptic curve cryptography for SSL

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Implementation of Elliptic Curve Arithmetic in GF(pn)

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
From Euclid's GCD to Montgomery Multiplication to the Great Divide

From Euclid's GCD to Montgomery Multiplication to the Great Divide
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three

IEEE Transactions on Computers
High-speed hardware implementations of Elliptic Curve Cryptography: A survey

Journal of Systems Architecture: the EUROMICRO Journal
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field

Journal of Systems Architecture: the EUROMICRO Journal
Efficient tate pairing computation for elliptic curves over binary fields

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
High security pairing-based cryptography revisited

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory

A correlation power analysis attack against tate pairing on FPGA

ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the performance of a closed formula implemented in reconfigurable hardware for the Tate pairing Algorithm over the binary field of GF(2m) is studied. Using the algorithm improvement of Soonhak Kwon [2], the schedule for performing the Tate pairing without a square root operation is explored along with the area and time consumption trade-offs involved in the hardware implementation of the target algorithm.