The Characteristics of Linear Structure for Cryptographic Function over Finite Field

The paper firstly reveals the characteristics of linear structure for cryptographic function over finite field, which is quiet different from that over prime field, and some examples are presented to support the result. Then a class of functions taking all vectors as their linear structures is suggested, which are called generalized affine functions and have the similar properties with that of affine function.