Otal, KamilTekin, Eda2024-09-292024-09-292022978-3-031-23200-8978-3-031-23201-51865-09291865-0937https://doi.org/10.1007/978-3-031-23201-5_5https://hdl.handle.net/20.500.14619/37781st International Conference on Cryptology, Coding Theory and Cyber Security (I4CS) -- OCT 27-28, 2022 -- Casablanca, MOROCCOSide-channel analysis (SCA) is a general name for cryptanalytic methods based on side information gathered by measuring and analyzing of various physical parameters. Threshold implementation (TI) is one of the successful countermeasure techniques for some types of SCA. Within this scope, Nikova et al. gave an algorithm on the decomposition of power permutations into quadratic power permutations over finite fields F2n in [Cryptogr. Commun. 11, 37-384 (2019)]. Later on, Otal and Tekin gave a sufficient way in [Cryptogr. Commun. 13, 837-845 (2021)] to reduce the precomputation cost in the algorithm of Nikova et al. substantially. In this paper, we prove that this sufficient way is also necessary, in other words, the proposed way is an optimal solution. In that way, we provide a complementary result on the construction of quadratic cyclotomic classes.eninfo:eu-repo/semantics/closedAccessBoolean functionsS-boxesPower permutationsConference Object10.1007/978-3-031-23201-5_52-s2.0-8514800847982Q4771747WOS:000978405400005N/A