5 papers · 1 filter
A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
Ziran Tu, Sihem Mesnager, Xiangyong Zeng +3
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from to , with all the exponents being mult…
A new class of S-boxes with optimal Feistel boomerang uniformity
Yuxuan Lu, Sihem Mesnager, Nian Li +2
The Feistel Boomerang Connectivity Table (), which is the Feistel version of the Boomerang Connectivity Table (), plays a vital role in analyzing block ciphers…
Optimal linear codes with few weights from simplicial complexes
Bing Chen, Yunge Xu, Zhao Hu +2
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let be a prime power. In thi…
Infinite families of optimal and minimal codes over rings using simplicial complexes
Yanan Wu, Tingting Pang, Nian Li +2
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the speci…
The Explicit values of the UBCT, the LBCT and the DBCT of the inverse function
Yuying Man, Nian Li, Zhen Liu +1
Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower B…