Mastrovito Multiplier for All Trinomials
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
FPGA Implementation of an Efficient Multiplier over Finite Fields GF(2^m)
RECONFIG '05 Proceedings of the 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05) on Reconfigurable Computing and FPGAs
Fixed points in discrete models for regulatory genetic networks
EURASIP Journal on Bioinformatics and Systems Biology
A fast finite field multiplier
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
| Hi-index | 0.00 |
An important issue in computational biology is the reverse engineering problem for genetic networks. In this ongoing work we consider reverse engineering in the context of univariate finite fields models. A solution to the reverse engineering problem using multipoint interpolation relies on intensive arithmetic computations over finite fields, where multiplication is the dominant operation. In this work, we develop an efficient multiplier for fields GF(2m) generated by irreducible trinomials of the form αm +αn +1. We propose a design described by a parallel/serial architecture that computes a multiplication in m clock cycles. This approach exploits symmetries in Mastrovito matrices in order to improve time complexities of an FPGA (Field Programmable Gate Array) implementation. According to preliminary performance results, our approach performs efficiently for large fields and has potential for an efficient solution of the reverse engineering problem for large genetic networks, as well as other finite fields applications such as cryptography and Reed-Solomon decoders.