Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/198362
Title: Sistema de Lorenz i criptosistemes caòtics
Author: Arévalo Soler, Pol
Director/Tutor: Vieiro Yanes, Arturo
Gonchenko, Marina
Keywords: Corbes el·líptiques
Treballs de fi de grau
Varietats abelianes
Funcions zeta
Xifratge (Informàtica)
Elliptic curves
Bachelor's theses
Abelian varieties
Zeta functions
Data encryption (Computer science)
Issue Date: 24-Jan-2023
Abstract: [en] In this work we study the Lorenz system and its application in the field of cryptography. Initially, from a theoretical point of view, we describe the most important properties and basic concepts of the system, in particular, we study the symmetry of the system, the invariance of the $z$ axis, the existence of a global attractor, the stability of the equilibrium points, bifurcations and we present basic notations of chaos theory in order to understand the main features of the behavior of the Lorenz system and its strange attractor. To do this, we use analytical and numerical tools. Later, from a more practical point of view, we present the synchronization of chaos that will allow us to introduce the concept of chaotic cryptography. Finally, we implement algorithms (in C) to encrypt and decrypt signals using the Lorenz system and analyze the dependence that exists between the error committed when recovering the original signal and the same signal.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Arturo Vieiro Yanes i Marina Gonchenko
URI: http://hdl.handle.net/2445/198362
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
tfg_arevalo_soler_pol.pdfMemòria4.77 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons