Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis

Autores:: Melo, Jhon-Alejandro
Amador-Donado, Siler
Pardo-Calvache, César-Jesús

Tipo de recurso:: Article of journal

Fecha de publicación:: 2024

Institución:: Universidad Pedagógica y Tecnológica de Colombia

Repositorio:: RiUPTC: Repositorio Institucional UPTC

Idioma:

id	REPOUPTC2_9567cb37a856138526d2a09502714f99
oai_identifier_str	oai:repositorio.uptc.edu.co:001/21581
network_acronym_str	REPOUPTC2
network_name_str	RiUPTC: Repositorio Institucional UPTC
repository_id_str
dc.title.es-ES.fl_str_mv	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
title	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
spellingShingle	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis Factorización Procesamiento paralelo Criptoanálisis Procesamiento distribuido Cryptanalysis Distributed processing Factoring Parallel processing
title_short	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
title_full	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
title_fullStr	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
title_full_unstemmed	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
title_sort	Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis
dc.creator.fl_str_mv	Melo, Jhon-Alejandro Amador-Donado, Siler Pardo-Calvache, César-Jesús
dc.contributor.author.eng.fl_str_mv	Melo, Jhon-Alejandro Amador-Donado, Siler Pardo-Calvache, César-Jesús
dc.subject.none.fl_str_mv	Factorización Procesamiento paralelo Criptoanálisis Procesamiento distribuido Cryptanalysis Distributed processing Factoring Parallel processing
topic	Factorización Procesamiento paralelo Criptoanálisis Procesamiento distribuido Cryptanalysis Distributed processing Factoring Parallel processing
publishDate	2024
dc.date.accessioned.none.fl_str_mv	2024-08-29 21:27:51 2026-04-16T17:47:34Z
dc.date.available.none.fl_str_mv	2024-08-29 21:27:51
dc.date.issued.none.fl_str_mv	2024-08-29
dc.type.spa.fl_str_mv	Artículo de revista
dc.type.coar.fl_str_mv	http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.coar.none.fl_str_mv	http://purl.org/coar/resource_type/c_6501
dc.type.driver.none.fl_str_mv	info:eu-repo/semantics/article
dc.type.local.eng.fl_str_mv	Journal article
dc.type.version.none.fl_str_mv	info:eu-repo/semantics/publishedVersion
dc.type.content.none.fl_str_mv	Text
dc.type.coarversion.none.fl_str_mv	http://purl.org/coar/version/c_970fb48d4fbd8a85
format	http://purl.org/coar/resource_type/c_6501
status_str	publishedVersion
dc.identifier.issn.none.fl_str_mv	0121-1129
dc.identifier.uri.none.fl_str_mv	https://repositorio.uptc.edu.co/handle/001/21581
dc.identifier.doi.none.fl_str_mv	10.19053/uptc.01211129.v33.n69.2024.17935
dc.identifier.eissn.none.fl_str_mv	2357-5328
dc.identifier.url.none.fl_str_mv	https://doi.org/10.19053/uptc.01211129.v33.n69.2024.17935
identifier_str_mv	0121-1129 10.19053/uptc.01211129.v33.n69.2024.17935 2357-5328
url	https://repositorio.uptc.edu.co/handle/001/21581 https://doi.org/10.19053/uptc.01211129.v33.n69.2024.17935
dc.language.iso.none.fl_str_mv
language_invalid_str_mv
dc.relation.references.none.fl_str_mv	Ponemon Institute, Global Encryption Trends Study: The data is in the cloud, but who’s in control? 2022. https://www.entrust.com/es/resources/reports/global-encryption-trends-study E. Suescún-Monsalve, J.-C. Sampaio-do-Prado-Leite, C.-J. Pardo-Calvache, “Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering,” Revista Facultad de Ingeniería, vol. 31, no. 60, e14189, May 2022, https://doi.org/10.19053/01211129.v31.n60.2022.14189 K. Petersen, H. Flensburg, R. Feldt, M. Mattsson, S. Mujtaba, Systematic Mapping Studies in Software Engineering, 2008. B. Kitchenham, S. M. Charters, Guidelines for performing Systematic Literature Reviews in Software Engineering, 2007. D. Budgen, M. Turner, P. Brereton, B. Kitchenham, Using Mapping Studies in Software Engineering, 2008. https://www.ebse.org.uk E. Nicolás, P. Paredes, C. E. Orozco, C. Pardo, “Análisis del estado del arte acerca de la (in)felicidad en las comunidades de desarrollo de software ágil,” RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao, vol. 57, pp. 425-437, 2023. Z. Li and W. Gasarch, An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm, 2021. https://doi.org/10.48550/arXiv.2111.02967 C. Bouillaguet, P. Zimmermann, Parallel Structured Gaussian Elimination for the Number Field Sieve, 2021. H. M. Bahig, H. M. Bahig, Y. Kotb, “Fermat factorization using a multi-core system,” International Journal of Advanced Computer Science and Applications, vol. 11, no. 4, pp. 323-330, 2020. https://doi.org/10.14569/IJACSA.2020.0110444 J. V. Monaco, M. M. Vindiola, “Factoring Integers with a Brain-Inspired Computer,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 65, no. 3, pp. 1051-1062, 2018. https://doi.org/10.1109/TCSI.2017.2771533 L. T. Yang, Y. Huang, J. Feng, Q. Pan, C. Zhu, “An improved parallel block Lanczos algorithm over GF(2) for integer factorization,” Information Sciences, vol. 379, no. 2, pp. 257-273, 2017. https://doi.org/10.1016/j.ins.2016.09.052 B. Sengupta, A. Das, “Use of SIMD-based data parallelism to speed up sieving in integerfactoring algorithms,” Appl Math Comput, vol. 293, pp. 204-217, 2017. https://doi.org/10.1016/j.amc.2016.08.019 E. J. Vuicik, D. Šešok, S. Ramanauskaitė, “Efficiency of RSA Key Factorization by Open-Source Libraries and Distributed System Architecture,” Baltic Journal of Modern Computing, vol. 5, no. 3, pp. 269-274, 2017. https://doi.org/10.22364/bjmc.2017.5.3.02 V. Shende, G. Sudi, M. Kulkarni, “Fast cryptanalysis of RSA encrypted data using a combination of mathematical and brute force attack in distributed computing environment,” in IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI), 2017, pp. 2446-2449. https://doi.org/10.1109/ICPCSI.2017.8392156 D. Breitenbacher, I. Homoliak, J. Jaros, P. Hanacek, “Impact of optimization and parallelism on factorization speed of SIQS,” in 20th World Multi-Conference on Systemics, Cybernetics and Informatics, 2016, pp. 55-62. H. Yu, G. Bai, “Strategy of Relations Collection in Factoring RSA Modulus,” Lecture Notes in Computer Science, vol. 9543, pp. 199-211, 2016. https://doi.org/10.1007/978-3-319-29814-6_16 S. Daoud, I. Gad, “A parallel line sieve for the GNFS Algorithm,” International Journal of Advanced Computer Science and Applications, vol. 5, no. 7, pp. 178-185, 2014. https://doi.org/10.14569/ijacsa.2014.050727 B. Sengupta, A. Das, “SIMD-based implementations of sieving in integer-factoring algorithms,”Lecture Notes in Computer Science, vol. 8204, pp. 40-55, 2013. https://doi.org/10.1007/978-3-642-41224-0_4 L. T. Yang, L. Xu, S. S. Yeo, S. Hussain, “An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2),” Computers and Mathematics with Applications, vol. 60, no. 2, pp. 338-346, 2010. https://doi.org/10.1016/j.camwa.2010.01.020 U. Meyer-Bäse, G. Botella, E. Castillo, A. García, “Nios II hardware acceleration of the epsilon quadratic sieve algorithm,” Proceedings of SPIE - The International Society for Optical Engineering, vol. 7703, e77030M, 2010. https://doi.org/10.1117/12.849883 R. V. Yampolskiy, “Application of bio-inspired algorithm to the problem of integer factorization,” International Journal of Bio-Inspired Computation, vol. 2, no. 2, pp. 115-123, 2010. https://doi.org/10.1504/IJBIC.2010.032127 G. Macariu, D. Petcu, “Parallel multiple polynomial quadratic sieves on multi-core architectures,” in 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 59-65, 2007. https://doi.org/10.1109/SYNASC.2007.21 L. T. Yang, L. Xu, M. Lin, “Integer factorization by a parallel GNFS algorithm for public key cryptosystems,” Lecture Notes in Computer Science, vol. 3820, pp. 683-695, 2005. https://doi.org/10.1007/11599555_65 F. Boudot et al., “State of the Art in Integer Factoring and Breaking Public-Key Cryptography,” IEEE Security and Privacy Magazine, vol. 2022, no. 2, e314918. https://doi.org/10.1109/MSEC.2022.3141918ï R. Young, P. Birch, C. Chatwin, A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform, 2018. https://doi.org/10.1117/12.2309468 S. K. Sehgal, R. Gupta, “Quantum Cryptography and Quantum Key,” in International Conference on Industrial Electronics Research and Applications, 2021, pp. 1-5. https://doi.org/10.1109/ICIERA53202.2021.9726722
dc.relation.citationendpage.none.fl_str_mv	e17935
dc.relation.citationissue.eng.fl_str_mv	69
dc.relation.citationstartpage.none.fl_str_mv	e17935
dc.relation.citationvolume.eng.fl_str_mv	33
dc.relation.ispartofjournal.eng.fl_str_mv	Revista Facultad de Ingeniería
dc.relation.bitstream.none.fl_str_mv	https://revistas.uptc.edu.co/index.php/ingenieria/article/download/17935/14642 https://revistas.uptc.edu.co/index.php/ingenieria/article/download/17935/14942
dc.relation.citationedition.eng.fl_str_mv	Núm. 69 , Año 2024 : July-September 2024: Open Science at the Service of Engineering
dc.rights.none.fl_str_mv	Jhon-Alejandro Melo, Siler Amador-Donado, César-Jesús Pardo-Calvache - 2024
dc.rights.uri.none.fl_str_mv	https://creativecommons.org/licenses/by/4.0
dc.rights.accessrights.none.fl_str_mv	info:eu-repo/semantics/openAccess
dc.rights.creativecommons.none.fl_str_mv	This work is licensed under a Creative Commons Attribution 4.0 International License.
dc.rights.coar.none.fl_str_mv	http://purl.org/coar/access_right/c_abf2
rights_invalid_str_mv	Jhon-Alejandro Melo, Siler Amador-Donado, César-Jesús Pardo-Calvache - 2024 https://creativecommons.org/licenses/by/4.0 This work is licensed under a Creative Commons Attribution 4.0 International License. http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv	openAccess
dc.format.mimetype.none.fl_str_mv	application/pdf text/xml
dc.publisher.eng.fl_str_mv	Universidad Pedagógica y Tecnológica de Colombia
dc.source.none.fl_str_mv	https://revistas.uptc.edu.co/index.php/ingenieria/article/view/17935
institution	Universidad Pedagógica y Tecnológica de Colombia
bitstream.url.fl_str_mv	https://repositorio.uptc.edu.co/bitstreams/2e99885b-be05-4bc6-bc00-fb1a9222881e/download
bitstream.checksum.fl_str_mv	414120e2232ea06ac335024c35125970
bitstream.checksumAlgorithm.fl_str_mv	MD5
repository.name.fl_str_mv	Repositorio Institucional UPTC
repository.mail.fl_str_mv	bdigital@metabiblioteca.com
_version_	1881674028674973696
spelling	Melo, Jhon-AlejandroAmador-Donado, SilerPardo-Calvache, César-Jesús2024-08-29 21:27:512026-04-16T17:47:34Z2024-08-29 21:27:512024-08-290121-1129https://repositorio.uptc.edu.co/handle/001/2158110.19053/uptc.01211129.v33.n69.2024.179352357-5328https://doi.org/10.19053/uptc.01211129.v33.n69.2024.17935application/pdftext/xmlUniversidad Pedagógica y Tecnológica de ColombiaJhon-Alejandro Melo, Siler Amador-Donado, César-Jesús Pardo-Calvache - 2024https://creativecommons.org/licenses/by/4.0info:eu-repo/semantics/openAccessThis work is licensed under a Creative Commons Attribution 4.0 International License.http://purl.org/coar/access_right/c_abf2https://revistas.uptc.edu.co/index.php/ingenieria/article/view/17935FactorizaciónProcesamiento paraleloCriptoanálisisProcesamiento distribuidoCryptanalysisDistributed processingFactoringParallel processingEstudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisisArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1info:eu-repo/semantics/articleJournal articleinfo:eu-repo/semantics/publishedVersionTexthttp://purl.org/coar/version/c_970fb48d4fbd8a85Ponemon Institute, Global Encryption Trends Study: The data is in the cloud, but who’s in control? 2022. https://www.entrust.com/es/resources/reports/global-encryption-trends-studyE. Suescún-Monsalve, J.-C. Sampaio-do-Prado-Leite, C.-J. Pardo-Calvache, “Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering,” Revista Facultad de Ingeniería, vol. 31, no. 60, e14189, May 2022, https://doi.org/10.19053/01211129.v31.n60.2022.14189K. Petersen, H. Flensburg, R. Feldt, M. Mattsson, S. Mujtaba, Systematic Mapping Studies in Software Engineering, 2008.B. Kitchenham, S. M. Charters, Guidelines for performing Systematic Literature Reviews in Software Engineering, 2007.D. Budgen, M. Turner, P. Brereton, B. Kitchenham, Using Mapping Studies in Software Engineering, 2008. https://www.ebse.org.ukE. Nicolás, P. Paredes, C. E. Orozco, C. Pardo, “Análisis del estado del arte acerca de la (in)felicidad en las comunidades de desarrollo de software ágil,” RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao, vol. 57, pp. 425-437, 2023.Z. Li and W. Gasarch, An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm, 2021. https://doi.org/10.48550/arXiv.2111.02967C. Bouillaguet, P. Zimmermann, Parallel Structured Gaussian Elimination for the Number Field Sieve, 2021.H. M. Bahig, H. M. Bahig, Y. Kotb, “Fermat factorization using a multi-core system,” International Journal of Advanced Computer Science and Applications, vol. 11, no. 4, pp. 323-330, 2020. https://doi.org/10.14569/IJACSA.2020.0110444J. V. Monaco, M. M. Vindiola, “Factoring Integers with a Brain-Inspired Computer,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 65, no. 3, pp. 1051-1062, 2018. https://doi.org/10.1109/TCSI.2017.2771533L. T. Yang, Y. Huang, J. Feng, Q. Pan, C. Zhu, “An improved parallel block Lanczos algorithm over GF(2) for integer factorization,” Information Sciences, vol. 379, no. 2, pp. 257-273, 2017. https://doi.org/10.1016/j.ins.2016.09.052B. Sengupta, A. Das, “Use of SIMD-based data parallelism to speed up sieving in integerfactoring algorithms,” Appl Math Comput, vol. 293, pp. 204-217, 2017. https://doi.org/10.1016/j.amc.2016.08.019E. J. Vuicik, D. Šešok, S. Ramanauskaitė, “Efficiency of RSA Key Factorization by Open-Source Libraries and Distributed System Architecture,” Baltic Journal of Modern Computing, vol. 5, no. 3, pp. 269-274, 2017. https://doi.org/10.22364/bjmc.2017.5.3.02V. Shende, G. Sudi, M. Kulkarni, “Fast cryptanalysis of RSA encrypted data using a combination of mathematical and brute force attack in distributed computing environment,” in IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI), 2017, pp. 2446-2449. https://doi.org/10.1109/ICPCSI.2017.8392156D. Breitenbacher, I. Homoliak, J. Jaros, P. Hanacek, “Impact of optimization and parallelism on factorization speed of SIQS,” in 20th World Multi-Conference on Systemics, Cybernetics and Informatics, 2016, pp. 55-62.H. Yu, G. Bai, “Strategy of Relations Collection in Factoring RSA Modulus,” Lecture Notes in Computer Science, vol. 9543, pp. 199-211, 2016. https://doi.org/10.1007/978-3-319-29814-6_16S. Daoud, I. Gad, “A parallel line sieve for the GNFS Algorithm,” International Journal of Advanced Computer Science and Applications, vol. 5, no. 7, pp. 178-185, 2014. https://doi.org/10.14569/ijacsa.2014.050727B. Sengupta, A. Das, “SIMD-based implementations of sieving in integer-factoring algorithms,”Lecture Notes in Computer Science, vol. 8204, pp. 40-55, 2013. https://doi.org/10.1007/978-3-642-41224-0_4L. T. Yang, L. Xu, S. S. Yeo, S. Hussain, “An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2),” Computers and Mathematics with Applications, vol. 60, no. 2, pp. 338-346, 2010. https://doi.org/10.1016/j.camwa.2010.01.020U. Meyer-Bäse, G. Botella, E. Castillo, A. García, “Nios II hardware acceleration of the epsilon quadratic sieve algorithm,” Proceedings of SPIE - The International Society for Optical Engineering, vol. 7703, e77030M, 2010. https://doi.org/10.1117/12.849883R. V. Yampolskiy, “Application of bio-inspired algorithm to the problem of integer factorization,” International Journal of Bio-Inspired Computation, vol. 2, no. 2, pp. 115-123, 2010. https://doi.org/10.1504/IJBIC.2010.032127G. Macariu, D. Petcu, “Parallel multiple polynomial quadratic sieves on multi-core architectures,” in 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 59-65, 2007. https://doi.org/10.1109/SYNASC.2007.21L. T. Yang, L. Xu, M. Lin, “Integer factorization by a parallel GNFS algorithm for public key cryptosystems,” Lecture Notes in Computer Science, vol. 3820, pp. 683-695, 2005. https://doi.org/10.1007/11599555_65F. Boudot et al., “State of the Art in Integer Factoring and Breaking Public-Key Cryptography,” IEEE Security and Privacy Magazine, vol. 2022, no. 2, e314918. https://doi.org/10.1109/MSEC.2022.3141918ïR. Young, P. Birch, C. Chatwin, A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform, 2018. https://doi.org/10.1117/12.2309468S. K. Sehgal, R. Gupta, “Quantum Cryptography and Quantum Key,” in International Conference on Industrial Electronics Research and Applications, 2021, pp. 1-5. https://doi.org/10.1109/ICIERA53202.2021.9726722e1793569e1793533Revista Facultad de Ingenieríahttps://revistas.uptc.edu.co/index.php/ingenieria/article/download/17935/14642https://revistas.uptc.edu.co/index.php/ingenieria/article/download/17935/14942Núm. 69 , Año 2024 : July-September 2024: Open Science at the Service of EngineeringPublicationOREORE.xmltext/xml2756https://repositorio.uptc.edu.co/bitstreams/2e99885b-be05-4bc6-bc00-fb1a9222881e/download414120e2232ea06ac335024c35125970MD51falseAnonymousREAD001/21581oai:repositorio.uptc.edu.co:001/215812026-10-29 14:05:31.589https://creativecommons.org/licenses/by/4.0metadata.onlyhttps://repositorio.uptc.edu.coRepositorio Institucional UPTCbdigital@metabiblioteca.com

Estudio de mapeo sistemático sobre factorización rápida utilizando procesamiento paralelo o distribuido aplicado al criptoanálisis

Publicaciones similares