Paper 2016/630

Decomposed S-Boxes and DPA Attacks: A Quantitative Case Study using PRINCE

Ravikumar Selvam, Dillibabu Shanmugam, Suganya Annadurai, and Jothi Rangasamy


Lightweight ciphers become indispensable and inevitable in the ubiquitous smart devices. However, the security of ciphers is often subverted by various types of attacks, especially, implementation attacks such as side-channel attacks. These attacks emphasise the necessity of providing efficient countermeasures. In this paper, our contribution is threefold: First, we observe and resolve the inaccuracy in the well-known and widely used formula for estimation of the number of gate equivalents (GE) in shared implementation. Then we present the first quantitative study on the efficacy of Transparency Order (TO) of decomposed S-Boxes in thwarting a side-channel attack. Using PRINCE S-Box we observe that TO-based decomposed implementation has better DPA resistivity than the naive implementation. To benchmark the DPA resistivity of TO(decomposed S-Box) implementation we arrive at an efficient threshold implementation of PRINCE, which itself merits to be an interesting contribution.

Available format(s)
Publication info
Preprint. MINOR revision.
Threshold ImplementationTransparency OrderS-box decompositionFPGA
Contact author(s)
selvamravik @ gmail com
2016-06-17: received
Short URL
Creative Commons Attribution


      author = {Ravikumar Selvam and Dillibabu Shanmugam and Suganya Annadurai and Jothi Rangasamy},
      title = {Decomposed S-Boxes and DPA Attacks: A Quantitative Case Study using PRINCE},
      howpublished = {Cryptology ePrint Archive, Paper 2016/630},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.