Prime Numbers and RSA Encryption: A Possible Attack on your Security

Abstract

The objective of this work was the study of RSA Encryption in which an algorithm was developed to analyze a possible security attack through the Euler function to try to find the prime factors of a compound number with fewer iterations than the Fermat algorithm. The importance of this factorization is present in the encoding and decoding of messages in the RSA Encryption method. For the understanding of the RSA method, the mathematical description, coding and decoding processes were performed, a particular case for the method and an analysis of why the method is still safe. The search for factorization by the Euler function was four times faster in relation to factorization by the Fermat method, but some studies are needed to try to delimit the search interval in the proposed function better.