搜索资源列表
byy
- 编程验证[x+1]是GF(28)=GF(2)[x]/(x8+x4+x3+x+1)的本原元，并给出GF(28)=GF(2)[x]/(x8+x4+x3+x+1)中以[x+1]为底的对数表和反对数表-Program verification [x+1] is the GF (28) = GF (2) [x]/(x8+ x4+ x3+ x+1) of the primitive element, and gives GF (28) = GF (2) [x]/(x8+ x4+ x3+ x+1) in or
BenYuanyuan
- 编程验证[x+1]是GF(28)=GF(2)[x]/(x8+x4+x3+x+1)的本原元，并给出GF(28)=GF(2)[x]/(x8+x4+x3+x+1)中以[x+1]为底的对数表，和同学讨论出来的比较资源占用较少的方法，只供参考。-Program verification [x+1] is the GF (28) = GF (2) [x]/(x8+ x4+ x3+ x+1) of the primitive element, and gives GF (28) = GF (2) [x]/(x