Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\) (Q2302584): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2931163740 / rank
 
Normal rank

Revision as of 21:41, 19 March 2024

scientific article
Language Label Description Also known as
English
Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
scientific article

    Statements

    Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\) (English)
    0 references
    0 references
    0 references
    26 February 2020
    0 references
    Müller-Cohen-Matthews polynomial
    0 references
    Dickson polynomial
    0 references
    zeros of polynomial
    0 references
    irreducible polynomial
    0 references

    Identifiers