FPGA Implementation of a GF(2m) Tate Pairing Architecture
暂无分享,去创建一个
[1] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.
[2] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[3] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.
[4] Chi Sung Laih,et al. Advances in Cryptology - ASIACRYPT 2003 , 2003 .
[5] Tim Kerins,et al. A Dedicated Processor for the eta Pairing , 2005, IACR Cryptol. ePrint Arch..
[6] Sean W. Smith,et al. Aggregated path authentication for efficient BGP security , 2005, CCS '05.
[7] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .
[8] Ratna Dutta,et al. Pairing-Based Cryptographic Protocols : A Survey , 2004, IACR Cryptol. ePrint Arch..
[9] Paulo S. L. M. Barreto,et al. Hardware accelerators for pairing based cryptosystems , 2005 .
[10] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[11] S. C. Shantz. From Euclid's GCD to Montgomery Multiplication to the Great Divide , 2001 .
[12] Moti Yung,et al. Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.
[13] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..
[14] W. Marnane,et al. FPGA implementation of a GF(2/sup 2M/) multiplier for use in pairing based cryptosystems , 2005, International Conference on Field Programmable Logic and Applications, 2005..
[15] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.