Algebra Universal en Ciencias de La Computacion

Álgebra universal para Ciencia de la Computación
José Antonio Rodrı́guez Melquiades
July 1, 2018
José Antonio Rodrı́guez Melquiades Álgebra universal para Ciencia de la Computación July 1, 2018 1 / 30
Contents: Symmetric and asymmetric ciphers
1 Algebra
2 Models algebraic
Operations n-arias
Semigroups
Monoid
3 Algebraic structures
Groups
4 Exercises
5 References bibliographic
What is algebra ?
The algebra is part of the mathematics which study the structures, relations
and quantity.
What is algebra ?
and quantity.
Classification:
What is algebra ?
and quantity.
Classification:
I Algebra elemental: For school.
What is algebra ?
and quantity.
Classification:
I Algebra abstract: For university.
What is algebra ?
and quantity.
Classification:
I Algebra abstract: For university.
In the context of algebra a system consisting of a set and one or more n-ary
operations on the set is called an algebraic system. Singh (2005)
Let X be a finite and nonempty set then algebraic system is denoted by
(X , , ~, . . .), where , ~, . . . are the operations on X . Singh (2005)
Since, the operations over the set represent a structure between the elements;
therefore an algebraic system is also known as algebraic structure. Singh
(2005)
(2005)
Examples (of algebraic systems)
(2005)

I Groups, rings, fields, vector spaces, etc.
(2005)

Our study restrict of algebraic systems to those operations that are only
unary or binary in nature.
(2005)

Our study restrict of algebraic systems to those operations that are only
unary or binary in nature.
I (N, +); (N, +, ∗)
1 Algebra
2 Models algebraic
Operations n-arias
Semigroups
Monoid
Groups
4 Exercises
Models algebraic
For study the Algebraic Structures is necessary build a model.
Models algebraic
The models algebraic are:
Models algebraic

I Operations n-arias,
Models algebraic

I Semigroups
Models algebraic

I Semigroups
I Monoids.
Operations n-arias
a) Monadic operation:
Let S 6= φ be set. The operation monadic (unaria) ∗ on S, is a mapping
∗:S →S
a 7→ ∗(a) = c
b) Binary operation:
Let S 6= φ be set. A binary operation ∗ on a set S is a mapping from S × S to S
(Menezes et al., 1996)
∗:S ×S →S
(a, b) 7→ ∗(a, b) = c
Example:
+:N×N →N
(6, 9) 7→ +(6, 9) = 15
Properties:
∗:S ×S →S
(a, b) 7→ ∗(a, b) = c
Example:
+:N×N →N
(6, 9) 7→ +(6, 9) = 15
Properties:
Associative: a ∗ (b ∗ c) = (a ∗ b) ∗ c, ∀a, b, c ∈ S.
∗:S ×S →S
(a, b) 7→ ∗(a, b) = c
Example:
+:N×N →N
(6, 9) 7→ +(6, 9) = 15
Properties:
Identity element: ∃ e ∈ S such that e ∗ a = a ∗ e = a, ∀a ∈ S.
∗:S ×S →S
(a, b) 7→ ∗(a, b) = c
Example:
+:N×N →N
(6, 9) 7→ +(6, 9) = 15
Properties:
Inverse element: ∀a ∈ S, ∃a0 ∈ S such that a0 ∗ a = a ∗ a0 = e.
∗:S ×S →S
(a, b) 7→ ∗(a, b) = c
Example:
+:N×N →N
(6, 9) 7→ +(6, 9) = 15
Properties:
Inverse element: ∀a ∈ S, ∃a0 ∈ S such that a0 ∗ a = a ∗ a0 = e.
Commutative: a ∗ b = b ∗ a, ∀a, b ∈ S.
c) n-aria operations:
The n-aria operations ∗ on S is a following mapping :
∗ : S × S × ... × S → S
(a, b, ...) 7→ ∗(a, b, ...) = c
Note:
From of n-arias operations is possible establish the structure algebraic.
(S, (∗1 , ∗2 , ..., ∗n )),
Semigroups
The semigroups (S, ∗), are the set S 6= φ and a binary operation associative ∗ on
the set S.
Examples:
Semigroups
the set S.
Examples:
I The set natural numbers include 0 : (N, +), (N, ×).
Semigroups
the set S.
Examples:
I The set integer numbers : (Z, +), (Z, ×).
Semigroups
the set S.
Examples:
I The set rational numbers : (Q, +), (Q, ×).
Semigroups
the set S.
Examples:
I The set real numbers : (R, +), (R, ×).
Semigroups
the set S.
Examples:
I The set real numbers : (R, +), (R, ×).
I The set complex numbers : (C, +), (C, ×).
Example:
Let X = {p, q, r } and binary operation ⊗ defines in the operation table
shown then algebraic system (X , ⊗) is a semi group because ⊗ are closed
and associative .
⊗ p q r
p p p p
q q q q
r r r r
Monoid
The monoid (S, ∗) consists of the set S 6= φ and the binary operation associative
∗ on the set S, such that S have identity.
Examples:
The set natural numbers include 0 : (N, +), (N, ×).
Monoid
Examples:
The set integer numbers : (Z, +), (Z, ×).
Monoid
Examples:
The set rational numbers : (Q, +), (Q, ×).
Monoid
Examples:
The set real numbers : (R, +), (R, ×).
Monoid
Examples:
The set real numbers : (R, +), (R, ×).
The set complex numbers : (C, +), (C, ×).
Example:
Let X = {0, 1, 2, 3, 4} and binary operation ⊕ defines in the operation table
shown where a ⊕ b = a + b, if a + b ≤ 3, otherwise a + b − 4. (X , ⊕) is a
monoid because ⊕ are closed, associative and have identity (0).
⊕ 0 1 2 3
0 0 1 2 3
1 1 2 3 0
2 2 3 0 1
3 3 0 1 2
1 Algebra
2 Models algebraic
Operations n-arias
Semigroups
Monoid
Groups
4 Exercises
Algebraic structures
An algebraic structure is a mathematical object (algebraic system) formed by a set

