Parallel Multiplication in GF (2k) using Polynomial Residue Arithmetic

Designs, Codes, and Cryptography

Volumn 20, Issue 2, 2000, Pages 155-173

  Halbutogullari, A ^a   Koc, C K ^b  

^a UNIVERSITY OF BASILICATA   (Italy)

^b Oregon State University   (United States)

Author keywords

Cryptography; Finite field multiplication; Parallel algorithm; Residue arithmetic

Indexed keywords

EID: 0042981059     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008389508626     Document Type: Article

References (8)

1. W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, Vol. 22 (November 1976) pp. 644-654.
2. D. E. Knuth, The Art of Computer Programming, Volume 2, Seminumerical Algorithms, Third edition, Addison-Wesley, Reading, MA (1998).
3. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, Vol. 48, No. 177 (January 1987) pp. 203-209.
4. k), Design, Codes and Cryptography, Vol. 14, No. 1 (April 1998) pp. 57-69.
5. J. H. McClellan and C. M. Rader, Number Theory in Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ (1979).
6. A. J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Boston, MA (1993).
7. V. Miller, Uses of elliptic curves in cryptography, In H. C. Williams, editor, Advances in Cryptology - CRYPTO 85 Proceedings (H. C. Williams, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 218 (1985) pp. 417-426.
8. J. Omura and J. Massey, Computational method and apparatus for finite field arithmetic, U. S. Patent Number 4,587,627 (May 1986).