Completeness (cryptography)

In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits.