Show simple item record

dc.contributor.advisorBollman, Dorothy
dc.contributor.authorFerrer-Moreno, Edgar
dc.date.accessioned2019-02-12T15:30:46Z
dc.date.available2019-02-12T15:30:46Z
dc.date.issued2008
dc.identifier.urihttps://hdl.handle.net/20.500.11801/1795
dc.description.abstractFinite field arithmetic plays an important role in a wide range of applications. This research is originally motivated by an application of computational biology where genetic networks are modeled by means of finite fields. Nonetheless, this work has application in various research fields including digital signal processing, error correcting codes, Reed-Solomon encoders/decoders, elliptic curve cryptosystems, or computational and algorithmic aspects of commutative algebra. We present a set of efficient algorithms for finite field arithmetic over GF(2m), which are implemented on a High Performance Reconfigurable Computing platform. In this way, we deliver new and efficient designs on Field Programmable Gate Arrays (FPGA) for accelerating finite field arithmetic. Among the arithmetic operations, the most frequently used and time consuming operation is multiplication. We have designed 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. Here, the bit-level representation of the elements in GF(2m) and some special structures in the formulation of multiplication and inversion algorithms, have been exploited in order to use efficiently the FPGAs resources. Furthermore, we have also proposed a novel approach for multiplication over finite fields GF(pm), with p 6= 2, where the com putational complexity is reduced from O(n2) to O(n log n).en_US
dc.description.sponsorshipNational Science Foundation (grant NSF-CISE EIA-0080926) and the Ph.D program in CISE provided financial support.en_US
dc.language.isoEnglishen_US
dc.subjectFinite field arithmeticen_US
dc.subjectEngineering genetic networksen_US
dc.titleAcceleration of finite field arithmetic with an application to reverse engineering genetic networksen_US
dc.typeDissertationen_US
dc.rights.licenseAll rights reserveden_US
dc.rights.holder(c) 2008 Adgar Ferrer Morenoen_US
dc.contributor.committeeColon, Omar
dc.contributor.committeeMoreno, Oscar
dc.contributor.committeeSantiago, Nayda
dc.contributor.representativeOrozco, Edusmildo
thesis.degree.levelPh.D.en_US
thesis.degree.disciplineComputing and Information Sciences and Engineeringen_US
dc.contributor.collegeCollege of Engineeringen_US
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.description.graduationYear2008en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Theses & Dissertations
    Items included under this collection are theses, dissertations, and project reports submitted as a requirement for completing a degree at UPR-Mayagüez.

Show simple item record

All rights reserved
Except where otherwise noted, this item's license is described as All Rights Reserved