問題タブ [finite-field]
For questions regarding programming in ECMAScript (JavaScript/JS) and its various dialects/implementations (excluding ActionScript). Note JavaScript is NOT the same as Java! Please include all relevant tags on your question; e.g., [node.js], [jquery], [json], [reactjs], [angular], [ember.js], [vue.js], [typescript], [svelte], etc.
pari - pari-gpでは、有限体の原始元を見つける方法は?
たとえば、いくつかのとq^nの要素を含む有限体が必要です。プリミティブ要素を取得する方法は?prime qpositive n
aes - Irreducible polynomial in AES and GNU Octave
In the Rijndael AES proposal in section 2.1.2 they have chosen m(x) = x^8 + x^4 + x^3 + x + 1 and said it is an irreducible polynomial. This polynomial corresponds to integer 283.
Further in section 4.2.3, they have defined the value of M, the matrix used in MixColumn operation. I was trying to find its multiplicative inverse M⁻¹ in octave. I used the command
And octave gave me the following error:
error:
gf: primitive polynomial (283) of Galois Field must be irreducible
Can anyone please help me in explaining why I am getting this error? I have very little knowledge of fields, groups and similar abstract concepts.