CryptoDB
Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures
NOTE: imports for ToSC and TCHES are no longer functioning.
Authors: | |
---|---|
Download: | |
Conference: | CHES 2017 |
Abstract: | Masking is a widespread countermeasure to protect implementations of block-ciphers against side-channel attacks. Several masking schemes have been proposed in the literature that rely on the efficient decomposition of the underlying s-box(es). We propose a generalized decomposition method for s-boxes that encompasses several previously proposed methods while providing new trade-offs. It allows to evaluate $$n\lambda $$ -bit to $$m\lambda $$ -bit s-boxes for any integers $$n,m,\lambda \ge 1$$ by seeing it a sequence of mn-variate polynomials over $$\mathbb {F}_{2^{\lambda }}$$ and by trying to minimize the number of multiplications over $$\mathbb {F}_{2^{\lambda }}$$ . |
BibTeX
@inproceedings{ches-2017-28947, title={Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures}, booktitle={Cryptographic Hardware and Embedded Systems – CHES 2017}, series={Lecture Notes in Computer Science}, publisher={Springer}, volume={10529}, pages={154-171}, doi={10.1007/978-3-319-66787-4_8}, author={Dahmun Goudarzi and Matthieu Rivain and Damien Vergnaud and Srinivas Vivek}, year=2017 }