On 3-share threshold implementations for 4-Bit S-boxes
One of the most promising lightweight hardware countermeasures against SCA attacks is the so-called Threshold Implementation (TI) [12] countermeasure. In this work we discuss issues towards its applicability and introduce solutions to boost its implementation efficiency. In particular, our contribut...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/99651 http://hdl.handle.net/10220/17588 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-99651 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-996512023-02-28T19:17:46Z On 3-share threshold implementations for 4-Bit S-boxes Kutzner, Sebastian Nguyen, Phuong Ha Poschmann, Axel Wang, Huaxiong School of Physical and Mathematical Sciences International Workshop, Constructive Side-Channel Analysis and Secure Design (4th : 2013 : Paris, France) PACE Temasek Laboratories DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks One of the most promising lightweight hardware countermeasures against SCA attacks is the so-called Threshold Implementation (TI) [12] countermeasure. In this work we discuss issues towards its applicability and introduce solutions to boost its implementation efficiency. In particular, our contribution is three-fold: first we introduce two methodologies to efficiently implement 3-share TI to a given S-box. Second, as an example, we successfully apply these methodologies to PRESENT and are able to decrease the area requirements of its protected S-box by 37-40%. Third, we present the first successful practical Mutual Information Attack on the original 3-share TI implementation of PRESENT and compare it with a correlation-enhanced collision attack using second-order moments. Accepted version 2013-11-11T08:46:45Z 2019-12-06T20:09:52Z 2013-11-11T08:46:45Z 2019-12-06T20:09:52Z 2013 2013 Conference Paper Kutzner, S., Nguyen, P. H., Poschmann, A., & Wang, H. (2013). On 3-Share Threshold Implementations for 4-Bit S-boxes. 4th International Workshop, Constructive Side-Channel Analysis and Secure Design (COSADE) 2013, 7864, pp.99-113. https://hdl.handle.net/10356/99651 http://hdl.handle.net/10220/17588 10.1007/978-3-642-40026-1_7 175086 en © 2013 Springer-Verlag Berlin Heidelberg. This is the author created version of a work that has been peer reviewed and accepted for publication by 4th International Workshop, Constructive Side-Channel Analysis and Secure Design (COSADE) 2013, Springer-Verlag Berlin Heidelberg. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/978-3-642-40026-1_7]. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks |
spellingShingle |
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Kutzner, Sebastian Nguyen, Phuong Ha Poschmann, Axel Wang, Huaxiong On 3-share threshold implementations for 4-Bit S-boxes |
description |
One of the most promising lightweight hardware countermeasures against SCA attacks is the so-called Threshold Implementation (TI) [12] countermeasure. In this work we discuss issues towards its applicability and introduce solutions to boost its implementation efficiency. In particular, our contribution is three-fold: first we introduce two methodologies to efficiently implement 3-share TI to a given S-box. Second, as an example, we successfully apply these methodologies to PRESENT and are able to decrease the area requirements of its protected S-box by 37-40%. Third, we present the first successful practical Mutual Information Attack on the original 3-share TI implementation of PRESENT and compare it with a correlation-enhanced collision attack using second-order moments. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Kutzner, Sebastian Nguyen, Phuong Ha Poschmann, Axel Wang, Huaxiong |
format |
Conference or Workshop Item |
author |
Kutzner, Sebastian Nguyen, Phuong Ha Poschmann, Axel Wang, Huaxiong |
author_sort |
Kutzner, Sebastian |
title |
On 3-share threshold implementations for 4-Bit S-boxes |
title_short |
On 3-share threshold implementations for 4-Bit S-boxes |
title_full |
On 3-share threshold implementations for 4-Bit S-boxes |
title_fullStr |
On 3-share threshold implementations for 4-Bit S-boxes |
title_full_unstemmed |
On 3-share threshold implementations for 4-Bit S-boxes |
title_sort |
on 3-share threshold implementations for 4-bit s-boxes |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/99651 http://hdl.handle.net/10220/17588 |
_version_ |
1759856522654908416 |