Construction of generalized binary Bent sequences

Expand
  • 1.School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China; School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China; 2.State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing 100039, China; Department of Mathematics, Zhengzhou University, Zhengzhou 450025, China; 3.School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;

Published date: 05 Sep 2006

Abstract

Bent functions in trace forms play an important role in the constructions of generalized binary Bent sequences. Trace representation of some degree two Bent functions are presented in this paper. A sufficient and necessary condition is derived to determine whether the sum of the combinations of Gold functions, tr1n (x2i+1 ), 1≤in - 1, over finite fields F2n (n be even) in addition to another term tr1n/2 (x2n/2+1 ) is a Bent function. Similar to the result presented by Khoo et al., the condition can be verified by polynominal greatest common divisor (GCD) computation.A similar result also holds in the case Fpn ( n be even, p be odd prime). Using the constructed Bent functions and Niho type Bent functions given by Dobbertin et al., many new generalized binary Bent sequences are obtained.

Cite this article

KE Pin-hui, KE Pin-hui, CHANG Zu-ling, CHANG Zu-ling, WEN Qiao-yan, WEN Qiao-yan . Construction of generalized binary Bent sequences[J]. Frontiers of Electrical and Electronic Engineering, 2006 , 1(3) : 340 -344 . DOI: 10.1007/s11460-006-0045-9

Outlines

/