Concept

Finite field

In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod p when p is a prime number. The order of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number p and every positive integer k there are fields of order all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) are defined and satisfy the rules of arithmetic known as the field axioms. The number of elements of a finite field is called its order or, sometimes, its size. A finite field of order q exists if and only if q is a prime power pk (where p is a prime number and k is a positive integer). In a field of order pk, adding p copies of any element always results in zero; that is, the characteristic of the field is p. If q = pk, all fields of order q are isomorphic (see below). Moreover, a field cannot contain two different finite subfields with the same order. One may therefore identify all finite fields with the same order, and they are unambiguously denoted , Fq or GF(q), where the letters GF stand for "Galois field". In a finite field of order q, the polynomial Xq − X has all q elements of the finite field as roots. The non-zero elements of a finite field form a multiplicative group. This group is cyclic, so all non-zero elements can be expressed as powers of a single element called a primitive element of the field. (In general there will be several primitive elements for a given field.

Official source

https://en.wikipedia.org/wiki/Finite_field

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

MATH-351: Advanced numerical analysis II

The student will learn state-of-the-art algorithms for solving differential equations. The analysis and implementation of these algorithms will be discussed in some detail. ...

MSE-304: Surfaces and interfaces

This lecture introduces the fundamental concepts for describing, characterizing, and engineering surfaces and interfaces. Students will develop both theoretical and practical understanding of how interfacial phenomena influence surface properties and techn ...

Related lectures (32)

Norm Extension in Finite Fields

Covers the uniqueness of norm extension in finite fields and the construction of norms on finite extensions of Qp.

Introduction to Finite Fields

Covers the basics of finite fields, including arithmetic operations and properties.

Finite Fields: Properties and Applications

Explores the properties and applications of finite fields, including isomorphism and cyclic properties.

Related publications (32)

TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes

A polynomial commitment scheme (PCS) enables a prover to succinctly commit to a large polynomial and later generate evaluation proofs that can be efficiently verified. In recent years, PCSs have emerged as a central focus of succinct non-interactive argument (SNARG) design. We present TensorSwitch, a hash-based PCS for multilinear polynomials that improves the state-of-the-art in two fundamental bottlenecks: prover time and proof size. We frame our results as an interactive oracle PCS, which can be compiled

Springer Science and Business Media Deutschland GmbH2026

Interactive Proofs for Batch Polynomial Evaluation

Polynomials are a fundamental mathematical object underlying virtually all of theoretical computer science. In proof systems, a common task for the verifier is to evaluate a polynomial of degree d at m distinct points. The best known algorithm for this problem performs O((m + d) · log2(m + d)) field operations. We present a concretely efficient MA protocol for this problem in which the verifier runs in linear time: the prover sends a single message consisting of d − 1 field elements, and the verifier perfor

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

On the Power and Limitations of Branch and Cut

The Stabbing Planes proof system was introduced by Beame et al. (ITCS’18) to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formulas — certain unsatisfiable systems of linear equations mod2—whicharecanonical hard examples for many algebraic proof systems. In a recent (and surprising) result, Dadush and Tiwari (CCC’20) showed that these short refutations of the Tseitin formulas could

2026

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Finite_field

About this result

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra

Related courses (32)

MATH-410: Riemann surfaces

MATH-351: Advanced numerical analysis II

The student will learn state-of-the-art algorithms for solving differential equations. The analysis and implementation of these algorithms will be discussed in some detail. ...

MSE-304: Surfaces and interfaces

Related lectures (32)

Norm Extension in Finite Fields

Covers the uniqueness of norm extension in finite fields and the construction of norms on finite extensions of Qp.

Introduction to Finite Fields

Covers the basics of finite fields, including arithmetic operations and properties.

Finite Fields: Properties and Applications

Explores the properties and applications of finite fields, including isomorphism and cyclic properties.

Related publications (32)

TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes

Springer Science and Business Media Deutschland GmbH2026

Interactive Proofs for Batch Polynomial Evaluation

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

On the Power and Limitations of Branch and Cut

2026

Related people (32)

Martin Vetterli

Martin Vetterli was appointed president of EPFL by the Federal Council following a selection process conducted by the ETH Board, which unanimously nominated him. Professor Vetterli was born on 4 October 1957 in Solothurn and received his elementary and secondary education in Neuchâtel Canton. He earned a Bachelor’s degree in electrical engineering from ETH Zurich (ETHZ) in 1981, a Master’s of Science degree from Stanford University in 1982, and a PhD from EPFL in 1986. Professor Vetterli taught at Columbia University as an assistant and then associate professor. He was subsequently named full professor in the Department of Electrical Engineering and Computer Sciences at the University of California at Berkeley before returning to EPFL as a full professor at the age of 38. He has also taught at ETHZ and Stanford University. Professor Vetterli has earned numerous national and international awards for his research in electrical engineering, computer science and applied mathematics, including the National Latsis Prize in 1996. He is a fellow of both the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers and a member the US National Academy of Engineering. He has published over 170 articles and three reference works. Professor Vetterli’s work on the theory of wavelets, which are used in signal processing, is considered to be of major importance by his peers, and his areas of expertise, including image and video compression and self-organized communication systems, are central to the development of new information technologies. As the founding director of the National Centre of Competence in Research on Mobile Information and Communication Systems, Professor Vetterli is a staunch advocate of transdisciplinary research. Professor Vetterli knows EPFL inside and out. An EPFL graduate himself, he began been teaching at the school in 1995, was vice president for International Affairs and then Institutional Affairs from 2004 to 2011, and served as dean of the School of Computer and Communication Sciences in 2011 and 2012. In addition to his role as president of the National Research Council of the Swiss National Science Foundation, a position he held from 2013 to 2016, he heads the EPFL’s Audiovisual Communications Laboratory (LCAV) since 1995. Professor Vetterli has supported more than 60 students in Switzerland and the United States in their doctoral work and makes a point of following their highly successful careers, whether it is in the academic or business world. He is the author of some 50 patents, some of which were the basis for start-ups coming out of his lab, such as Dartfish and Illusonic, while others were sold (e.g. Qualcomm) as successful examples of technology transfer. He actively encourages young researchers to market the results of their work.

Aline Zanardini

Teaching & PhD Courses Advanced linear algebra I MATH-110(b) The purpose of this course is to introduce the basic notions of linear algebra and to prove the main results of the subject. Algebra V - Galois theory MATH-317 Galois theory lies at the interface of Field Theory and Group Theory. It aims to describe the algebraic symmetries of fields. We will focus on Galois theory for finite field extensions and some applications. Algebraic geometry I - Curves MATH-328

Marco Picasso

Expertise Computational Science and Engineering Mission I am teaching analysis and numerical analysis for engineers and mathematicians at bachelor and master levels.My research pertains to the numerical simulation of complex physical systems with partial differential equations.Here is some bibliometry: Google Scholar, Research Gate, Orcid, here is my most recent CV. Ongoing research projects: - Numerical simulation of aluminium electrolysis, collaboration with RioTinto LRF lab, Ycoorsystems SA and Jacques

Simone Deparis

Expertise Simone Deparis is a professor at EPFL specializing in applied mathematics, numerical analysis, and the didactics of university-level mathematics. His research spans computational modeling for biomedical applications and innovations in mathematics education, with a focus on equity, self-efficacy, and assessment reform in large STEM cohorts. Mission Our group conducts research at the intersection of applied mathematics and learning sciences. In applied mathematics, we focus on modeling and simulatio

Serge Vaudenay

Serge Vaudenay entered at the Ecole Normale Supérieure in 1989 with a major in mathematics. He earned his agrégation (secondary teaching degree) in mathematics in 1992, then a PhD in Computer Science at the University of Paris 7 - Denis Diderot in 1995. He subsequently became a senior research fellow at the CNRS, prior to being granted his habilitation à diriger des recherches (a postdoctoral degree authorizing the recipient to supervise doctoral students). In 1999, he was appointed as a Professor at the EPFL, where he created the Security and Cryptography Laboratory.

Michaël Unser

Expertise Image Processing, Medical Imaging, Biological Imaging, Wavelets, Splines, Multiresolution Michael Unser is Full Professor with EPFL’s school of Engineering and the academic director of EPFL's Center for Imaging, Lausanne, Switzerland. His primary areas of investigation are signal processing, biomedical imaging and applied functional analysis. He is internationally recognized for his research contributions to sampling theory, wavelets, the use of splines for image processing, stochastic processes,

Anna Lachowska

Teaching & PhD Courses Algebra MATH-310 This is an introduction to modern algebra: groups, rings and fields. Analysis I MATH-101(e) We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable. Analysis II MATH-106(e) The course studies fundamental concepts of analysis and the calculus of functions of several variables. Representation theory I - finite groups MATH-314 This is a standard c

Jacques Rappaz

Originaire de Neyruz-sur-Moudon (VD), Jacques Rappaz est né le 22 mars 1947. Après ses études primaires et secondaires à Lausanne, il étudie la physique, de 1964 à 1970, à l'Ecole Polytechnique de l'Université de Lausanne (EPUL et EPFL dès 1969) où il obtient son diplôme en janvier 1971. Il entreprend ensuite un travail de recherche en analyse numérique à l'EPFL. En avril 1976, il soutient une thèse consacrée à l'approximation spectrale d'opérateurs provenant de la physique des plasmas.De 1977 à 1980, il es

Yves Perriard

Yves Perriard was born in Lausanne in 1965. He received the M. Sc. in Microengineering from the Swiss Federal Institute of Technology - Lausanne (EPFL) in 1989 and the Ph D. degree in 1992. Co-founder of Micro-Beam SA, he was CEO of this company involved in high precision electric drive. Senior lecturer from 1998 and professor since 2003, he is currently director of Laboratory of Integrated Actuators. His research interests are in the field of new actuator design and associated electronic devices. In 2009, he is appointed Vice-Director of the Microengineering Institute in Neuchâtel until 2011. In 2013 the Federal Council has named him the the CTI commission in Bern. In 2014 he is appointed guest professor at Zhejiang University in China. In 2017, the lab is granted by the Werner Siemens Foundation of an amount of 12 millions CHF in order to set up a new Center for Artificial Muscules. Since 2018, he is Expert with Innosuisse, the new Swiss Innovation Agency. http://scholar.google.com/citations?hl=fr&user=V2onuO8AAAAJ https://actu.epfl.ch/news/a-12-million-franc-donation-to-create-a-center-for/

Leonid Monin

Teaching & PhD Courses Algebra III - rings and fields MATH-215 This is an introductory course in ring and field theory. Analysis I (English) MATH-101(en) We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable. Topology III - Homology MATH-323 Homology is one of the most important tools to study topological spaces and it plays an important role in many fields of mathematics. The aim of this course is

Related units (14)

Audiovisual Communications Laboratory

Computational Solid Mechanics Laboratory

Scientific Computing and Uncertainty Quantification - CADMOS Chair

Related concepts (30)

Ring (mathematics)

In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ring is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series.

Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

Number theory

Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers).

