Análisis de Algoritmos Matemáticos de Criptografía Pública para mejorar el aprendizaje de la materia de Criptografía en la Carrera de Ingeniería en Sistemas de la ESPOCH

Abstract

Based on the study of mathematical theories and defining the parameters for analysis of public key cryptography algorithms, in addition to implement learning environments to determine the incidence of using mathematical algorithms of public key cryptography in students of Computer Systems Engineering career of Polytechnic School of Chimborazo, it was selected the most appropriate algorithm to improve the learning of the subject of cryptography. It developed test environments about RSA, Diffie-Hellman, Rabin and El Gamal, being RSA the best algorithm for teaching with an effectiveness of 100% on its technical evaluation; while Diffie-Hellman mathematical concepts prove to be the better in students understanding with a 50.40%. It defined that the fundamental mathematical concepts are modular arithmetic, number theory, elliptic curves, algebraic structures (finite groups) and the extended Euclidean algorithm; it is therefore recommended to analyze in depth the curriculum of Computer Systems Engineering School for these concepts to be added to the mathematics courses which will benefit the student to a better understanding of the subject.