SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS
Jhon-Alejandro Melo, Siler Amador Donado, César Pardo · Dialnet (Universidad de la Rioja) · 2024
Cryptography is one of the branches of research within computer security and cybersecurity, it provides security to the stored information and travels between devices. Cryptanalysis, in turn, studies the weaknesses within cryptography, thus allowing improving constants about cryptographic algorithms. Currently there are several algorithms that allow to keep information secure, one of them is RSA (Rivest, Shamir and Adleman), which is used in digital certificates implemented in some communication protocols. However, there is no algorithm capable of deciphering that type of algorithms yet; therefore, the objective of this study is to support other researchers in the area of cryptanalysis. This rapid factorization study using parallel or distributed processing contains 6 research questions that allow us to deepen the use of this type of processing to speed up the execution times of the algorithms. The results made it possible to show that by using this type of processing, factoring time can be reduced.