and also of internal composition laws defined for such set.
The structures of interest in cryptography are:
Groups;

Groups;
Rings;

Groups;
Rings;
Field.
Groups
Definition(Group):
Let G be set. An group (G , ∗), where ∗ is binary operation satisfying the following
three axioms: Menezes et al. (1996)
Associative: ∀a, b, c ∈ G , a ∗ (b ∗ c) = (a ∗ b) ∗ c.
Observation:
Groups
Definition(Group):
Identity: ∀a ∈ G , ∃e ∈ G , such that e ∗ a = a ∗ e = a.
Observation:
Groups
Definition(Group):
Inverse: ∀a ∈ G , ∃a−1 ∈ G , such that a−1 ∗ a = a ∗ a−1 = e.
Observation:
Groups
Definition(Group):
Observation:
If a ∗ b = b ∗ a, ∀a, b ∈ G , G is called group abelian o commutative.
Groups
Definition(Group):
Observation:
If in the group the binary operation is addition or multiplication, the groups

are called additive group and multiplicative group.
Groups
Definition(Group):
Observation:
If in the group the binary operation is addition or multiplication, the groups

are called additive group and multiplicative group.
If |G | is finite, (G , ∗) is finite.
Examples:
Examples:
I The sets (Z, +), (Q, +), (R, +) y (C, +), are groups with identity the number
0, and inverse additive −a.
Examples:
I The sets (R − {0}, ×), (Q − {0}, ×) y (C − {0}, ×) are groups, where

identity is 1 and inverse 1a , a 6= 0.
Examples:

The set real numbers R+ with the multiplication operation, R+ , × , is group,

I
where the identity is 1 and the inverse 1a , a 6= 0.
Examples:


I
I For every positive integer n, the set of n-bit strings under the ”exclusive OR”
operation forms an abelian group, where the ”all zero” bit string is the
identity, and every bit string is its own inverse.
Examples:


