Paper Info
Title
Squeezing Polynomial Masking in Tower Fields - A Higher-Order Masked AES S-Box.
Abstract
Polynomial masking is a higher-order and glitch-resistant masking scheme to protect cryptographic implementations against side-channel attacks. Polynomial masking was introduced at CHES 2011, while a 1 st-order polynomially masked AES S-box hardware implementation was presented at CHES 2013, and later on improved at TIs 2016. Polynomial masking schemes are advantageous in the way they can be easily adapted to every block-cipher and inherently scaled to any masking order using simple hardware design patterns. As a drawback, they typically have large area, time, and randomness requirements when compared to other masking schemes, e.g. threshold implementations. In this work, we show how tower fields can be perfectly committed to polynomial masking schemes, to reduce both area and randomness requirements of higher-order polynomially masked implementations, with application to AES. We provide ASIC synthesis results up to the 6 th masking order and perform side-channel attacks on a Xilinx Spartan6 FPGA up to the 2 nd masking order.
Year
DOI
Venue
2016
10.1007/978-3-319-54669-8_12
Lecture Notes in Computer Science
Keywords
Field
DocType
Polynomial masking,Secret sharing,Multi-party computation,AES,Tower fields,Side-channel analysis
S-box,Tower,Polynomial,Masking (art),Computer security,Computer science,Field-programmable gate array,Software design pattern,Algorithm,Application-specific integrated circuit,Randomness
Conference
Volume
ISSN
Citations 
10146
0302-9743
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Fabrizio De Santis18410.44
Tobias Bauer200.68
Georg Sigl344762.13