Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
暂无分享,去创建一个
[1] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[2] Volker Müller. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two , 1998, Journal of Cryptology.
[3] Michael J. Wiener,et al. Faster Attacks on Elliptic Curve Cryptosystems , 1998, Selected Areas in Cryptography.
[4] Ernest F. Brickell,et al. Fast Exponentiation with Precomputation (Extended Abstract) , 1992, EUROCRYPT.
[5] Neal Koblitz,et al. CM-Curves with Good Cryptographic Properties , 1991, CRYPTO.
[6] Servaas Vandenberghe,et al. A Fast Software Implementation for Arithmetic Operations in GF(2n) , 1996, ASIACRYPT.
[7] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[8] Neal Koblitz,et al. An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm , 1998, CRYPTO.
[9] Hugo Krawczyk,et al. Advances in Cryptology - CRYPTO '98 , 1998 .
[10] Joan Feigenbaum,et al. Advances in Cryptology-Crypto 91 , 1992 .
[11] Kwangjo Kim,et al. Advances in Cryptology — ASIACRYPT '96 , 1996, Lecture Notes in Computer Science.
[12] Jung Hee Cheon,et al. Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map , 1998, Public Key Cryptography.
[13] Christof Paar,et al. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.
[14] Jerome A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves , 1997, CRYPTO.
[15] Ronald C. Mullin,et al. Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..
[16] Rainer A. Rueppel. Advances in Cryptology — EUROCRYPT’ 92 , 2001, Lecture Notes in Computer Science.
[17] Atsuko Miyaji,et al. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.
[18] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .