Eduardo Ochoa-Jimenez

Eduardo Ochoa-Jimenez

Auto-generated profile, based on publicly available information

Eduardo Ochoa-Jimenez

Cryptography Research Center, Technology Innovation Institute

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
9 November 2017 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
AFArmando Faz-Hernandez
Armando Faz-Hernandez
JLJulio López
Julio López
EOEduardo Ochoa Ochoa-Jiménez
Eduardo Ochoa Ochoa-Jiménez
FRFrancisco Rodriguez-Henriquez
Francisco Rodriguez-Henriquez
Since its introduction by Jao and De Feo in 2011, the supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol has positioned itself as a promising candidate for post-quantum cryptography. One salient feature of the SIDH protocol is that it requires exceptionally short key sizes. However, the latency associated to SIDH is higher than the ones reported for other post-quantum cryptosystem proposals. Aiming to accelerate the SIDH runtime performance, we introduce a more efficient approach for calculating the elliptic curve operation P + [k]Q. Our strategy achieves a factor 1.4 speedup compared with the popular variable-three-point ladder algorithm regularly used in the SIDH shared secret phase. Moreover, profiting from pre-computation techniques our algorithm yields a factor 1.7 acceleration for the computation of this operation in the SIDH key generation phase. We also present an optimized evaluation of the point tripling formula, and discuss several algorithmic and implementation techniques that lead to faster field arithmetic computations. A software implementation of the above improvements on an Intel Skylake Core i7-6700 processor gives a factor 1.33 speedup against the state-of-the-art software implementation of the SIDH protocol reported by Costello-Longa-Naehrig in CRYPTO 2016.

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.

13 May 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
DCDaniel Cervantes-Vazquez
Daniel Cervantes-Vazquez
EOEduardo Ochoa-Jimenez
Eduardo Ochoa-Jimenez
FRFrancisco Rodriguez-Henriquez
Francisco Rodriguez-Henriquez
We present novel strategies and concrete algorithms for the parallel computation of the Supersingular Isogeny-based Diffie-Hellman key exchange (SIDH) protocol when executed on multi-core platforms. The most relevant design idea exploited by our approach is that of concurrently computing scalar multiplication operations along with a parallelized version of the strategies required for constructing and evaluating large smooth degree isogenies. We report experimental results showing that a three-core implementation of our parallel approach achieves an acceleration factor of 1.45 compared against a sequential implementation of the Supersingular Isogeny Key Encapsulation (SIKE) protocol instantiated with the prime p751

26 October 2026 in IACR Communications in Cryptology
Verified
Journal Article
Open access
PDF file
LBLoïc Bidoux
Loïc Bidoux
JCJesús-Javier Chi-Domínguez
Jesús-Javier Chi-Domínguez
EOEduardo Ochoa-Jiménez
Eduardo Ochoa-Jiménez
The MPC-in-the-Head paradigm is widely used to build post-quantum digital signatures as it provides a versatile way to design Proofs of Knowledge based on hard problems. Despite similarities among the MPC-in-the-Head based schemes, differences in size and performance persist among these schemes, fundamentally determined by choices in proof system parameters (such as the number of simulated parties and repetitions) and optimized implementation techniques. RYDE is a MPCitH based signature scheme relying on the hardness of the rank syndrome decoding problem. This work explores an alternative selection of parameters for RYDE looking for an optimal choice leading to efficient implementations by moving towards additional optimized AVX implementations for the underlying mathematical operations (e.g., field, vector, and matrix-related arithmetic). It also addresses another important performance bottleneck, stemming from the design choice in symmetric primitive instantiation for expanding seeds, committing messages, and sampling pseudo-random mathematical objects. Exploring the optimization boundaries of RYDE also helps maximizing the efficiency of other rank-based cryptosystems sharing similar underlying mathematical concepts. As a main result, our experiments show a considerable speedup in the signing and verification procedures of RYDE. For parameter sets corresponding to Fast variants, we achieve between 1.5x and 2.4x faster performances than the baseline RYDE without affecting signature sizes. For the Short variants, we observe between 3.8x and 5.5x faster running times at the cost of a limited overhead in signature sizes.