Paper 2005/065 Original: eprint.iacr.org/2005/065 ↗
Efficient hardware for the Tate pairing calculation in characteristic three
Abstract
In this paper the benefits of implementation of the Tate pairing computation in dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field $GF(3^{6m})$ are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field $GF(3^m)$. Using this approach an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2005-03-01: last updated
- 2005-03-01: published
- Short URL
- https://ia.cr/2005/065
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/065,
author = {T. Kerins and W. P. Marnane and E. M. Popovici and P. S. L. M. Barreto},
title = {Efficient hardware for the Tate pairing calculation in characteristic three},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/065},
year = {2005},
url = {https://eprint.iacr.org/2005/065}
}