Pages that link to "Item:Q3491686"

The following pages link to Finding Isomorphisms Between Finite Fields (Q3491686):

Displaying 36 items.

• The module isomorphism problem reconsidered. (Q468724) (← links)
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots (Q596584) (← links)
• Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
• Explicit computation of isomorphisms between finite fields (Q700165) (← links)
• Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) (Q947101) (← links)
• Permutation group approach to association schemes (Q1039422) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Computational problems in the theory of finite fields (Q1180998) (← links)
• On finding primitive roots in finite fields (Q1351512) (← links)
• \#P-completeness of counting roots of a sparse polynomial (Q1628696) (← links)
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) (Q1647353) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• The BC-system and \(L\)-functions (Q1935095) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• Construction of minimal non-abelian left group codes (Q2345915) (← links)
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272) (← links)
• Constructing normal bases in finite fields (Q2639102) (← links)
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
• Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (Q3160743) (← links)
• Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations (Q3498391) (← links)
• Searching for Primitive Roots in Finite Fields (Q3987942) (← links)
• Algorithms in Algebraic Number Theory (Q4005808) (← links)
• Constructing Isogenies between Elliptic Curves Over Finite Fields (Q4267918) (← links)
• Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
• A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377) (← links)
• Generators and irreducible polynomials over finite fields (Q4340866) (← links)
• On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
• Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
• Constructing nonresidues in finite fields and the extended Riemann hypothesis (Q4889937) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• Homomorphic Encryption and Some Black Box Attacks (Q5039562) (← links)
• Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
• Computing isomorphisms and embeddings of finite fields (Q5880524) (← links)
• Fast construction of irreducible polynomials over finite fields (Q5917943) (← links)
• Factoring polynomials over special finite fields (Q5927536) (← links)