Google

Go to the first, previous, next, last section, table of contents.


ntogf2n

ntogf2n(m)
:: ¼«Á³¿ô¤ò GF(2^n) ¤Î¸µ¤ËÊÑ´¹
return
GF(2^n) ¤Î¸µ
m
ÈóÉéÀ°¿ô
  • ¼«Á³¿ô m ¤Î 2 ¿Êɽ¸½ m=m0+m1*2+...+mk*2^k ¤ËÂФ·, GF(2^n)=GF(2)[t]/(g(t)) ¤Î¸µ m0+m1*t+...+mk*t^k mod g(t) ¤òÊÖ¤¹.
  • ÄêµÁ¿¹à¼°¤Ë¤è¤ë¾ê;¤Ï¼«Æ°Åª¤Ë¤Ï·×»»¤µ¤ì¤Ê¤¤¤¿¤á, simp_ff() ¤ò ŬÍѤ¹¤ëɬÍפ¬¤¢¤ë.
[1] setmod_ff(x^30+x+1);
x^30+x+1
[2] N=ntogf2n(2^100);
(@^100)
[3] simp_ff(N);
(@^13+@^12+@^11+@^10)
»²¾È
section gf2nton


Go to the first, previous, next, last section, table of contents.