|
|||||
|
|
Fast algorithm for finding primitive polynomials over GF(q) |
|
| Authors: | Di Porto A Guida F Montolivo E |
| Affiliation: | Fondazione Ugo Bordoni, Rome, Italy; |
| Abstract: | An efficient algorithm for the construction of primitive polynomials of degree m over GF(q) is proposed. The algorithm runs in time O(km/sup 2/), where k is an integer such that gcd (k,q/sup m-1/)=1.< |
| Keywords: | |