Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA
暂无分享,去创建一个
[1] Hilarie K. Orman,et al. Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.
[2] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.
[3] Martijn Stam,et al. On Small Characteristic Algebraic Tori in Pairing-Based Cryptography , 2004, IACR Cryptol. ePrint Arch..
[4] Paulo S. L. M. Barreto. A note on efficient computation of cube roots in characteristic 3 , 2004, IACR Cryptol. ePrint Arch..
[5] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[6] Alfred Menezes,et al. Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.
[7] Victor S. Miller,et al. The Weil Pairing, and Its Efficient Calculation , 2004, Journal of Cryptology.
[8] G. Frey,et al. A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .
[9] Colm O. hEigeartaigh,et al. Pairing computation on hyperelliptic curves of genus 2 , 2006 .
[10] Ricardo Dahab,et al. High-Speed Software Multiplication in F2m , 2000, INDOCRYPT.
[11] Tsuyoshi Takagi,et al. Efficient Computations of the Tate Pairingfor the Large MOV Degrees , 2002, ICISC.
[12] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.
[13] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.
[14] Jürgen Teich,et al. Reconfigurable implementation of elliptic curve crypto algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[15] Alfred Menezes,et al. Field inversion and point halving revisited , 2004, IEEE Transactions on Computers.
[16] Nigel P. Smart,et al. Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems , 2002 .
[17] Christof Paar,et al. A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware , 2001, CHES.
[18] Frederik Vercauteren,et al. The Eta Pairing Revisited , 2006, IEEE Transactions on Information Theory.
[19] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[20] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..
[21] Akashi Satoh,et al. A Scalable Dual-Field Elliptic Curve Cryptographic Processor , 2003, IEEE Trans. Computers.
[22] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.