Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.

MLA

Haining Fan, and M.Anwar Hasan. “Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.” IEEE Transactions on Computers, vol. 55, no. 9, Sept. 2006, pp. 1202–06. EBSCOhost, https://doi.org/10.1109/TC.2006.152.

APA

Haining Fan, & Hasan, M. A. (2006). Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. IEEE Transactions on Computers, 55(9), 1202–1206. https://doi.org/10.1109/TC.2006.152

Chicago

Haining Fan, and M. Anwar Hasan. 2006. “Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.” IEEE Transactions on Computers 55 (9): 1202–6. doi:10.1109/TC.2006.152.