24.1 Circuit challenges from cryptography
- 1 February 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01936530,p. 1-2
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.Keywords
This publication has 3 references indexed in Scilit:
- Secure PRNG seeding on commercial off-the-shelf microcontrollers2013
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES2011
- AES-Based Security Coprocessor IC in 0.18-$muhbox m$CMOS With Resistance to Differential Power Analysis Side-Channel AttacksIEEE Journal of Solid-State Circuits, 2006