The Notion of Transparency Order, Revisited. (3rd July 2020)

• Record Type: Journal Article
• Authors: Li, Huizhong; Zhou, Yongbin; Ming, Jingdian; Yang, Guang; Jin, Chengbin
• Is Part Of: Computer journal. Volume 63:Number 12(2020)
• Page Start: 1915
• Page End: 1938
• Publication Date: 2020-07-03
• Subjects: transparency order -- differential power analysis -- S-box -- Hamming weight leakage model; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxaa069
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: We revisit the definition of transparency order (TO) and that of modified transparency order (MTO) as well, which were proposed to measure the resistance of substitution boxes (S-boxes) against differential power analysis (DPA). We spot a definitional flaw in original TO, which is proved to significantly affect the soundness of TO. Regretfully, MTO overlooks this flaw, yet it happens to incur no bad effects on the correctness of MTO, even though the start point of this formulation is highly questionable. It is also this neglect that made MTO consider a variant of multi-bit DPA attack, which was mistakenly thought to appropriately serve as an alternative powerful attack. This implies the soundness of MTO is also more or less arguable. Therefore, we fix this definitional flaw and provide a revised definition named reVisited TO (VTO). For demonstrating validity and soundness of VTO, we present simulated and practical DPA attacks on implementations of $4\times 4$ and $8\times 8$ S-boxes. In addition, we also illustrate the soundness of VTO in masked S-boxes. Furthermore, as a concrete application of VTO, we present the distribution of VTO values of optimal affine equivalence classes of $4\times 4$ S-boxes and give some recommended guidelines on how to select $4\times 4$ S-boxes with higher DPA resistance at the identical level of implementation cost.