Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) - MaRDI portal

Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
scientific article

    Statements

    Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    The authors present a direct way to compute the coefficients of the irreducible factors of \(x^{2^ k}+1\) (\(k\geq 1\)) over \(F_ p\) for a prime \(p\equiv 3\bmod 4\). This problem is equivalent to the construction of the minimal polynomials of primitive \(2^{k+1}\)-th roots of unity over \(F_ p\) (which may be useful in applying the FFT) and to the construction of an irreducible polynomial of degree \(2^ e\). From the coefficients of the irreducible factors, one can produce quadratic residues and quadratic nonresidues in \(F_ p\).
    0 references
    0 references
    finite field
    0 references
    irreducible polynomial
    0 references
    primitive root of unity
    0 references
    fast Fourier transform
    0 references
    quadratic residues
    0 references
    quadratic nonresidues
    0 references
    0 references