Métodos para detecção de números primos e a criptografia RSA

Abstract

The present work addresses methods for detecting prime numbers. The objective of the research is to provide a review of the methods developed over the centuries to study prime numbers and to analyze their application in RSA cryptography. The methodology adopted consists of a systematic literature review. The database used was Google Scholar, with filters to select works published between 2015 and 2023, using the terms "Primality Tests,RSA Cryptography,"and "Lucas Tests."The search returned 28 papers, of which 4 were selected for full reading after analyzing titles and abstracts. The results showed that, although there are efficient methods for verifying the primality of large numbers, the security of RSA depends on the nonexistence of efficient factorization algorithm.