北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 学术论文 • 上一篇    下一篇

构造GF(2)~n的t-正交分划的递归生成算法

  

  1. 1.北京邮电大学理学院, 北京 100876; 2.北京邮电大学信息工程学院, 北京100876

Recursive Production Algorithm of a Lager Set of Orthogonal Arrays of GF(2)n

  1. 1.School of science, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2.Inofrmation Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China

摘要: 给出了构造GF(2)~n的一个t-正交分划的递归生成算法的一种具体实现,该算法可以用来构造在密码学及容错分布计算等领域有着广泛应用的t-弹性函数。

关键词: 正交矩阵, 弹性函数, 密码

Abstract: A kind of realization of the recursive production algorithm of a lager set of orthogonal arrays of GF(2)n 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.

Key words: orthogonal arrays, resilient functions, cryptology

中图分类号: