Karina Jimenez

Mrs. Karina Jimenez

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 June 2016 in Advances in Intelligent Systems and Computing
Verified
Book Chapter
Closed access
PDF file
SCSandra Gómez Canaval
Sandra Gómez Canaval
KJKarina Jimenez
Karina Jimenez
AOAlfonso Ortega
Alfonso Ortega
SVStanislav Vakaruk
Stanislav Vakaruk

29 January 2020 in International Journal of Foundations of Computer Science
Verified
Journal Article
Closed access
PDF file
FMFernando Arroyo Montoro
Fernando Arroyo Montoro
Sandra Gómez-CanavalSandra Gómez-Canaval
Sandra Gómez-Canaval
KJKarina Jimenez
Karina Jimenez
APAlfonso Ortega de la Puente
Alfonso Ortega de la Puente

4 December 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
KJKarina Jimenez
Karina Jimenez
Sandra Gómez-CanavalSandra Gómez-Canaval
Sandra Gómez-Canaval
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
SSSilvia Martín Suazo
Silvia Martín Suazo
Networks of picture processors is a massively distributed and parallel computational model inspired by the evolutionary cellular processes, which offers efficient solutions for NP-complete problems. This bio-inspired model computes two-dimensional strings (pictures) using simple rewriting rules (evolutionary operations). The functioning of this model mimics a community of cells (pictures) that are evolving according to these bio-operations via a selection process that filters valid surviving cells. In this paper, we propose an extension of this model that empowers it with a flexible method that selects the processed pictures based on a quantitative evaluation of its content. In order to show the versatility of this extension, we introduce a solver for a cryptographic proof-of-work based on the hardness of finding a solution to a set of random quadratic equations over the finite field F2. This problem is demonstrated to be NP-hard, even with quadratic polynomials over the field F2, when the number of equations and the number of variables are of roughly the same size. The proposed solution runs in O(n2) computational steps for any size (n,m) of the input pictures. In this context, this paper opens up a wide field of research that looks for theoretical and practical solutions of cryptographic problems via software/hardware implementations based on bio-inspired computational models.