In this paper, the definition of multl-output partially Bent functions is presented and some properties are discussed. Then the relationship between multi-output partially Bent functions and multi-output Bent function...In this paper, the definition of multl-output partially Bent functions is presented and some properties are discussed. Then the relationship between multi-output partially Bent functions and multi-output Bent functions is given in Theorem 4, which includes Walsh spectrum expression and function expression. This shows that multi-output partially Bent functions and multi-output Bent functions can define each other in principle. So we obtain the general method to construct multi-output partially Bent functions from multi-output Bent functions.展开更多
By the relationship between the first linear spectra of a function at partialpoints and the Hamming weights of the sub-functions, and by the Hamming weight of homogenousBoolean function, it is proved that there exist ...By the relationship between the first linear spectra of a function at partialpoints and the Hamming weights of the sub-functions, and by the Hamming weight of homogenousBoolean function, it is proved that there exist no homogeneous bent functions ofdegree in in n = 2mvariables for m >3.展开更多
Based on the theory of quadratic forms over finite fields, a new construction of semi-bent and bent functions is presented. The proposed construction has a cascaded characteristic. Some previously known constructions ...Based on the theory of quadratic forms over finite fields, a new construction of semi-bent and bent functions is presented. The proposed construction has a cascaded characteristic. Some previously known constructions of semi-bent and bent functions are special cases of the new construction.展开更多
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 res...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?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6展开更多
Generalized Bent function and generalized Bent function sequences are introduced in this paper.The main performance or these sequences used as SW/SFH(Short Wave/Slow Frequency Hopping) code are studied. And the hardwa...Generalized Bent function and generalized Bent function sequences are introduced in this paper.The main performance or these sequences used as SW/SFH(Short Wave/Slow Frequency Hopping) code are studied. And the hardware circuit and the soflware program flow chart of the SW/SFH PN code generator are also given,which is based on generalized Bent function sequence generator by using a single chip mlcrocomputer.展开更多
基金Supported by State Key Laboratory of InformationSecurity Opening Foundation(01-02) the Doctorate Foundation ofInstitute of Information Engineering (YP20014401)HenanInno-vation Project for University Prominent Research Talents(2003KJCX008)
文摘In this paper, the definition of multl-output partially Bent functions is presented and some properties are discussed. Then the relationship between multi-output partially Bent functions and multi-output Bent functions is given in Theorem 4, which includes Walsh spectrum expression and function expression. This shows that multi-output partially Bent functions and multi-output Bent functions can define each other in principle. So we obtain the general method to construct multi-output partially Bent functions from multi-output Bent functions.
文摘By the relationship between the first linear spectra of a function at partialpoints and the Hamming weights of the sub-functions, and by the Hamming weight of homogenousBoolean function, it is proved that there exist no homogeneous bent functions ofdegree in in n = 2mvariables for m >3.
基金The Starting Research Projects for Young Teachers of Southwest Jiaotong University (No.2007Q090)
文摘Based on the theory of quadratic forms over finite fields, a new construction of semi-bent and bent functions is presented. The proposed construction has a cascaded characteristic. Some previously known constructions of semi-bent and bent functions are special cases of the new construction.
文摘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?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6
文摘Generalized Bent function and generalized Bent function sequences are introduced in this paper.The main performance or these sequences used as SW/SFH(Short Wave/Slow Frequency Hopping) code are studied. And the hardware circuit and the soflware program flow chart of the SW/SFH PN code generator are also given,which is based on generalized Bent function sequence generator by using a single chip mlcrocomputer.
