A Reconfigurable Processor for the Cryptographic ηT Pairing in Characteristic 3
暂无分享,去创建一个
[1] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..
[2] Guido Bertoni,et al. Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications , 2003, CT-RSA.
[3] Soonhak Kwon,et al. Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields , 2005, ACISP.
[4] Masaaki Shirase,et al. An Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation , 2006, IACR Cryptol. ePrint Arch..
[5] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.
[6] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.
[7] Gerardo Pelosi,et al. Parallel Hardware Architectures for the Cryptographic Tate Pairing , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).
[8] Paulo S. L. M. Barreto,et al. Efficient Hardware for the Tate Pairing Calculation in Characteristic Three , 2005, CHES.
[9] Masaaki Shirase,et al. An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).
[10] Dan Page,et al. Hardware Acceleration of the Tate Pairing in Characteristic Three , 2005, CHES.
[11] Tim Kerins,et al. Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption Schemes , 2004, FPL.
[12] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .
[13] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.