Back to search

Technical University of Crete (TUC)

Hardware and software development for the efficient mapping of mathematical problems on field programmable gate array systems

Abstract

dc:description

In the industrial market, designers have a significant incentive to get their products to market quickly: to maximize revenue and time-in-market. Every week that a product is not being sold represents lost revenue, increases the product’s market risk and lowers the chance of success. Field Programmable Gate Arrays (FPGAs) offer a low-risk, quick time-to-market solution that industrial designers can easily modify when they need to make changes, fix bugs or create product derivatives at some point in the future. However, power consumption is one of the main disadvantages of FPGAs. The post-fabrication flexibility provided by these devices is implemented using a large number of pre-fabricated routing tracks and programmable switches that consume a significant amount of power. This problem becomes even more critical when FPGAs are used for applications related to cryptography, since this high power consumption makes potential security applications more vulnerable to power analysis attacks. Facing this challenge the designers are sometimes forced to make radical changes to the design. These changes could include the partitioning of the algorithm into different hardware and software blocks, re-allocation of the FPGA logic or even re-designing the whole system from scratch. Since these options have a huge impact on time and money, early phase power estimations on FPGA devices are becoming more and more important. In this dissertation we investigate the power consumption problem and we evaluate the power estimation software that is being provided by the major FPGA vendors. We evaluate the difference between software and hardware cryptography blocks related to their power consumption and processing speed. Another part of this thesis also investigates the power consumption reduction that we can achieve by either using clock gating or Real-Time reconfiguration. We continue by exploring deeper the cryptography and the security algorithms by proposing and implementing faster large number factorization algorithms. We partition the algorithms in both software and hardware in such a way that we can achieve the best possible performance. Finally, we use the Real-Time reconfiguration capability of the state of the art FPGA devices in order to achieve even higher speed-ups.

Degree

thesis:*
Grantor dc:publisher
Technical University of Crete (TUC)
Year dc:date
2012

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Μεϊντάνης, Δημήτριος
  • Meidanis, Dimitrios

Subjects

dc:subject × 17

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/27095

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Μεϊντάνης, Δημήτριος; Meidanis, Dimitrios. Hardware and software development for the efficient mapping of mathematical problems on field programmable gate array systems. Technical University of Crete (TUC), 2012. http://hdl.handle.net/10442/hedi/27095