A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
On the construction of cryptographically strong boolean functions with desirable trade-off
2005
Journal of Zhejiang University: Science A
This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →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
doi:10.1631/jzus.2005.a0358
fatcat:3f4oiktcmjfqjkk7fr3afd5aka