Decomposed S-Boxes and DPA Attacks: A Quantitative Case Study Using PRINCE
| Autor: | Dillibabu Shanmugam, Ravikumar Selvam, Jothi Rangasamy, Suganya Annadurai |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
021110 strategic
defence & security studies Computer engineering Computer science 0211 other engineering and technologies 0202 electrical engineering electronic engineering information engineering Decomposition (computer science) Benchmark (computing) Forensic engineering 020201 artificial intelligence & image processing 02 engineering and technology Side channel attack Transparency (human–computer interaction) |
| Zdroj: | Security, Privacy, and Applied Cryptography Engineering ISBN: 9783319494449 SPACE |
| DOI: | 10.1007/978-3-319-49445-6_10 |
| Popis: | 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 propose a method to choose the efficient decomposition of S-box in terms of area. Then we slightly alter the widely used formula to improve the accuracy for weighted sum estimation of the shared S-Box and present the practical implementation of two level decomposition using PRINCE S-Box. Finally, we present the first quantitative study on the efficacy of Transparency Order (TO) of decomposed S-Boxes in thwarting a side-channel attack. For 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|