Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/192122
DC Field | Value | |
---|---|---|
dc.title | LOW-POWER HARDWARE SECURITY PRIMITIVES IMMERSED IN LOGIC AND MEMORY | |
dc.contributor.author | SACHIN TANEJA | |
dc.date.accessioned | 2021-06-21T18:00:21Z | |
dc.date.available | 2021-06-21T18:00:21Z | |
dc.date.issued | 2021-01-21 | |
dc.identifier.citation | SACHIN TANEJA (2021-01-21). LOW-POWER HARDWARE SECURITY PRIMITIVES IMMERSED IN LOGIC AND MEMORY. ScholarBank@NUS Repository. | |
dc.identifier.uri | https://scholarbank.nus.edu.sg/handle/10635/192122 | |
dc.description.abstract | Security of ubiquitous connected systems (e.g., IoT nodes) has gained more importance due to the growing cost of security breaches. The security of these devices can be easily compromised with malicious physical access due to in-field operation and the recent affordability of physical attacks. Design of the secure system on chip (SoC) requires energy- and cost-efficient hardware security primitives (e.g., PUF, TRNG, cryptographic cores) to implement root-of-trust. Different design challenges are low energy efficiency, design margining, robust operation and design methodology. Firstly, a fully-synthesizable PUF is proposed in 40 nm featured 3.2% BER with low design effort and in-logic obfuscation. Design margining is eliminated with the proposed PUF-based key generation architecture featuring run-time adaptation with 2X high energy efficiency in 40 nm. Also, a novel unified all-digital and fully-synthesizable architecture for TRNG and cryptographic core is reported with the highest area efficiency in 40 nm. Further, a unified in-memory TRNG and multi-bit PUF is proposed using 16 kb SRAM in 28 nm by reusing memories. Lastly, a security scalable cryptographic core is implemented in 40 nm with dynamic key length from up to 256-bit. | |
dc.language.iso | en | |
dc.subject | Hardware security, true random number generator (TRNG), physically unclonable function (PUF), private key cryptography, static random access memory | |
dc.type | Thesis | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.contributor.supervisor | Massimo Bruno Alioto | |
dc.description.degree | Ph.D | |
dc.description.degreeconferred | DOCTOR OF PHILOSOPHY (CDE-ENG) | |
dc.identifier.orcid | 0000-0002-4590-7875 | |
Appears in Collections: | Ph.D Theses (Open) |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
TanejaSachin.pdf | 6.45 MB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.