Construction and Enumeration of Resilient Functions
Resilient functions,widely applied in some fields such as the fault-tolerant distributed computing,random sequence generation for stream cipher and quantum cryptographic key distribution,are equivalent to the orthogonal partition of (GF(2)n.Based on orthogonal matrix and orthogonal partition,this paper studies the problem of construction and enumeration of resilient functions,and presents new method for constructing orthogonal partition of GF(2)n,accordingly obtaining a large number of resilient functions and their enumeration result this document.
agonic functions resilient functions orthogonal matrix orthogonal split
Hao-ran Zheng Hai-mo Zhang Lei Guo Chun-ming Zhou
Information Science and Technology Institute Zhengzhou, 450004, China Huanghuai University Zhumadian, 463000, China
国际会议
2012 IEEE 14th International Conference on Communication Technology(2012年第十四届通信技术国际会议(ICCT 2012))
成都
英文
901-904
2012-11-09(万方平台首次上网日期,不代表论文的发表时间)