Time filter

Source Type

Ciudad Victoria, Mexico

Morales-Sandoval M.,Polytechnic University of Victoria | Feregrino-Uribe C.,National Institute of Astrophysics, Optics and Electronics | Kitsos P.,Hellenic Open University
IET Computers and Digital Techniques | Year: 2011

This work presents novel multipliers for Montgomery multiplication defined on binary fields GF(2m). Different to state of the art Montgomery multipliers, this work uses a linear feedback shift register (LFSR) as the main building block. The authors studied different architectures for bit-serial and digit-serial Montgomery multipliers using the LFSR and the Montgomery factors xm and xm-1. The proposed multipliers are for different classes of irreducible polynomialsgeneral, all one polynomials, pentanomials and trinomials. The results show that the use of LFSRs simplifies the design of the multipliers architecture reducing area resources and retaining high performance compared to related works. © 2011 The Institution of Engineering and Technology.

Miranda R.,Polytechnic University of Victoria
CCE 2012 - 2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control | Year: 2012

This paper deals with the analysis of a closed-loop identification technique applied to a DC servomechanism from a passivity point of view. It is shown that the closed-loop system together with the identification algorithm can be divided into simpler subsystems easier to analyze and then, many properties related to passivity and stability can be deduced. Furthermore, it is shown that with this separation approach we have the freedom to select many controller structures, which could let to improve the performance of the identification algorithm, even in presence of perturbation signals. © 2012 IEEE.

Rocha-Rangel E.,Polytechnic University of Victoria | Miranda-Hernandez J.G.,Metropolitan Autonomous University
Materials Science Forum | Year: 2010

Through an intense mixing process of Al2O3 powder with different copper contents, Al2O3-Cu composites were fabricated by sintered at 1300°C during 1h, where the likely liquid sintering mechanism, lead to obtain composites with relative densities greater than 95%. Scanning electron microscopy was used to observe the resulting microstructures, which indicated that these composites were mostly formed by a fine and homogeneous Al2O3-ceramic matrix with immerse nano-metallic copper particles. The behavior of both fracture toughness and electrical resistance of the composites is directly dependent with the copper content in the matrix. As the copper contents increased, the composites exhibited high values of fracture toughness, whereas, their electrical resistance is reduced considerably. © (2010) Trans Tech Publications.

Morales-Sandoval M.,Polytechnic University of Victoria | Feregrino-Uribe C.,National Institute of Astrophysics, Optics and Electronics | Kitsos P.,Hellenic Open University | Cumplido R.,National Institute of Astrophysics, Optics and Electronics
Computers and Electrical Engineering | Year: 2013

Montgomery Multiplication is a common and important algorithm for improving the efficiency of public key cryptographic algorithms, like RSA and Elliptic Curve Cryptography (ECC). A natural choice for implementing this time consuming multiplication defined on finite fields, mainly over GF(2m), is the use of Field Programmable Gate Arrays (FPGAs) for being reconfigurable, flexible and physically secure devices. FPGAs allow the implementation of this kind of algorithms in a broad range of applications with different area-performance requirements. In this paper, we explore alternative architectures for constructing GF(2m) digit-serial Montgomery multipliers on FPGAs based on Linear Feedback Shift Registers (LFSRs) and study their area-performance trade-offs. Different Montgomery multipliers were implemented using several digits and finite fields to compare their performance metrics such as area, memory, latency, clocking frequency and throughput to show suitable configurations for ECC implementations using NIST recommended parameters. The results achieved show a notable improvement against FPGA Montgomery multiplier previously reported, achieving the highest throughput and the best efficiency. © 2012 Elsevier Ltd. All rights reserved.

Polanco Gonzalez C.,National Autonomous University of Mexico | Polanco Gonzalez C.,Autonomous University of the State of Morelos | Nuno Maganda M.A.,Polytechnic University of Victoria | Arias-Estrada M.,National Institute of Astrophysics, Optics and Electronics | del Rio G.,National Autonomous University of Mexico
PLoS ONE | Year: 2011

Exhaustive prediction of physicochemical properties of peptide sequences is used in different areas of biological research. One example is the identification of selective cationic antibacterial peptides (SCAPs), which may be used in the treatment of different diseases. Due to the discrete nature of peptide sequences, the physicochemical properties calculation is considered a high-performance computing problem. A competitive solution for this class of problems is to embed algorithms into dedicated hardware. In the present work we present the adaptation, design and implementation of an algorithm for SCAPs prediction into a Field Programmable Gate Array (FPGA) platform. Four physicochemical properties codes useful in the identification of peptide sequences with potential selective antibacterial activity were implemented into an FPGA board. The speed-up gained in a single-copy implementation was up to 108 times compared with a single Intel processor cycle for cycle. The inherent scalability of our design allows for replication of this code into multiple FPGA cards and consequently improvements in speed are possible. Our results show the first embedded SCAPs prediction solution described and constitutes the grounds to efficiently perform the exhaustive analysis of the sequence-physicochemical properties relationship of peptides. © 2011 Polanco González et al.

Discover hidden collaborations