Finding Isomorphisms Between Finite Fields
From MaRDI portal
Publication:3491686
DOI10.2307/2008545zbMath0709.11072OpenAlexW4214951289MaRDI QIDQ3491686
Publication date: 1991
Full work available at URL: https://doi.org/10.2307/2008545
Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items
Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝, Homomorphic Encryption and Some Black Box Attacks, Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\), \#P-completeness of counting roots of a sparse polynomial, Constructing Isogenies between Elliptic Curves Over Finite Fields, On finding primitive roots in finite fields, Constructing normal bases in finite fields, Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\), Some results on uniform arithmetic circuit complexity, Algorithms in Algebraic Number Theory, Iterated constructions of irreducible polynomials over finite fields with linearly independent roots, Univariate polynomial factorization over finite fields, Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations, The BC-system and \(L\)-functions, A fast algorithm to compute irreducible and primitive polynomials in finite fields, On the discrete logarithm problem in finite fields of fixed characteristic, Generators and irreducible polynomials over finite fields, Computing isomorphisms and embeddings of finite fields, The module isomorphism problem reconsidered., Constructing nonresidues in finite fields and the extended Riemann hypothesis, Computational problems in the theory of finite fields, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Recursive constructions of N-polynomials over \(\text{GF}(2^s)\), Specific irreducible polynomials with linearly independent roots over finite fields, Factoring polynomials over special finite fields, Searching for Primitive Roots in Finite Fields, Algebraic independence in positive characteristic: A $p$-adic calculus, Explicit computation of isomorphisms between finite fields, Fast construction of irreducible polynomials over finite fields, Indiscreet logarithms in finite fields of small characteristic, Computation of a 30750-bit binary field discrete logarithm, Subquadratic-time algorithms for normal bases, Permutation group approach to association schemes, Trading GRH for algebra: Algorithms for factoring polynomials and related structures, Construction of minimal non-abelian left group codes
