Further research results on confusion coefficient of Boolean functions

Abstract: The notion of confusion coefficient (CC) is a property that attempts to characterize the confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between CC and the transparency order (TO) for any Boolean function and deduce some relationships between the sum-of-squares of CC, signal-to-noise ratio, and TO. We also give a tight upper bound and a tight lower bound on the sum-of-squares of CC for balanced s-plateaued functions. Finally, the results generalized a lower bound on the sum-of-squares of CC of Boolean functions with the Hamming weight k.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Further research results on confusion coefficient of Boolean functions ; volume:17 ; number:1 ; year:2023 ; extent:8 ; Journal of mathematical cryptology ; 17, Heft 1 (2023) (gesamt 8)

Contributors, Places and Time

• Creator: Liu, Zhenyu ; Zhuo, Zepeng

Further information

• DOI: 10.1515/jmc-2021-0039
• URN: urn:nbn:de:101:1-2023112213071409082618
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:21 AM CEST