Julio López

Dr. Julio López

Universidade Estadual de Campinas, Campinas, São Paulo, Brazil

Research Focus & Metrics

Academic Career Length

20Years (2007-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.

1 January 2010 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
Diego F. AranhaDiego F. Aranha
Diego F. Aranha
RDRicardo Dahab
Ricardo Dahab
JLJulio López
Julio López
LOLeonardo B. Oliveira
Leonardo B. Oliveira
The deployment of cryptography in sensor networks is a challenging task, given the limited computational power and the resource-constrained nature of the sensoring devices. This paper presents the implementation of elliptic curve cryptography in the MICAz Mote, a popular sensor platform. We present optimization techniques for arithmetic in binary fields, including squaring, multiplication and modular reduction at two different security levels. Our implementation of field multiplication and modular reduction algorithms focuses on the reduction of memory accesses and appears as the fastest result for this platform. Finite field arithmetic was implemented in C and Assembly and elliptic curve arithmetic was implemented in Koblitz and generic binary curves. We illustrate the performance of our implementation with timings for key agreement and digital signature protocols. In particular, a key agreement can be computed in 0.40 seconds and a digital signature can be computed and verified in 1 second at the 163-bit security level. Our results strongly indicate that binary curves are the most efficient alternative for the implementation of elliptic curve cryptography in this platform.

3 March 2012 in Journal of Cryptographic Engineering
Verified
Journal Article
Closed access
PDF file
CGConrado P. L. Gouvêa
Conrado P. L. Gouvêa
LOLeonardo B. Oliveira
Leonardo B. Oliveira
JLJulio López
Julio López

28 January 2014 in Journal of Cryptographic Engineering
Verified
Journal Article
Closed access
PDF file
TOThomaz Oliveira
Thomaz Oliveira
JLJulio López
Julio López
Diego F. AranhaDiego F. Aranha
Diego F. Aranha
FRFrancisco Rodríguez-Henríquez
Francisco Rodríguez-Henríquez

25 September 2011 in Journal of Cryptographic Engineering
Verified
Journal Article
Closed access
PDF file
JTJonathan Taverne
Jonathan Taverne
AFArmando Faz-Hernández
Armando Faz-Hernández
Diego F. AranhaDiego F. Aranha
Diego F. Aranha
FRFrancisco Rodríguez-Henríquez
Francisco Rodríguez-Henríquez
DHDarrel Hankerson
Darrel Hankerson
JLJulio López
Julio López

30 July 2019 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
AFArmando Faz-Hernández
Armando Faz-Hernández
JLJulio López
Julio López
RDRicardo Dahab
Ricardo Dahab
Elliptic curve cryptosystems are considered an efficient alternative to conventional systems such as DSA and RSA. Recently, Montgomery and Edwards elliptic curves have been used to implement cryptosystems. In particular, the elliptic curves Curve25519 and Curve448 were used for instantiating Diffie-Hellman protocols named X25519 and X448. Mapping these curves to twisted Edwards curves allowed deriving two new signature instances, called Ed25519 and Ed448, of the Edwards Digital Signature Algorithm. In this work, we focus on the secure and efficient software implementation of these algorithms using SIMD parallel processing. We present software techniques that target the Intel AVX2 vector instruction set for accelerating prime field arithmetic and elliptic curve operations. Our contributions result in a high-performance software library for AVX2-ready processors. For example, our library computes digital signatures 19% (for Ed25519) and 29% (for Ed448) faster than previous optimized implementations. Also, our library improves by 10% and 20% the execution time of X25519 and X448, respectively.