Finding Isomorphisms Between Finite Fields
From MaRDI portal
Recommendations
Cited in
(53)- Permutation group approach to association schemes
- Univariate polynomial factorization over finite fields
- Arithmetic of finite fields
- Computational problems in the theory of finite fields
- On finding primitive roots in finite fields
- \#P-completeness of counting roots of a sparse polynomial
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- Fast computation of isomorphisms between finite fields using elliptic curves
- Indiscreet logarithms in finite fields of small characteristic
- The BC-system and L-functions
- Subquadratic-time algorithms for normal bases
- Classification of finite fields with applications
- Construction of minimal non-abelian left group codes
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Isometric embeddings of finite fields
- Constructing normal bases in finite fields
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Using partial smoothness of p-1 for factoring polynomials modulo p
- scientific article; zbMATH DE number 4152523 (Why is no real title available?)
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- Finite fields.
- On extended fundamental classes over a finite field
- Searching for Primitive Roots in Finite Fields
- Algorithms in Algebraic Number Theory
- scientific article; zbMATH DE number 67087 (Why is no real title available?)
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Some results on uniform arithmetic circuit complexity
- A fast algorithm to compute irreducible and primitive polynomials in finite fields
- Generators and irreducible polynomials over finite fields
- On the discrete logarithm problem in finite fields of fixed characteristic
- Computing isomorphisms and embeddings of finite fields
- On the effective computation of isomorphisms between and GF
- The module isomorphism problem reconsidered.
- Constructing nonresidues in finite fields and the extended Riemann hypothesis
- Computation of a 30750-bit binary field discrete logarithm
- Homomorphic encryption and some black box attacks
- Algebraic independence in positive characteristic: a p-adic calculus
- scientific article; zbMATH DE number 3331606 (Why is no real title available?)
- Computing isomorphisms and embeddings of finite fields
- Fast construction of irreducible polynomials over finite fields
- Factoring polynomials over special finite fields
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Specific irreducible polynomials with linearly independent roots over finite fields
- Determining unit groups and \(\mathrm{K_1}\) of finite rings
- A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
- A note on a standard model for Galois rings
- Explicit computation of isomorphisms between finite fields
- Enumerating hyperelliptic curves over finite fields in quasilinear time
- Isomorphisms of algebraic number fields
- Pseudo-deterministic construction of irreducible polynomials over finite fields
- Key attack on the ACDGV matrix encryption scheme
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
This page was built for publication: Finding Isomorphisms Between Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491686)
