Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-channel Countermeasures?

Abstract. We describe a new technique for evaluating polynomials over binary finite fields. This is useful in the context of anti-DPA counter-measures when an S-box is expressed as a polynomial over a binary finite field. For n-bit S-boxes our new technique has heuristic complexity O(2n/2/√n) instead of O(2n/2) proven complexity for the Parity-Split method. We also prove a lower bound of Ω(2n/2/ n) on the complexity of any method to evaluate n-bit S-boxes; this shows that our method is asymptotically optimal. Here, complexity refers to the number of non-linear multiplications required to evaluate the polynomial corresponding to an S-box. In practice we can evaluate any 8-bit S-box in 10 non-linear multiplica-tions instead of 16 in the Roy-Vivek paper from CHES 2013, and the DES S-boxes in 4 non-linear multiplications instead of 7. We also eval-uate any 4-bit S-box in 2 non-linear multiplications instead of 3. Hence our method achieves optimal complexity for the PRESENT S-box.