Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of University of Electronic Science and Technology of China》 2004-02
Add to Favorite Get Latest Update

A Best Possible Computable Upper Bound on Bent Functions

Wang Ling,Zhang Jianzhou (1. School of Electrical Engineering, UEST of China Chengdu 610054; 2. College of Computer, Sichuan University Chengdu 610065)  
Enumeration and estimation of bent functions are closely related to the security of stream ciphers designed by them. In this paper, bent matrix is introduced when bent function is denoted by the ordered characteristic matrix. With help of the definition of bent function, some properties of bent matrix are obtained. On the basis of the author抯 approach to solving the enumeration of the first order correlation-immune Boolean functions, a computable upper bound on the number of bent functions, which is represented by the summation over the integer partition, is given. Examples show that the upper bound is a best possible upper bound.
【Fund】: 国家自然科学基金资助项目(60371024)
【CateGory Index】: O174
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved