Boolean functions constructed using digital sequences of linear recurrences

Key Points

• The class of boolean functions shows significant distance from affine functions, indicating unique characteristics.
• Nonlinearity and weights are explored, with findings suggesting notable differences compared to other function classes.
• Investigating this class provides insights into its cardinality and distance properties, enhancing understanding of boolean functions.
• The study demonstrates that functions derived from linear recurrences can exhibit varied properties useful in cryptography.