Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2004, Vol. 27 ›› Issue (3): 113-116.

• PAPERS • Previous Articles    

A Problem with the Construction and Enumeration of (n,m,1)-Resilient Functions

HUANG Zheng1,3, DING Jin-kou1, WEN Qiao-yan1, YANG Yi-xian2   

  1. 1. Science School, Beijing University of Posts and Telecommunications,Beijing 100876, China;
    2. Information Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    3. Stake Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing 100039, China
  • Received:2003-02-26 Online:2004-03-28

Abstract: The resilient function is one of the multiple-output Boolean functions, An important work the resilient function has to do is to prevent the information eavesdropping. The more numbers of the resilient functions have the more safety the cryptographic system will be. On the other hand, construction, as well as enumeration in (n,m,1)-resilient functions, has to be paid more attention to. Construction and enumeration were studied when the order of resiliency was t=1,n-m>t, upon which, three classes of (n,m,1)-resilient functions, based on the construction of n-variables balanced correlation-immune functions of the first-order, and on the equivalence between resilient functions and large sets of orthogonal arrays(a group of orthogonal arrays), are implemented in the case of n-m>t=1. Also, an enumeration lower bound of a (n,m,1)-resilient function was presented.

Key words: resilient functions, orthogonal array, enumeration, quantum crypto-graphic key distribution

CLC Number: