Cryptology ePrint Archive: Report 2017/1193

Rhythmic Keccak: SCA Security and Low Latency in HW

Victor Arribas and Begül Bilgin and George Petrides and Svetla Nikova and Vincent Rijmen

Abstract: Glitches entail a great issue when securing a cryptographic implementation in hardware. Several masking schemes have been proposed in the literature that provide security even in the presence of glitches. The key property that allows this protection was introduced in threshold implementations as non-completeness. We address crucial points to ensure the right compliance of this property especially for low-latency implementations. Specifically, we first discuss the existence of a flaw in DSD 2017 implementation of Keccak by Gross et al. in violation of the non-completeness property and propose a solution. We perform a side-channel evaluation on the first-order and second-order implementations of the proposed design where no leakage is detected with up to 55 million traces. Then, we present a method to ensure a non-complete scheme of an unrolled implementation applicable to any order of security or algebraic degree of the shared function. By using this method we design a two-rounds unrolled first-order Keccak-f [200] implementation that completes an encryption in 20.61ns, the fastest implementation in the literature to this date.

Category / Keywords: Glitch, non-completeness, threshold implementation, consolidated masking scheme, domain-oriented masking

Date: received 8 Dec 2017, last revised 12 Dec 2017

Contact author: varribas at esat kuleuven be, bbilgin@esat kuleuven be, g petrides@eclatent com, Svetla Nikova@esat kuleuven be, vincent rijmen@esat kuleuven be,

Available format(s): PDF | BibTeX Citation

Version: 20171218:193042 (All versions of this report)

Short URL: ia.cr/2017/1193

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]