Resource-constrained and Resource-efficient Modern Cryptosystem Design
| dc.contributor.author | Aysu, Aydin | en |
| dc.contributor.committeechair | Schaumont, Patrick R. | en |
| dc.contributor.committeemember | Patterson, Cameron D. | en |
| dc.contributor.committeemember | Nazhandali, Leyla | en |
| dc.contributor.committeemember | Yao, Danfeng (Daphne) | en |
| dc.contributor.committeemember | Yang, Yaling | en |
| dc.contributor.department | Electrical and ComputerEngineering | en |
| dc.date.accessioned | 2017-07-29T06:00:29Z | en |
| dc.date.available | 2017-07-29T06:00:29Z | en |
| dc.date.issued | 2016-07-20 | en |
| dc.description.abstract | In the context of a system design, resource-constraints refer to severe restrictions on allowable resources, while resource-efficiency is the capability to achieve a desired performance and, at the same time, to reduce wasting resources. To design for low-cost platforms, these fundamental concepts are useful under different scenarios and they call for different approaches, yet they are often mixed. Resource-constrained systems require aggressive optimizations, even at the expense of performance, to meet the stringent resource limitations. On the other hand, resource-efficient systems need a careful trade-off between resources and performance, to achieve the best possible combination. Designing systems for resource-constraints with the optimizations for resource-efficiency, or vice versa, can result in a suboptimal solution. Using modern cryptographic applications as the driving domain, I first distinguish resource-constraints from resource-efficiency. Then, I introduce the recurring strategies to handle these cases and apply them on modern cryptosystem designs. I illustrate that by clarifying the application context, and then by using appropriate strategies, it is possible to push the envelope on what is perceived as achievable, by up to two orders-of-magnitude. In the first part of this dissertation, I focus on resource-constrained modern cryptosystems. The driving application is Physical Unclonable Function (PUF) based symmetric-key authentication. I first propose the smallest block cipher in 128-bit security level. Then, I show how to systematically extend this design into the smallest application-specific instruction set processor for PUF-based authentication protocols. I conclude this part by proposing a compact method to combine multiple PUF components within a system into a single device identifier. In the second part of this dissertation, I focus on resource-efficient modern cryptosystems. The driving application is post-quantum public-key schemes. I first demonstrate energy-efficient computing techniques for post-quantum digital signatures. Then, I propose an area-efficient partitioning and a Hardware/Software codesign for its implementation. The results of these implemented modern cryptosystems validate the advantage of my approach by quantifying the drastic improvements over the previous best. | en |
| dc.description.degree | Ph. D. | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:8562 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/78469 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Embedded Systems | en |
| dc.subject | Lightweight Cryptography | en |
| dc.subject | Post-quantum Cryptography | en |
| dc.subject | Physical Unclonable Functions | en |
| dc.title | Resource-constrained and Resource-efficient Modern Cryptosystem Design | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Computer Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1