Table 3 Complexity of the fast algorithms for N = p s , where ADD and MUL denote additions and multiplications
From: An explicit construction of fast cocyclic jacket transform on the finite field with any size
| Â | Direction method | Fast algorithms |
|---|---|---|
ADD | (N−1)N | s ps(p−1) |
MUL | N 2 | s ps−1(p−1)2 |