High-Nonlinearity Balanced Boolean Functions Constructed by the OIWR Algorithm for n=8 to 18

Abstract We provide a dataset of high-nonlinearity balanced Boolean functions constructed by the OIWR algorithm (https://eprint.iacr.org/2026/985). The dataset contains Boolean functions with variable size (n) ranging from 8 to 18. For each (n), one balanced Boolean function with high nonlinearity obtained by the OIWR algorithm is provided. Instructions: The dataset is provided in a single TXT file: n=8_to_18_balanced.txt This file contains high-nonlinearity balanced Boolean functions generated by the OIWR algorithm. Each line corresponds to one Boolean function and follows the format: n=k truth_table where (k) is the number of variables and truth_table is the binary truth table of the corresponding Boolean function. The comparison of the maximum nonlinearity of balanced functions achievable by various methods is as follows. n Best known Indirect-sum construction Search-based GP OIWR 8 116 116 116 116 9 240 240 240 240 10 492 488 492 492 11 992 992 992 992 12 2,012 2,000 2,008 2,010 13 4,036 4,032 4,032 4,032 14 8,120 8,096 8,120 8,120 15 16,272 16,256 16,256 16,256 16 32,638 32,576 32,608 32,628