nan

Vol. 13, No. 2, pp. 127-132, 4월. 2003
10.13089/JKIISC.2003.13.2.127, Full Text:
Keywords: Crptography, Finite field GF(2$^{m}$ ), Multiplicative inversion, Format′s theorem, Normal bases
Abstract

nan

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
장용희 and 권용진, "A Fast Method for Computing Multiplcative Inverses in GF(2$^{m}$ ) Using Normal Bases," Journal of The Korea Institute of Information Security and Cryptology, vol. 13, no. 2, pp. 127-132, 2003. DOI: 10.13089/JKIISC.2003.13.2.127.

[ACM Style]
장용희 and 권용진. 2003. A Fast Method for Computing Multiplcative Inverses in GF(2$^{m}$ ) Using Normal Bases. Journal of The Korea Institute of Information Security and Cryptology, 13, 2, (2003), 127-132. DOI: 10.13089/JKIISC.2003.13.2.127.