Nareli Cruz-Cortés

Nareli Cruz-Cortés

Auto-generated profile, based on publicly available information

Nareli Cruz-Cortés

Centro de Investigación en Computación, Instituto Politécnico Nacional, México

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
3 January 2020 in IEEE Access
Verified
Journal Article
Open access
EOEduardo Ochoa-Jimenez
Eduardo Ochoa-Jimenez
LRLuis Rivera-Zamarripa
Luis Rivera-Zamarripa
NCNareli Cruz-Cortes
Nareli Cruz-Cortes
FRFrancisco Rodriguez-Henriquez
Francisco Rodriguez-Henriquez
This paper reports a constant-time CPU and GPU software implementation of the RSA exponentiation by using algorithms that offer a first-line defense against timing and cache attacks. In the case of GPU platforms the modular arithmetic layer was implemented using the Residue Number System (RNS) representation. We also present a CPU implementation of an RNS-based arithmetic that takes advantage of the parallelism provided by the Advanced Vector Extensions 2 (AVX2) instructions. Moreover, we carefully analyze the performance of two popular RNS modular reduction algorithms when implemented on many- and multi-core platforms. In the case of CPU platforms we also report that a combination of the schoolbook and Karatsuba algorithms for integer multiplication along with Montgomery reduction, yields our fastest modular multiplication procedure. In comparison with previous literature, our software library achieves faster timings for the computation of the RSA exponentiation using 1024-, 2048- and 3072-bit private keys.

1 December 2009 in Journal of Applied Research and Technology
Verified
Journal Article
Open access
PDF file
GLGerardo Abel Laguna-Sanchez
Gerardo Abel Laguna-Sanchez
MOMauricio Olguin-Carbajal
Mauricio Olguin-Carbajal
NCNareli Cruz-Cortés
Nareli Cruz-Cortés
RBRicardo Barrón-Fernández
Ricardo Barrón-Fernández
JAJesús Antonio Alvarez-Cedillo
Jesús Antonio Alvarez-Cedillo
The Particle Swarm Optimization (PSO) algorithm is a well known alternative for global optimization based on a bio‐inspired heuristic. PSO has good performance, low computational complexity and few parameters. Heuristic techniques have been widely studied in the last twenty years and the scientific community is still interested in technological alternatives that accelerate these algorithms in order to apply them to bigger and more complex problems. This article presents an empirical study of some parallel variants for a PSO algorithm, implemented on a Graphic Process Unit (GPU) device with multi‐thread support and using the most recent model of parallel programming for these cases. The main idea is to show that, with the help of a multithreading GPU, it is possible to significantly improve the PSO algorithm performance by means of a simple and almost straightforward parallel programming, getting the computing power of cluster in a conventional personal computer.

1 January 2018 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
GAGora Adj
Gora Adj
ICIsaac Canales-Martínez
Isaac Canales-Martínez
NCNareli Cruz-Cortés
Nareli Cruz-Cortés
AMAlfred Menezes
Alfred Menezes
TOThomaz Oliveira
Thomaz Oliveira
FRFrancisco Rodríguez-Henríquez
Francisco Rodríguez-Henríquez
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasi-polynomial algorithm. In this paper, we report on our successful computation of discrete logarithms in the cryptographically-interesting characteristic-three finite field $\mathbb{F}_{3^{6.509}}$ using these new algorithms; prior to 2013, it was believed that this field enjoyed a security level of 128 bits. We also show that a recent idea of Guillevic can be used to compute discrete logarithms in the cryptographically-interesting finite field $\mathbb{F}_{3^{6.709}}$ using essentially the same resources as we expended on the $\mathbb{F}_{3^{6.509}}$ computation. Finally, we argue that discrete logarithms in the finite field $\mathbb{F}_{3^{6.1429}}$ can feasibly be computed today; this is significant because this cryptographically-interesting field was previously believed to enjoy a security level of 192 bits.

1 September 2014 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
JGJuan E. Guzmán-Trampe
Juan E. Guzmán-Trampe
NCNareli Cruz-Cortés
Nareli Cruz-Cortés
Luis Julian Dominguez PerezLuis Julian Dominguez Perez
Luis Julian Dominguez Perez
DODaniel Ortiz-Arroyo
Daniel Ortiz-Arroyo
FRFrancisco Rodríguez-Henríquez
Francisco Rodríguez-Henríquez