JOURNAL BROWSE
Search
Advanced SearchSearch Tips
CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS
Kim, Hyung-Don; Kim, Jae-Moon; Yie, Ik-kwon;
  PDF(new window)
 Abstract
Motivated by XTR cryptosystem which is based on an irreducible polynomial over , we study polynomials of the form over with . In this paper, we establish a one to one correspondence between the set of such polynomials and a certain set of cubic polynomials over . Our approach is rather theoretical and provides an efficient method to generate irreducible polynomials over .
 Keywords
irreducibility;normal basis;Hilbert Theorem 90;
 Language
English
 Cited by
1.
GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS,;;

Korean Journal of Mathematics, 2011. vol.19. 3, pp.263-272 crossref(new window)
1.
Corporate Social Responsibility, Corporate Governance and Earnings Quality: Evidence from Korea, Corporate Governance: An International Review, 2013, 21, 5, 447  crossref(new windwow)
2.
Spatio-temporal change in forest cover and carbon storage considering actual and potential forest cover in South Korea, Science China Life Sciences, 2015, 58, 7, 713  crossref(new windwow)
3.
Geochemical signature related to lipid biomarkers of ANMEs in gas hydrate-bearing sediments in the Ulleung Basin, East Sea (Korea), Marine and Petroleum Geology, 2013, 47, 125  crossref(new windwow)
4.
Groundwater and stream water exchange revealed by water chemistry in a hyporheic zone of agricultural area, Paddy and Water Environment, 2014, 12, 1, 89  crossref(new windwow)
5.
A correspondence of certain irreducible polynomials over finite fields, Finite Fields and Their Applications, 2012, 18, 2, 384  crossref(new windwow)
 References
1.
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. crossref(new window)

2.
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. crossref(new window)

3.
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. crossref(new window)

4.
A. J. Menezes, Applications of Finite Fields, Kluwer Academic Publishers, 1993.