preprints.org > engineering > other > doi: 10.20944/preprints202401.1310.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 16 January 2024 / Approved: 17 January 2024 / Online: 17 January 2024 (11:28:13 CET)

Vectorial Boolean functions and codes are closely related, and each corresponding domain gives been to each other. On the one hand, various requirements of binary linear codes are needed for their theatrical interests but, more importantly, for their practical applicants (such as few-weight codes or minimal codes for secret sharing, locally recoverable codes for storage, etc.). On the other hand, various criteria and tables have been introduced to analyse the security of S-boxes that are related to vectorial Boolean functions, such as the Differential Distribution Table (DDT), the Boomerang Connectivity Table (BCT), and the Differential-Linear Connectivity Table (DLCT). In previous years, two new tables have been proposed for which the literature was pretty abundant: the $c$-DDT to extend the DDT and the $c$-BCT to extend the BCT. In the same vein, we propose extended concepts to study further the security of vectorial Boolean functions, especially the $c$-Walsh transform, the $c$-autocorrelation, and the $c$-differential-linear uniformity, and its accompanying table, the $c$-Differential-Linear Connectivity Table ($c$-DLCT). We study these properties of the novel functions at their optimal level concerning these concepts and describe the $c$-DLCT of the crucial inverse vectorial (Boolean) function case. Finally, the derived functions could lead to new families of binary minimal codes, as the recent achievements on minimal codes from low differential uniformity. We draw new avenues for future research toward linear code designs.

Differential uniformity; Vectorial Function; S-Box; Linear Codes; Minimal Codes

Engineering, Other

* All users must log in before leaving a comment