Name
Abstract | ||
|---|---|---|
Normal basis in finite fields has proved to be very useful for fast arithmetic computations, The elements in a normal basis are exactly the roots of a normal polynomial, Hence a normal polynomial is just another way of describing a normal basis. In this paper, we give some computational results of normal polynomial up to degree n = 19 according to the fast algorithm from Chang et al. [1]. |
Year | Venue | Keywords |
|---|---|---|
2007 | Lecture Notes in Engineering and Computer Science | normal basis,normal polynomial,finite field |
Field | DocType | Citations |
Cantor–Zassenhaus algorithm,Cyclotomic fast Fourier transform,Mathematical optimization,Finite field,Polynomial,Computer science,Algorithm,Berlekamp–Massey algorithm | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chih-Hua Chien | 1 | 8 | 1.26 |
| Trieu-Kien Truong | 2 | 382 | 59.00 |
| Yaotsu Chang | 3 | 130 | 18.59 |
| Chih-Hsuan Chen | 4 | 1 | 0.73 |