I
I For every positive integer n, the set of n-bit strings under the ”exclusive OR”
operation forms an abelian group, where the ”all zero” bit string is the
identity, and every bit string is its own inverse.
I The set of all finite bit strings under concatenation does not form an abelian
group. Although concatenation is associative and the empty string acts as an
identity element, inverses do not exist (except for the empty string), nor is
concatenation commutative
Definition(Direct product):
Let (G1 , ∗1 ) and (G2 , ∗2 ) be two groups, the direct product of two groups are:
G1 ⊗ G2 = {(a1 ,a2 ) / a1 ∈ G1 and a2 ∈ G2 },
where ∗ defined (a1 , a2 )*(b1 , b2 ) = (a1 ∗1 b1 , a2 ∗2 b2 ).
Note:
G1 ⊗ G2 = {(a1 ,a2 ) / a1 ∈ G1 and a2 ∈ G2 },
Note:
The direct sum can be extended to n groups:
G1 ⊕ G2 . . . ⊕ Gn
G1 ⊗ G2 = {(a1 ,a2 ) / a1 ∈ G1 and a2 ∈ G2 },
Note:
The direct sum can be extended to n groups:
G1 ⊕ G2 . . . ⊕ Gn
The direct product can be extended to n groups:

G1 ⊗ G2 . . . ⊗ Gn
Example:
Let (Z2 = {0, 1}, +1 ) and (Z3 = {0, 1, 2}, +2 ) be the groups. The direct product:
Z2 ⊗ Z3 = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}
where (a1 , a2 ) + (b1 , b2 ) = (a1 +1 b1 , a2 +2 b2 )
(1, 1) + (1, 1) = (1 +1 1, 1 +2 1) = (0, 2)
Example:
Z2 ⊗ Z3 = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}
where (a1 , a2 ) + (b1 , b2 ) = (a1 +1 b1 , a2 +2 b2 )
(1, 1) + (1, 1) = (1 +1 1, 1 +2 1) = (0, 2)
(0, 1) + (1, 2) = (0 +1 1, 1 +2 2) = (1, 0)
Example:
Z2 ⊗ Z3 = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}
where (a1 , a2 ) + (b1 , b2 ) = (a1 +1 b1 , a2 +2 b2 )
(1, 1) + (1, 1) = (1 +1 1, 1 +2 1) = (0, 2)
(0, 1) + (1, 2) = (0 +1 1, 1 +2 2) = (1, 0)
(1, 0) + (1, 2) = (1 +1 1, 0 +2 2) = (0, 2)
Example:
Z2 ⊗ Z3 = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}
where (a1 , a2 ) + (b1 , b2 ) = (a1 +1 b1 , a2 +2 b2 )
(1, 1) + (1, 1) = (1 +1 1, 1 +2 1) = (0, 2)
(0, 1) + (1, 2) = (0 +1 1, 1 +2 2) = (1, 0)
(1, 0) + (1, 2) = (1 +1 1, 0 +2 2) = (0, 2)
(1, 1) + (1, 2) = (1 +1 1, 1 +2 2) = (0, 0)
Results:
All group have one identity element.
Results:
In each group each element has an inverse.
Results:
Cancellation laws
Results:
Cancellation laws
I If ab = ac ⇒ b = c.
Results:
Cancellation laws
I If ba = ca ⇒ b = c.
Results:
Cancellation laws
(a−1 )−1 = a.
Results:
Cancellation laws
(a−1 )−1 = a.
(a1 a2 . . . ak )−1 = ak−1 . . . a2−1 a1−1 .
Results:
Cancellation laws
(a−1 )−1 = a.
(a1 a2 . . . ak )−1 = ak−1 . . . a2−1 a1−1 .

If a, b ∈ G , then the equations ax = b and xa = b have solutions unique in
the group G , ie, x = a−1 b and x = ba−1 .
If each group Gi is abelian, then the direct product G1 ⊗ G2 . . . ⊗ Gn is
abelian.
abelian.
Let Gi be, for i = 1, . . . n groups. Then
|G1 ⊗ G2 . . . ⊗ Gn | = |G1 ||G2 | . . . |Gn |.
abelian.
Let Gi be, for i = 1, . . . n groups. Then
|G1 ⊗ G2 . . . ⊗ Gn | = |G1 ||G2 | . . . |Gn |.
The identity for G1 ⊗ G2 . . . ⊗ Gn is (e1 , e2 , . . . , en ), where ei is the identity of

