Meier W, Staffelbach O. Nonlinearity criteria for cryptographic functions//Advances in Cryptology- Eurocrypt'89 (Lecture Notes in Computer Science). Berlin: Springer-Verlag, 1992: 549-562.
[2]
Lidl R, Niederreiter H. Finite fields[J]. Encyclopedia of mathematics and its applications, 1983, 20:420-450.
[3]
McFarland R L. A family of noncyclic difference sets[J]. Journal of Combinatorics Theory (Series A), 1973(15): 1-10.
[4]
Carlet C. Generalized partial spreads[J]. IEEE Transactions on Information Theory, 1995, 41(5): 1482-1487.
[5]
常祖领, 陈鲁生, 符方伟. PS类Bent函数的一种构造方法 [J]. 电子学报, 2004, 32(10): 1649-1653. Chang Zuling, Chen Lusheng, Fu Fangwei. One method for constructing Bent functions of class PS[J]. Acta Lectronica Sinica, 2004, 32(10): 1649-1653.
[6]
Dobbertin H. Construction of Bent functions and balanced Boolean functions with high nonlinearity//Proceedings of the 1994 Leuven Workshop on Cryptographic Algorithms (Lecture Notes in Computer Science). Berlin: Springer-Verlag, 1995: 61-74.
[7]
Youssef A M, Gong G. Hyper-bent functions//Advances in Cryptology-EUROCRYPT'2001 (Lecture Notes in Computer Science). Berlin: Springer-Verlag, 2001: 406-419.
[8]
Rothaus O S. On Bent functions[J]. Journal of Combinatorics Theory (Series A), 1976, 20: 300-305.
[9]
Blahut R E. Theory and practice of error control codes[M]. Boston: Addison-Wesley Publishing Company, 1983.
[10]
Chang Z L, Wen Q Y. On PS Bent functions//ICICS 2005. Bangkok:, 2005: 1379-1382.
[11]
MacWilliams F J, Sloane N J A. The theory of error correcting codes[M]. Amsterdam:, 1977.
[12]
Dillon J F. Elementary hadamard difference sets. Maryland: University of Maryland, 1974.
