Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers

Abstract : This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propose here a novel hardware implementation of Miller's loop based on a pipelined Karatsuba-Ofman multiplier. Thanks to a careful selection of algorithms for computing the tower field arithmetic associated to the Tate pairing, we manage to keep the pipeline busy. We also describe the strategies we considered to design our parallel multiplier. They are included in a VHDL code generator allowing for the exploration of a wide range of operators. Then, we outline the architecture of a coprocessor for the Tate pairing over $\mathbb{F}_{3^m}$. However, a final exponentiation is still needed to obtain a unique value, which is desirable in most of the cryptographic protocols. We supplement our pairing accelerator with a coprocessor responsible for this task. An improved exponentiation algorithm allows us to save hardware resources. According to our place-and-route results on Xilinx FPGAs, our design improves both the computation time and the area-time trade-off compared to previoulsy published coprocessors.
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download

https://hal.inria.fr/inria-00424011
Contributor : Jérémie Detrey <>
Submitted on : Tuesday, October 13, 2009 - 4:46:51 PM
Last modification on : Thursday, January 11, 2018 - 6:21:04 AM
Long-term archiving on : Tuesday, October 16, 2012 - 12:11:26 PM

File

bdeor_ches2009.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez. Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. 11th International Workshop on Cryptographic Hardware and Embedded Systems - CHES 2009, Sep 2009, Lausanne, Switzerland. pp.225-239, ⟨10.1007/978-3-642-04138-9_17⟩. ⟨inria-00424011⟩

Share

Metrics

Record views

362

Files downloads

1365