(also denoted , Z/2Z or ) is the finite field of two elements (GF is the initialism of Galois field, another name for finite fields). Notations Z_2 and may be encountered although they can be confused with the notation of 2-adic integers.
GF(2) is the field with the smallest possible number of elements, and is unique if the additive identity and the multiplicative identity are denoted respectively 0 and 1, as usual.
The elements of GF(2) may be identified with the two possible values of a bit and to the boolean values true and false. It follows that GF(2) is fundamental and ubiquitous in computer science and its logical foundations.
GF(2) is the unique field with two elements with its additive and multiplicative identities respectively denoted 0 and 1.
Its addition is defined as the usual addition of integers but modulo 2 and corresponds to the table below:
If the elements of GF(2) are seen as boolean values, then the addition is the same as that of the logical XOR operation.
Since each element equals its opposite, subtraction is thus the same operation as addition.
The multiplication of GF(2) is again the usual multiplication modulo 2 (see the table below), and on boolean variables corresponds to the logical AND operation.
GF(2) can be identified with the field of the integers modulo 2, that is, the quotient ring of the ring of integers Z by the ideal 2Z of all even numbers: GF(2) = Z/2Z.
finite field
Because GF(2) is a field, many of the familiar properties of number systems such as the rational numbers and real numbers are retained:
addition has an identity element (0) and an inverse for every element;
multiplication has an identity element (1) and an inverse for every element but 0;
addition and multiplication are commutative and associative;
multiplication is distributive over addition.
Properties that are not familiar from the real numbers include:
every element x of GF(2) satisfies x + x = 0 and therefore −x = x; this means that the characteristic of GF(2) is 2;
every element x of GF(2) satisfies x2 = x (i.
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
Lalgèbre de Boole, ou calcul booléen, est la partie des mathématiques qui s'intéresse à une approche algébrique de la logique, vue en termes de variables, d'opérateurs et de fonctions sur les variables logiques, ce qui permet d'utiliser des techniques algébriques pour traiter les expressions à deux valeurs du calcul des propositions. Elle fut lancée en 1854 par le mathématicien britannique George Boole. L'algèbre de Boole trouve de nombreuses applications en informatique et dans la conception des circuits électroniques.
(also denoted , Z/2Z or ) is the finite field of two elements (GF is the initialism of Galois field, another name for finite fields). Notations Z_2 and may be encountered although they can be confused with the notation of 2-adic integers. GF(2) is the field with the smallest possible number of elements, and is unique if the additive identity and the multiplicative identity are denoted respectively 0 and 1, as usual. The elements of GF(2) may be identified with the two possible values of a bit and to the boolean values true and false.
En logique, une opération bit à bit est un calcul manipulant les données directement au niveau des bits, selon une arithmétique booléenne. Elles sont utiles dès qu'il s'agit de manipuler les données à bas niveau : codages, couches basses du réseau (par exemple TCP/IP), cryptographie, où elles permettent également les opérations sur les corps finis de caractéristique 2. Les opérations bit à bit courantes comprennent des opérations logiques bit par bit et des opérations de décalage des bits, vers la droite ou vers la gauche.
Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
This course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how
Explore le concept de (co)limites dans l'algèbre homotopique, en discutant des relations entre les functeurs, des cas particuliers, et les propriétés universelles des colimites et des limites.
Couvre la théorie des groupes et de l'algèbre homotopique, mettant l'accent sur les transformations naturelles, les identités et l'isomorphisme des catégories.