Protecting AES with Shamir's Secret Sharing Scheme [chapter]

Louis Goubin, Ange Martinelli
2011 Lecture Notes in Computer Science  
Cryptographic algorithms embedded on physical devices are particularly vulnerable to Side Channel Analysis (SCA). The most common countermeasure for block cipher implementations is masking, which randomizes the variables to be protected by combining them with one or several random values. In this paper, we propose an original masking scheme based on Shamir's Secret Sharing scheme [23] as an alternative to Boolean masking. We detail its implementation for the AES using the same tool than Rivain
more » ... nd Prouff in CHES 2010 [17]: multi-party computation. We then conduct a security analysis of our scheme in order to compare it to Boolean masking. Our results show that for a given amount of noise the proposed scheme -implemented to the first orderprovides the same security level as 3 rd up to 4 th order boolean masking, together with a better efficiency.
doi:10.1007/978-3-642-23951-9_6 fatcat:ydhmtcigqvfgvjw4j3bwhc6mva