Mem_Fac_Eng_OU_35_197.pdf 332 KB
Modern communication engineerings, such as elliptic curve cryptographies, often requires algebra on finite extension field defined by modulus arithmetic with an irreducible polynomial. This paper provides a new method to detemine the minimal (irreducible) polynomial of a given proper element in finite extension field. In the conventional determination method, as we have to solve the simultaneous equations, the computation is very involved. In this paper, the well known "trace" is extended to higher degree traces. Using the new traces, we yield the coefficient formula of the desired minimal polynomial. The new method becomes very simple without solving the simultaneous equations, and about twice faster than the conventional method in computation speed.
higher degree trace
Memoirs of the Faculty of Engineering, Okayama University
Faculty of Engineering, Okayama University
Departmental Bulletin Paper
|Eprints Journal Name||