Page 331 - Hardware Implementation of Finite-Field Arithmetic

An Example of Application—Elliptic Curve Cryptography 311

10.7 References
[ARS78] L. M. Adleman, R. L. Rivest, and A. Shamir. “A Method for Obtaining
Digital Signatures and Public-key Cryptosystems.” Communications of the ACM,
21, pp. 120–126, 1978.
[BSS99] I. F. Blake, G. Seroussi, and N. P. Smart. Elliptic Curves in Cryptography.
Cambridge University Press, Cambridge, 1999.
[ElG85] T. ElGamal. “A Subexponential-time Algorithm for Computing Discrete
2
Logarithms over GF(p ).” IEEE Transactions on Information Theory, IT-31,
pp. 473–481, 1985.
[HMV04] D. Hankerson, A. Menezes, and S. Vanstone. Guide to Elliptic Curve
Cryptography. Springer, New York, 2004.
[LD99] J. López and R. Dahab. “Improved Algorithm for Elliptic Curve Arithmetic
n
in GF(2 ).” Lecture Notes in Computer Science, 1556, pp. 201–212, Springer-Verlag,
1999.
[Sol00] J. Solinas. “Efficient Arithmetic on Koblitz Curves.” Designs, Codes and
Cryptography, no. 19, pp. 195–249, 2000.