testprim5.m

来自「Mathematical Methods by Moor n Stiling.」· M 代码 · 共 9 行

% generate elements in GF(5^2) using p(x) = x^2 + x+2
% Copyright 1999 by Todd K. Moon

g = [1];
for i=0:25
  disp(g)
  g = mod(polymult(g,[1 0]),5);
  [q,g] = polydivgfp(g,[1 1 2],5);
end