论文信息 - FPGA implementation of a GF(2/sup 2M/) multiplier for use in pairing based cryptosystems

FPGA implementation of a GF(2/sup 2M/) multiplier for use in pairing based cryptosystems

In this paper an architecture for GF(2/sup 4m/) multiplication is outlined. It is illustrated how this operation is critical to efficient hardware implementation of the Tale pairing, which itself is the underlying calculation in many new pairing based cryptosystems. Tate pairing calculation times using an FPGA hardware accelerator are estimated based on results from the multiplier architecture.

W. Marnane | M. Keller | T. Kerins

[1] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .

[2] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[3] Ratna Dutta,et al. Pairing-Based Cryptographic Protocols : A Survey , 2004, IACR Cryptol. ePrint Arch..

[4] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.

[5] Christof Paar,et al. Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents , 1999, IEEE Trans. Computers.

[6] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..

[7] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.

[8] Christof Paar,et al. Efficient Multiplier Architectures for Galois Fields GF(2 4n) , 1998, IEEE Trans. Computers.

[9] S. C. Shantz. From Euclid's GCD to Montgomery Multiplication to the Great Divide , 2001 .