NÚMEROS PRIMOS E A CRIPTOGRAFIA RSA

This study presents some of the encryption methods used in antiquity as well as the advance in the way of encrypting. The main objective of this work is the study of RSA Method: its Historical context, the importance of prime numbers, the inefficiency of factorization algorithms, coding, decoding, i...

ver descrição completa

Detalhes bibliográficos
Autor: Molinari, José Robyson Aggio
Formato: tesis de maestría
Estado:Versión publicada
Fecha de publicación:2016
País:Brasil
Recursos:Universidade Estadual de Ponta Grossa (UEPG)
Repositorio:Biblioteca Digital de Teses e Dissertações da UEPG
Idioma:portugués
OAI Identifier:oai:tede2.uepg.br:prefix/1504
Acesso em linha:http://tede2.uepg.br/jspui/handle/prefix/1504
Access Level:acceso abierto
Palavra-chave:Criptografia RSA
Números Primos
Função de Euler
RSA encryption
Prime Numbers
Euler function
CNPQ::CIENCIAS EXATAS E DA TERRA::MATEMATICA
Descrição
Resumo:This study presents some of the encryption methods used in antiquity as well as the advance in the way of encrypting. The main objective of this work is the study of RSA Method: its Historical context, the importance of prime numbers, the inefficiency of factorization algorithms, coding, decoding, its security and a study of the Euler function. Some activities with mathematical content related to encryption have been developed. Thus, it is expected that this research can present an auxiliary methodology for teaching certain math content, linked to the utilization of cryptography.