Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
暂无分享,去创建一个
Jung Hee Cheon | Sangwoo Park | Daeho Kim | Sung-Mo Park | J. Cheon | Daeho Kim | Sung-Mo Park | Sang‐Hoon Park
[1] Yukio Tsuruoka,et al. Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method , 1992, CRYPTO.
[2] Christof Paar,et al. Efficient Algorithms for Elliptic Curve Cryptosystems , 1997, CRYPTO.
[3] Jerome A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves , 1997, CRYPTO.
[4] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[5] Bart Preneel,et al. Elliptic Curve Public-Key Cryptosystems - An Introduction , 1997, State of the Art in Applied Cryptography.
[6] Willi Meier,et al. Efficient Multiplication on Certain Nonsupersingular Elliptic Curves , 1992, CRYPTO.
[7] Neal Koblitz,et al. CM-Curves with Good Cryptographic Properties , 1991, CRYPTO.
[8] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[9] J. Olivos,et al. Speeding up the computations on an elliptic curve using addition-subtraction chains , 1990, RAIRO Theor. Informatics Appl..
[10] N. Koblitz. A Course in Number Theory and Cryptography , 1987 .