Hi everybody, I have some programming difficulties on the maple, this is the algorithm and link article, hope everyone help me, please, thank you so much!!
1: for Search every non-singular m × m matrix T with a few of XORs over F2. do
2: Find the minimum polynomial f(x) of T.
3: if f(x) = g(x)t(x) satisfying g(x) 6= 1, t(x) 6= 1 and g(x) is relatively prime with t(x). then
4: Find ri1(x), ri2 satisfying g(x)ri1 +t(x)ri2 = 1. Let pi1=g(x)ri1, pi2=t(x)ri2 = 1 . Sore pi1 and pi2.
5: end if
6: end for
7: for i from 1 to k. do
8: for Search a over F2[x]/(fi(x)). do
9: for Search b over F2[x]/(fi(x)). do
10: c = a + pi1(x), d = b + pi2.
11: if The circulant orthogonal matrix (a, b, c, d) is MDS. then
12: Store fi(x) and (a, b, c, d).
13: end if
14: end for
15: end for
16: end for
17: for Search every m × m non-singular matrix T with a few of XORs. do
18: for i from 1 to k. do
19: if fi(T) = 0. then
20: Substitute T into corresponding circulant orthogonal MDS matrix (a, b, c, d). Compute the sum of XORs of (a, b, c, d).
21: end if
22: end for
23: end for