SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS
Fuente:
Redalyc
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artículo científico |
| Lingua: | en |
| Pubblicazione: |
Universidad Pedagógica y Tecnológica de Colombia
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1876422811385331712 |
|---|---|
| author | Jhon-Alejandro Melo |
| author_facet | Jhon-Alejandro Melo |
| contents | SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS Jhon-Alejandro Melo Siler Amador-Donado César-Jesús Pardo-Calvache Ingeniería factoring Cryptanalysis parallel processing distributed processing 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. 2024 artículo científico 0121-1129 https://www.redalyc.org/articulo.oa?id=413982387014 https://www.redalyc.org/journal/4139/413982387014/ https://www.redalyc.org/journal/4139/413982387014/html/ https://www.redalyc.org/journal/4139/413982387014/413982387014.epub https://www.redalyc.org/journal/4139/413982387014/movil 10.19053/01211129.v33.n69.2024.17935 en http://www.redalyc.org/revista.oa?id=4139 Facultad de Ingeniería application/pdf Universidad Pedagógica y Tecnológica de Colombia Facultad de Ingeniería (Colombia) Num.69 Vol.33 |
| format | Artículo científico |
| id | redalyc_413982387014 |
| institution | Redalyc |
| language | en |
| publishDate | 2024 |
| publisher | Universidad Pedagógica y Tecnológica de Colombia |
| spellingShingle | SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS Jhon-Alejandro Melo Ingeniería factoring Cryptanalysis parallel processing distributed processing SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS Jhon-Alejandro Melo Siler Amador-Donado César-Jesús Pardo-Calvache Ingeniería factoring Cryptanalysis parallel processing distributed processing 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. 2024 artículo científico 0121-1129 https://www.redalyc.org/articulo.oa?id=413982387014 https://www.redalyc.org/journal/4139/413982387014/ https://www.redalyc.org/journal/4139/413982387014/html/ https://www.redalyc.org/journal/4139/413982387014/413982387014.epub https://www.redalyc.org/journal/4139/413982387014/movil 10.19053/01211129.v33.n69.2024.17935 en http://www.redalyc.org/revista.oa?id=4139 Facultad de Ingeniería application/pdf Universidad Pedagógica y Tecnológica de Colombia Facultad de Ingeniería (Colombia) Num.69 Vol.33 |
| title | SYSTEMATIC MAPPING STUDY ON FAST FACTORIZATION USING PARALLEL OR DISTRIBUTED PROCESSING APPLIED TO CRYPTANALYSIS |
| topic | Ingeniería factoring Cryptanalysis parallel processing distributed processing |
| url | https://www.redalyc.org/articulo.oa?id=413982387014 https://www.redalyc.org/journal/4139/413982387014/ https://www.redalyc.org/journal/4139/413982387014/html/ https://www.redalyc.org/journal/4139/413982387014/413982387014.epub https://www.redalyc.org/journal/4139/413982387014/movil |