group Gi .
Definition(Class of equivalence):
[a] = {b ∈ Z/b mod n = a mod n}.
To find the inverse a−1 of a ∈ Z∗n , use the Extended Euclidean algorithm such that
d = gcd(a, n) = aa−1 + kn = 1.
In the following tables we can see the elements of Z2 y Z3 :

+ 0 1
0 0 1
1 1 0
+ 0 1 2
0 0 1 2
1 1 2 0
2 2 0 1
In the following examples, the elements of these groups are seen as equivalence
classes.
Example
The set of integers modulo n, denoted by Zn , with the operation

(a + b)mod n is group, where the identity is 0.
(Zn , (a + b)mod n)
In the following examples, the elements of these groups are seen as equivalence
classes.
Example
The set of integers modulo n, denoted by Zn , with the operation

(a + b)mod n is group, where the identity is 0.
(Zn , (a + b)mod n)
I (Z9 , (a + b)mod 9), where Z9 = {0, 1, 2, 3, 4, . . . , 8}
Example
Example
I The multiplicative group Z∗n with the operation a × b (mod n) is group, where
the identity is 1.
(Z∗n , a × b mod n)
Example
the identity is 1.
Example
the identity is 1.
Z∗9 , a × b mod 9 , where Z∗9 = {1, 2, 4, 5, 7, 8}

F
×mod 9 1 2 4 5 7 8
1 1 2 4 5 7 8
2 2 4 8 1 5 7
4 4 8 7 2 1 5
5 5 1 2 7 8 4
7 7 5 1 8 4 2
8 8 7 5 4 2 1
Example
the identity is 1.
Z∗9 , a × b mod 9 , where Z∗9 = {1, 2, 4, 5, 7, 8}

F
×mod 9 1 2 4 5 7 8
1 1 2 4 5 7 8
2 2 4 8 1 5 7
4 4 8 7 2 1 5
5 5 1 2 7 8 4
7 7 5 1 8 4 2
8 8 7 5 4 2 1
I Theorem: The set Z∗n which consists of all integers i = 0, 1, . . . , n − 1 for

which gcd(i, n) = 1 forms an abelian group under multiplication modulo n.
The identity element is e = 1. Paar and Pelzl (2010)
Homomorphism of groups
0
Let (G, ∗) and (H, ∗ ) be two groups. The function
0 0
ϕ : (G , ∗) → (H, ∗ ), defined by ϕ(a ∗ b) = ϕ(a) ∗ ϕ(b), ∀a, b ∈ G ,
is homomorphism of groups.
Example:
Let (R2×2 , +) and (R, +) be two groups, then f : (R2×2 , +) → (R, +) defined by

a b
f =b+c
c d
is homomorphism.
Example:
Let (Z, +) and (Zn , +) be groups, then f : Z → Zn defined by
f (x) = x mod n = [x]n is homomorphism, since
f (x + y ) = [x + y ]n = [x]n + [y ]n = f (x) + f (b)
Example:
Let (R, +) and (R+ , ×) be groups, then f : (R, +) → (R+ , ×) defined by
f (x) = e x is homomorphism, since
f (x + y ) = e x+y = e x e y = f (x) × f (y )
1 Algebra
2 Models algebraic
Operations n-arias
Semigroups
Monoid
Groups
4 Exercises
Exercises
1. Let G = {x ∈ R : x > 1}, and define a ∗ b = ab − a − b + 2 for all a, b ∈ R.

Show that:
(a) G is close under ∗.
(b) The set G under the operation ∗ forms an abelian group.
2. Let G be an abelian group, and let g be an arbitrary, fixed element of G .

Assume that the group operation of G is written additively. We define a new
binary operation on G , as follows: For a, b ∈ G , let a b = a + b + g .
Show that the set G under forms an abelian group.
3. Let ∗ be a binary operation on a non-empty, finite set G . Assume that ∗ is

associative, commutative, and satisfies the cancellation law: a ∗ b = a ∗ c
implies b = c. Show that G under ∗ forms an abelian group.
1 Algebra
2 Models algebraic
Operations n-arias
Semigroups
Monoid
Groups
4 Exercises
References bibliographic
Menezes, A., Van Orschot, P., and Vanstone, S. (1996). Handbook of applied
cryptography. CRC Press, USA.
Paar, C. and Pelzl, J. (2010). Understanding cryptography. Springer-Verlag,
Berlin Heidelberg.
Singh, Y. (2005). Mathematical foundation of computer science. New age
international limited publishers., Publishing for one world.

