Distributed Computing and Optimization Space Exploration for Fair and Efficient Benchmarking of Cryptographic Cores in FPGAs
| 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 | |
| dc.date.available | 2012-06-18T20:35:49Z | |
| dc.date.issued | 2012-06-18 | |
| 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.identifier.uri | https://hdl.handle.net/1920/7889 | |
| dc.language.iso | en_US | |
| dc.subject | Benchmarking | |
| dc.subject | FPGA | |
| dc.subject | Cryptography | |
| dc.subject | Optimization | |
| dc.title | Distributed Computing and Optimization Space Exploration for Fair and Efficient Benchmarking of Cryptographic Cores in FPGAs | |
| dc.type | Thesis | |
| thesis.degree.discipline | Computer Engineering | |
| thesis.degree.grantor | George Mason University | |
| thesis.degree.level | Master's | |
| thesis.degree.name | Masters in Computer Engineering |