このエントリーをはてなブックマークに追加
ID 14080
Eprint ID
14080
フルテキストURL
著者
Nogami, Yasuyuki The Graduate School of Natural Science and Technology Okayama University
Morikawa, Yoshitaka The Graduate School of Natural Science and Technology Okayama University
抄録
This paper proposes an algorithm for generating irreducible cubic trinomials in the form x(3) + ax + b, b ∈ F(p), where a is a certain fixed non-zero element in the prime field F(p). The proposed algorithm needs a certain irreducible cubic trinomial over F(p) to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a certain parameter in F(p). In this paper, we compare the calculation cost and the average computation time for generating an irreducible cubic polynomial, especially trinomial, among Hiramoto et al. irreducibility testing algorithm, Berlekamp-Massey minimal polynomial determining algorithm, and the proposed algorithm. From the experimental results, it is shown that the proposed algorithm is the fastest among the three algorithms for generating irreducible cubic trinomials.
キーワード
irreducible cubic polynomial
minimal polynomial
発行日
2007-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
41巻
1号
出版者
Faculty of Engineering, Okayama University
出版者(別表記)
岡山大学工学部
開始ページ
11
終了ページ
19
ISSN
0475-0071
NCID
AA10699856
資料タイプ
紀要論文
言語
English
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe