2011/02/10 by Josef Pieprzyk, Huaxiong Wang, Xian-Mo Zhang · 2 citations
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #graph theory and CDMA systems
paper · doi:10.1080/00207160.2010.509428
openalex publication_date 2011/02/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Boolean functions and their Möbius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean functions and their Möbius transforms. This work is composed of three parts. In the first part, we present relations between a Boolean function and its Möbius transform so as to convert the truth table/algebraic normal form (ANF) to the ANF/truth table of a function in different conditions. In the second part, we focus on the special case when a Boolean function is identical to its Möbius transform. We call such functions coincident. In the third part, we generalize the concept of coincident functions and indicate that any Boolean function has the coincidence property even it is not coincident.