A paper by Gong and Youssef " Hyperbent Functions" (Google) describe the construction of boolean functions with cryptographic qualities stronger than the bent functions. ( for example the AND, NAND, OR and NOR functions with two variables are bent functions). Could someone take a quick look at this paper and see if you can convert the hyperbent function into an actual circuit diagram for me? I am not a mathematician, obviously!