このエントリーをはてなブックマークに追加
ID 14080
Eprint ID
14080
FullText URL
Author
Morikawa, Yoshitaka
Abstract
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.
Keywords
irreducible cubic polynomial
minimal polynomial
Published Date
2007-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Volume
volume41
Issue
issue1
Publisher
Faculty of Engineering, Okayama University
Publisher Alternative
岡山大学工学部
Start Page
11
End Page
19
ISSN
0475-0071
NCID
AA10699856
Content Type
Departmental Bulletin Paper
language
英語
File Version
publisher
Refereed
False
Eprints Journal Name
mfe