Algebra Universal en Ciencias de La Computacion

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Algebra Universal en Ciencias de La Computacion

Încărcat de

Drepturi de autor:

Formate disponibile

Álgebra universal para Ciencia de la Computación

José Antonio Rodrı́guez Melquiades

I Algebra abstract: For university.

I Algebra abstract: For university.

Examples (of algebraic systems)

Examples (of algebraic systems)

Examples (of algebraic systems)

Examples (of algebraic systems)

For study the Algebraic Structures is necessary build a model.

For study the Algebraic Structures is necessary build a model.

The models algebraic are:

For study the Algebraic Structures is necessary build a model.

The models algebraic are:

For study the Algebraic Structures is necessary build a model.

The models algebraic are:

For study the Algebraic Structures is necessary build a model.

The models algebraic are:

Identity element: ∃ e ∈ S such that e ∗ a = a ∗ e = a, ∀a ∈ S.

Identity element: ∃ e ∈ S such that e ∗ a = a ∗ e = a, ∀a ∈ S.

Inverse element: ∀a ∈ S, ∃a0 ∈ S such that a0 ∗ a = a ∗ a0 = e.

Identity element: ∃ e ∈ S such that e ∗ a = a ∗ e = a, ∀a ∈ S.

Inverse element: ∀a ∈ S, ∃a0 ∈ S such that a0 ∗ a = a ∗ a0 = e.

(S, (∗1 , ∗2 , ..., ∗n )),

I The set integer numbers : (Z, +), (Z, ×).

I The set integer numbers : (Z, +), (Z, ×).

I The set rational numbers : (Q, +), (Q, ×).

I The set integer numbers : (Z, +), (Z, ×).

I The set rational numbers : (Q, +), (Q, ×).

I The set real numbers : (R, +), (R, ×).

I The set integer numbers : (Z, +), (Z, ×).

I The set rational numbers : (Q, +), (Q, ×).

I The set real numbers : (R, +), (R, ×).

I The set complex numbers : (C, +), (C, ×).

The set integer numbers : (Z, +), (Z, ×).

The set integer numbers : (Z, +), (Z, ×).

The set rational numbers : (Q, +), (Q, ×).

The set integer numbers : (Z, +), (Z, ×).

The set rational numbers : (Q, +), (Q, ×).

The set real numbers : (R, +), (R, ×).

The set integer numbers : (Z, +), (Z, ×).

The set rational numbers : (Q, +), (Q, ×).

The set real numbers : (R, +), (R, ×).

The set complex numbers : (C, +), (C, ×).

An algebraic structure is a mathematical object (algebraic system) formed by a set

The structures of interest in cryptography are:

An algebraic structure is a mathematical object (algebraic system) formed by a set

The structures of interest in cryptography are:

An algebraic structure is a mathematical object (algebraic system) formed by a set

The structures of interest in cryptography are:

If in the group the binary operation is addition or multiplication, the groups

If in the group the binary operation is addition or multiplication, the groups

I The sets (R − {0}, ×), (Q − {0}, ×) y (C − {0}, ×) are groups, where

I The sets (R − {0}, ×), (Q − {0}, ×) y (C − {0}, ×) are groups, where

The set real numbers R+ with the multiplication operation, R+ , × , is group,

where the identity is 1 and the inverse 1a , a 6= 0.

I The sets (R − {0}, ×), (Q − {0}, ×) y (C − {0}, ×) are groups, where

The set real numbers R+ with the multiplication operation, R+ , × , is group,

where the identity is 1 and the inverse 1a , a 6= 0.

I The sets (R − {0}, ×), (Q − {0}, ×) y (C − {0}, ×) are groups, where

The set real numbers R+ with the multiplication operation, R+ , × , is group,

where the identity is 1 and the inverse 1a , a 6= 0.

The direct product can be extended to n groups:

(1, 1) + (1, 1) = (1 +1 1, 1 +2 1) = (0, 2)