Browse > Article
http://dx.doi.org/10.4134/JKMS.2009.46.1.001

CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS  

Kim, Hyung-Don (DEPARTMENT OF MATHEMATICS INHA UNIVERSITY)
Kim, Jae-Moon (DEPARTMENT OF MATHEMATICS INHA UNIVERSITY)
Yie, Ik-kwon (DEPARTMENT OF MATHEMATICS INHA UNIVERSITY)
Publication Information
Journal of the Korean Mathematical Society / v.46, no.1, 2009 , pp. 1-12 More about this Journal
Abstract
Motivated by XTR cryptosystem which is based on an irreducible polynomial $x^3-cx^2+c^px-1$ over $F_{p^2}$, we study polynomials of the form $F(c,x)=x^3-cx^2+c^qx-1$ over $F_{p^2}$ with $q=p^m$. In this paper, we establish a one to one correspondence between the set of such polynomials and a certain set of cubic polynomials over $F_q$. Our approach is rather theoretical and provides an efficient method to generate irreducible polynomials over $F_{p^2}$.
Keywords
irreducibility; normal basis; Hilbert Theorem 90;
Citations & Related Records

Times Cited By Web Of Science : 3  (Related Records In Web of Science)
Times Cited By SCOPUS : 1
연도 인용수 순위
1 A. K. Lenstra and E. R. Verheul, Key improvements to XTR, Advances in cryptology-ASIACRYPT 2000 (Kyoto), 220–233, Lecture Notes in Comput. Sci., 1976, Springer, Berlin, 2000.   DOI   ScienceOn
2 A. K. Lenstra and E. R. Verheul, Fast irreducibility and subgroup membership testing in XTR, Public key cryptography (Cheju Island, 2001), 73–86, Lecture Notes in Comput. Sci., 1992, Springer, Berlin, 2001.   DOI   ScienceOn
3 A. K. Lenstra and E. R. Verheul, The XTR public key system, Advances in cryptology-CRYPTO 2000 (Santa Barbara, CA), 1–19, Lecture Notes in Comput. Sci., 1880, Springer, Berlin, 2000.   DOI   ScienceOn
4 A. J. Menezes, Applications of Finite Fields, Kluwer Academic Publishers, 1993.