@article{koc1998montgomery,
author = {Koc, Cetin K. and Acar, Tolga},
title = {Montgomery Multiplication in GF(2 ^k)},
year = {1998},
month = {March},
abstract = {We show that the multiplication operation c=a · b · r^-1 in the field GF(2^k) can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2^k). The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.},
url = {http://approjects.co.za/?big=en-us/research/publication/montgomery-multiplication-in-gf2k/},
pages = {57-69},
journal = {Designs, Codes and Cryptography},
volume = {14},
number = {1},
}