By Topic

A Dynamic and Differential CMOS Lookup Table with Data Independent Power Consumption for Cryptographic Applications on Chip Cards

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bucci, M. ; Infineon Technol. Austria, Graz ; Giancane, L. ; Luzzi, R. ; Trifiletti, A.

Attacks based on a differential power analysis (DPA) are a main threat when designing cryptographic functions for implementation on chip cards. In this paper, a dynamic and differential lookup table (LUT) is presented and evaluated on a case study simulation. The proposed circuit shows a power consumption independent from the input data and can be employed to implement combinatorial functions in cryptographic processors when a high resistance against tampering is required. A typical application is the design of nonlinear functions (for example, substitution boxes) since protecting them with less expensive countermeasures (for example, random masking) implies a significant overhead. In the adopted case study, a 1.02 percent spread in the power consumption has been obtained when parasitic capacitances are taken into account. Moreover, a comparison with a static complementary metal-oxide semiconductor implementation shows an acceptable overhead in terms of area and power consumption.

Published in:

Dependable and Secure Computing, IEEE Transactions on  (Volume:4 ,  Issue: 4 )