Related MOOCs (1)

Optimization: principles and algorithms - Unconstrained nonlinear optimization

What you'll learn Formulation: you will learn from simple examples how to formulate, transform and characterize an optimization problem. Objective function: you will review the mathematical properties of the objective function that are important in optimization. Optimality conditions: you will learn sufficient and necessary conditions for an optimal solution. Solving equations, Newton: this is a reminder about Newton's method to solve nonlinear equations. Newton's local method: you will see how to interpret

Related exercises (4)

Cavity in charged sphere

Consider a sphere of radius R₁ uniformly charged, of charge density ρ, having a spherical cavity of radius R₂. The center of the cavity is displaced with respect to the center of the sphere of a vector

\bf{r_0}

(see figure). Calculate the electric field in a given point inside the cavity. Suggestion: Express the field as function of the charge density ρ. In order to calculate the field inside the cavity, we use the principle of superposition. We can imagine the sphere with cavity as the superposition of

Dielectric cylindrical shell

A neutral dielectric in the shape of a cylindrical shell, of internal radius a, external b, and of infinite length, carries a polarisation

{\bf P}({\bf r})=kr\,{\hat{\bf r}}

, where k is a constant. Determine: i) the linked charges per unit of length Q_(a) and Q_(b) on the internal and external surfaces, and volume Q_(v), as well as the total charge; ii) the fields

{\bf E}

and

{\bf D}

created by this polarisation in the whole space. ( We do not ask ourselves what is the origin of this polarisation). We

Study of density function

Consider the volume density of charge ρ(x,y,z)u2004=u2004ρ(x) of the figure on the left, infinite in the directions y and z, where: aρ₀₊u2004=u2004Au2006[Cu2006m⁻²]. a) Determine and graphically represent the electric field associated for all of the values of x. Determine and graphically represent the potential V(x), with the condition V(−a/2)u2004=u20040. b) Now consider the charge density ρ(x,y,z)u2004=u2004ρ(x) of the figure on the right side, where bρ⁰⁻u2004=u2004aρ₀₊u2004=u2004A. Determine and graphi