论文信息 - Hardware accelerators for pairing based cryptosystems

Hardware accelerators for pairing based cryptosystems

Polynomial basis hardware architectures are described for the mathematical operations required in pairing based cryptosystems in characteristic p = 3. In hardware, arithmetic operations in extension fields of GF(3m) can be parallelised, and this results in high performance dedicated processors for efficient Tate pairing calculation. The implementation aspects of two such hardware processors are discussed through prototyping over GF(397) on the Xilinx Virtex2 and Virtex2Pro FPGA technologies.

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

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

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

[4] Martijn Stam,et al. Hardware and software normal basis arithmetic for pairing-based cryptography in characteristic three , 2005, IEEE Transactions on Computers.

[5] G. Frey,et al. A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[6] Andreas Curiger,et al. On Computing Multiplicative Inverses in GF(2^m) , 1993, IEEE Trans. Computers.

[7] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[8] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[9] Guido Bertoni,et al. Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications , 2003, CT-RSA.

[10] H. T. Kung,et al. Systolic VLSI Arrays for Polynomial GCD Computation , 1984, IEEE Transactions on Computers.