dc.contributor.authorKutzner, Sebastian
dc.contributor.authorNguyen, Phuong Ha
dc.contributor.authorPoschmann, Axel
dc.identifier.citationKutzner, S., Nguyen, P. H., & Poschmann, A. (2012). Enabling 3-share Threshold Implementations for all 4-bit S-boxes. Cryptology ePrint Archive, 2012/510.en_US
dc.description.abstractThreshold Implementation (TI) is an elegant and widely accepted countermeasure against 1-st order Differential Power Analysis (DPA) in Side Channel Attacks. The 3-share TI is the most efficient version of TI, but so far, it can only be applied to 50\% of all 4-bit S-boxes. In this paper, we study the limitations of decomposition and introduce factorization to enable the 3-share TI for any optimal 4-bit S-box. We propose an algorithm which can decompose any optimal 4-bit S-box to quadratic vectorial boolean functions with a time complexity of $2^{19}$. Furthermore, we use our new methodology in combination with decomposition to optimize ciphers utilizing many different S-boxes, and, to highlight the strength of our new methodology, we construct a 3-share Threshold Implementation of SERPENT which was believed to be not possible until now. Last, we show how to implemented all SERPENT S-boxes with only one mutual core.en_US
dc.rights© 2012 The Author(s). This is the author created version of a work that has been peer reviewed and accepted for publication by Cryptology ePrint Archive, IACR. 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: [URL:http://eprint.iacr.org/2012/510].en_US
dc.titleEnabling 3-share threshold implementations for all 4-bit S-boxesen_US
dc.typeConference Paper
dc.contributor.conferenceCryptology ePrint Archiveen_US
dc.contributor.researchTemasek Laboratoriesen_US
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.description.versionAccepted versionen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record