✦ LIBER ✦

Explicit Computation of Isomorphisms between Finite Fields

✍ Scribed by Bill Allombert

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 132 KB
Volume: 8
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.2001.0344

No coin nor oath required. For personal study only.

✦ Synopsis

Although it is easy to prove that two finite fields having the same cardinality are isomorphic, the proof uses embeddings into an algebraic closure (or at least into a common overfield), hence is not constructive, and so does not provide explicit isomorphisms. We give algorithms to solve this problem efficiently in practice, and as an application, we also give an algorithm for factoring a polynomial P 2 F p ½X over a finite extension of F p . # 2002 Elsevier Science (USA)

📜 SIMILAR VOLUMES

Explicit Constructions of Perfect Hash F

Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields

✍ Huaxiong Wang; Chaoping Xing 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,

Three-step explicit finite element compu

Three-step explicit finite element computation of shallow water flows on a massively parallel computer

✍ Kazuo Kashiyama; Hanae Ito; Marek Behr; Tayfun Tezduyar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 862 KB

Explicit Iterative Constructions of Norm

Explicit Iterative Constructions of Normal Bases and Completely Free Elements in Finite Fields

✍ Dirk Hachenberger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 305 KB

A characterization of normal bases and complete normal bases in GF(q r n ) over GF(q), where q Ͼ 1 is any prime power, r is any prime number different from the characteristic of GF(q), and n Ն 1 is any integer, leads to a general construction scheme of series (v n ) nՆ0 in GF(q r ȍ ) :ϭ ʜ nՆ0 GF(q r

Charge iteration: A procedure for the fi

Charge iteration: A procedure for the finite element computation of unbounded electrical fields

✍ G. Aiello; S. Alfonzetti; S. Coco 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 943 KB

Space-time finite element computation of

Space-time finite element computation of compressible flows between moving components

✍ G. P. Wren; S. E. Ray; S. K. Aliabadi; T. E. Tezduyar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 986 KB

A numerical simulation capability for the injector flow of a regenerative liquid propellant gun (RLPG) is presented. The problem involves fairly complex geometries and two pistons in relative motion; therefore a stabilized space-time finite element formulation developed earlier and capable of handli

3D finite element computation of strain

3D finite element computation of strain energy release rate using different displacement and stress fields

✍ M.M.Abdel Wahab; G. de Roeck 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Ahstract-An efficient technique for calculating the strain energy release rate from a three-dimensional (3D) finite element analysis with square-root stress singularity is presented. The technique is based on the Irwin's crack closure integral method. The variation of the stresses ahead of the crack