Arturo Diaz-Perez

Learn More
This work presents an evaluation of different software implementations of algorithms to compute the most demanding operation in cryptographic schemes based on Elliptic Curve Cryptography (ECC), the scalar multiplication. Five different methods were studied, including traditional and more sophisticated methods for elliptic curve cryptography defined over(More)
This work describes a compact FPGA hardware architecture for computing modular multiplications over GF(<i>p</i>) using the Montgomery method, suitable for public key cryptography for embedded or mobile systems. The multiplier is parameterizable, allowing to evaluate the hardware design for different prime fields using different radix of the form &#946; =(More)
This work describes FPGA hardware architectures of GF(2<sup>m</sup>) multipliers being more compact than a bit-serial multiplier and outperforming software counterparts. The proposed multiplier is more compact than a hardware implementation of the bit-serial approach, considered the most compact one. Also, the designs proposed still outperform software(More)
Rosetta method predicts the tertiary structure of proteins, which is important for determining protein function in an organism. It generates a great number of tridimensional protein conformations for a target sequence of amino acids. Its goal is to find the structure with the lowest free energy for the target sequence. The function that evaluates the free(More)
This report describes the design and implementation results in FPGAs of a scalable hardware architecture for computing modular multiplication in prime fields GF(p), based on the Montgomery multiplication (MM) algorithm. Starting from an existing digit-serial version of the MM algorithm, a novel digit-digit based MM algorithm is derived and two hardware(More)
This work describes novel hardware architectures for GF(2<sup>k</sup>) multipliers using a digit-digit approach. Contrary to the bit-serial and digit-serial approaches previously addressed in the literature, we consider the partition of the multiplier, multiplicand and modulus in several digits and execute a field multiplication in an iterative way, like in(More)
This paper presents AES4SeC, a security scheme fully constructed over cryptographic pairings. The main building blocks of AES4SeC are attribute-based encryption (ABE) and short signatures (SSign), with generalized constructions for the Type 3 pairing. AES4SeC was developed as an end-to-end storage service for hybrid cloud models and integrated to a(More)