References
- N. Koblitz, "Elliptic Curve cryptosystems," Math. Comp. 48, 1987, pp. 203-209. https://doi.org/10.1090/S0025-5718-1987-0866109-5
- G. Harper, A. Menezes, and S. Vanstone, "Public-key Cryptosystems with very small key length," Eurocrypto 92, Springer-Verlag. Balatonfured, Hungary, May 1992, pp. 163-172.
- C.-H. Kim, S.-H. Oh, J.-I. Lim, K.-S. Suh, and J.-C. Yoon, "Operations in finite fields using modified method," J. Korea Institute of Information Security and Cryptography, vol. 8, no. 2, 1998, pp. 27-36.
- H. Cohen, A Course in Computational Algebraic Number Theory. New York : Springer-Verlag, 2000.
- U.-S. Choi and S.-J. Cho, "Design of Binary Sequence with optimal Cross-correlation Values," J. of The Korea Institute of Electronic Communication Sciences, vol. 6, no. 4, 2011, pp. 539-544,
- H.-D. Kim, S.-J. Cho, M.-J. Kwon, and H.-J. An, "A study on the cross-correlation function of extended Zeng sequences," The J. of The Korea Institute of Electronic Communication Sciences, vol. 7, no. 1, 2012, pp. 61-67.
-
T. Itoh, O. Teechal, and S. Tsujii, "A fast algorithm for computing multiplicative inverse in
$GF(2^n)$ using normal bases," J. Soc. Electro. Comm.(Japan), vol. 44, 1986, pp. 31-36. - Y. Kim, "A Fast Multiplier of Composite fields over finite fields," J. of The Korea Institute of Electronic Communication Sciences, vol. 6, no. 3, 2011, pp. 389-395.
-
G. Agnew, T. Beth, B. Mullin, and S. Vanstone, "Arithmetic Operations in
$GF(2^n)$ ," J. Cryptology, vol. 6, 1993, pp. 3-13. https://doi.org/10.1007/BF02620228 - Y. Kim, "Fast Sequential Optimal normal Bases Multipliers over finite fields," J. of The Korea Institute of Electronic Communication Sciences, vol. 8, no. 8, 2013, pp. 1207-1212. https://doi.org/10.13067/JKIECS.2013.8.8.1207
- U.-S. Choi, S.-J. Cho, and S.-H. Kwon, "Analysis of Cross Correlation of Extended Non-linear Binary Sequences," J. of The Korea Institute of Electronic Communication Sciences, vol. 7, no. 2, 2012, pp. 263-269.