Abstract
Implementing cryptography and security into integrated circuits is somehow similar to applications in other fields. We have to worry about comparable optimization goals: area, power, energy, throughput and/or latency. Moore's law helps to attain these goals. However, it also gives the attackers more computational power to break cryptographic algorithms. On top of this, quantum computers may become soon a reality, so that novel, very computationally demanding "post-quantum" cryptographic algorithms need implementation. Finally, there is a third dimension to the problem: implementations have to be resistant against physical attacks and countermeasures increase the cost. This paper demonstrates with actual data how these conflicting challenges are being addressed.
| Original language | English |
|---|---|
| Title of host publication | 2015 IEEE International Solid-State Circuits Conference - (ISSCC) Digest of Technical Papers |
| Publisher | IEEE Computer Society Press |
| Pages | 1-2 |
| Number of pages | 2 |
| ISBN (Print) | 9781479962235 |
| DOIs | |
| Publication status | Published - 22 Feb 2015 |
| Event | 2015 IEEE International Solid- State Circuits Conference - (ISSCC) - San Francisco, CA, USA Duration: 22 Feb 2015 → 26 Feb 2015 |
Conference
| Conference | 2015 IEEE International Solid- State Circuits Conference - (ISSCC) |
|---|---|
| Period | 22/02/15 → 26/02/15 |
Fingerprint
Dive into the research topics of '24.1 Circuit challenges from cryptography'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver