Finding isomorphisms between finite fields
نویسندگان
چکیده
منابع مشابه
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two degree n extensions of the finite field with q elements, our algorithm takes Õ ( n log q +max l (ll log q + l log q) ) time, where l runs through primes dividing n but not q(q − 1) and nl denotes the highest power of l dividing n. Prior to this work, the b...
متن کاملComputing isomorphisms and embeddings of finite fields
Let Fq be a finite field. Given two irreducible polynomials f, g over Fq, with deg f dividing deg g, the finite field embedding problem asks to compute an explicit description of a field embedding of Fq[X]/f(X) into Fq[Y ]/g(Y ). When deg f = deg g, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algeb...
متن کاملOn Finding Primitive Roots in Finite Fields
We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...
متن کاملFinding roots of polynomials over finite fields
In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose–Chaudhuri–Hocquenghem, Reed–Solomon, and some other error-correcting codes.
متن کاملIsomorphisms of Algebraic Number Fields
Let Q(α) and Q(β) be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q(β) → Q(α). The algorithm is particularly efficient if there is only one isomorphism.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1991
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1991-1052099-2