Mason Archival Repository Service

Distributed Computing and Optimization Space Exploration for Fair and Efficient Benchmarking of Cryptographic Cores in FPGAs

Show simple item record

dc.contributor.advisor Gaj, Kris
dc.contributor.author Brewster, Benjamin
dc.creator Brewster, Benjamin
dc.date 2012-05-02
dc.date.accessioned 2012-06-18T20:35:49Z
dc.date.available NO_RESTRICTION en_US
dc.date.available 2012-06-18T20:35:49Z
dc.date.issued 2012-06-18
dc.identifier.uri https://hdl.handle.net/1920/7889
dc.description.abstract Benchmarking of digital designs targeting FPGAs is a time intensive and challenging process. Benchmarking results depend on a myriad of variables beyond the properties inherent to the designs being evaluated, encompassing the tools, tool options, FPGA families, and languages used. In this thesis we will be discussing enhancements made to the ATHENa benchmarking tool to utilize distributed computing as well as optimization space exploration techniques to increase the efficiency of the ATHENa benchmarking process. Capabilities of the environment are demonstrated using four example designs from the SHA-3 cryptographic hashing function competition, BLAKE, JH, Keccak and Skein.
dc.language.iso en_US en_US
dc.subject Benchmarking en_US
dc.subject FPGA en_US
dc.subject Cryptography en_US
dc.subject Optimization en_US
dc.title Distributed Computing and Optimization Space Exploration for Fair and Efficient Benchmarking of Cryptographic Cores in FPGAs en_US
dc.type Thesis en
thesis.degree.name Masters in Computer Engineering en_US
thesis.degree.level Master's en
thesis.degree.discipline Computer Engineering en
thesis.degree.grantor George Mason University en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Browse

My Account

Statistics