Departamento de Computación

Finite fields play an important role in a wide range of applications. This talk will present finite fields applied to computational biology where genetic networks are modeled by means of binary finite fields. A set of efficient algorithms for finite field arithmetic over GF(2^m) and some aspects concerning the design and implementation of these algorithms on FPGAs will be presented. We will be presenting a design of a fast and space-saving multiplier, which has been used for creating other efficient architectures for inversion and exponentiation which have in turn been used for developing a new and efficient architecture for finite field interpolation. Furthermore, we are proposing a novel approach for multiplication over extension fields of odd primes, where the computational complexity is reduced from O(n^2) to O(n log n).
Brief Bio: Edgar Ferrer is assistant professor and member of the Center for Information and Communications Studies at Turabo University, Puerto Rico. His research interest includes High Performance Computing and Reconfigurable Systems. He received a Ph.D. in Computing and Information Science and Engineering from University of Puerto Rico at Mayaguez. He is member of IEEE and the ACM.