Abstract: This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2)ⁿ→GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties: nl(f)=2^2k-1-2^k+2^k-2 (n=2k), with the sum-of-squares avalanche characteristic of f satisfying σ_f=2^4k+2^3k+2+2^3k+2^3k-2 and the absolute avalanche characteristic of Δ_f satisfying Δ_f=2^k+1. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions.

Key words: Boolean functions, Bent sequences, Nonlinearity, GAC, PC, Balancedness

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):