Cryptology ePrint Archive: Report 2016/715

Uniform First-Order Threshold Implementations

Tim Beyne and Begül Bilgin

Abstract: Most masking schemes used as a countermeasure against side-channel analysis attacks require an extensive amount of fresh random bits on the fly. This is burdensome especially for lightweight cryptosystems. Threshold implementations (TIs) that are secure against firstorder attacks have the advantage that fresh randomness is not required if the sharing of the underlying function is uniform. However, finding uniform realizations of nonlinear functions that also satisfy other TI properties can be a challenging task. In this paper, we discuss several methods that advance the search for uniformly shared functions for TIs. We focus especially on three-share implementations of quadratic functions due to their low area footprint. Our methods have low computational complexity even for 8-bit Boolean functions.

Category / Keywords: boolean functions, correction terms, masking, randomness, threshold implementations, uniformity

Date: received 18 Jul 2016

Contact author: tim beyne at student kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20160721:145751 (All versions of this report)

Short URL: ia.cr/2016/715

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]