摘要
给出了构造GF(2)n的一个t-正交分划的递归生成算法的一种具体实现.该算法可以用来构造在密码学及容错分布计算等领域有着广泛应用的t-弹性函数.
A kind of realization of the recursive production algorithm of a lager set of orthogonal arrays of GF(2)' is given. Resilient functions, they are applied widely in some fields such as cryptology and the fault-tolerant distributed computing, are constructed by this algorithm.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2003年第z1期57-59,共3页
Journal of Beijing University of Posts and Telecommunications
关键词
正交矩阵
弹性函数
密码
orthogonal arrays
resilient functions
cryptology
