一种新的正形置换构造方法

郑浩然; 张海模; 崔霆; 杜晓强

doi:10.3724/SP.J.1146.2008.00528

一种新的正形置换构造方法

doi: 10.3724/SP.J.1146.2008.00528

郑浩然^{①;张海模},
张海模,
崔霆,
杜晓强

计量
- 文章访问数: 3864
- HTML全文浏览量: 108
- PDF下载量: 909
- 被引次数: 0
出版历程
- 收稿日期: 2008-04-28
- 修回日期: 2008-11-24
- 刊出日期: 2009-06-19

A New Method for Construction of Orthomorphic Permutations

摘要

摘要: 正形置换在密码体制设计中应用广泛。该文基于正形置换和正形拉丁方截集的一一对应关系，研究了正形置换的构造问题，给出了由n元正形置换构造n+1元正形置换的新方法，该方法利用正形拉丁方An的一个截集及其补序截集，扩展得到正形拉丁方An+1的一个复合截集，并由此构造出正形拉丁方An+1的截集。证明了按这种方法由任一n元正形置换可以构造出22n个n+1元正形置换。
- 密码学;正形置换;正形拉丁方;截集;复合截集
Abstract: Orthomorphic permutations have important application in the design of cryptosystems. Based on the one-to-one corresponding relationship between orthomorphic permutations and transversals of orthomorphic Latin square, the construction issue for orthomorphic permutations is studied, a new construction method is proposed to construct a (n+1)-bit orthomorphic permutation from a n-bit one where n＞1. The method extends to obtain a composite transversal of orthomorphic Latin square An+1 by employing a transversal of orthomorphic Latin square An and its supplementary sequence transversal, based on composite transversal of , An+1 transversal of An+1 is constructed. Using the method, 22n (n+1)-bit orthomorphic permutations from a n-bit one can be obtained.

HTML全文

参考文献(1)

Mittenthal L. Block substitutions using orthomorphicmappings[J].Advances in Applied Mathematics.1995, 16(1):59-71[2]Dai Zong-duo and Golomb S W. Generating all linearorthomorphisms without repetition[J].Discrete Mathematics.1999, 205(1-3):47-55[3]Huang Gen-xun and Zhu Yue-fei. The lower bound for thenumbers of orthomorphic permutations and a method toconstruct Them[C]. Proceeding of China Crypt2000, Beijing,2000: 27-30.[4]温巧燕, 钮心忻, 杨义先. 现代密码学中的布尔函数[M]. 北京: 科学出版社, 2000: 178-181.Wen Qiao-yan, Niu Xin-xin, and Yang Yi-xian. BooleanFunctions in Modern Cryptography[M]. Beijing: SciencePress, 2000: 178-181.[5]王鹏. 正形置换的一种构造方法[J]. 中南民族学院学报(自然科学版), 2001, 20(1): 50-53.Wang Peng. A method for construction of orthomorphicpermutation[J]. Journal of South-Central University forNationalities(Nat. Sci.), 2001, 20(1): 50-53.[6]李志慧, 李瑞虎, 李学良. 正形置换的构造[J]. 陕西师范大学学报(自然科学版), 2002, 30(4): 18-22.Li Zhi-hui, Li Rui-hu, and Li Xue-1iang. Construction oforthomorphic permutations[J]. Journal of Shanxi NormalUniversity (Natura1 Science Edition), 2002, 30(4): 18-22.[7]亢保元. 密码体制中的正形置换的构造与记数[J].电子与信息学报.2002, 24(9):1294-1296浏览[8]朱华安, 谢端强. 关于密码体制中正形置换的几个结果[J]. 应用科学学报, 2004, 22(2): 132-135.Zhu Hua-an and Xie Duan-qiang. On the construction oforthomorphic permutations in cryptosystems. Journal ofApplied Sciences, 2004, 22(2): 132-135.[9]Harald N and Arne W. Cyclotomic R-orthomorphisms offinite fields[J].Discrete Mathematics.2005, 295(1-3):161-171[10]Zhao Ya-qun and Wang Jue. Walsh spectral characteristicsand the auto-correlation function characteristics of formingorthomor- phic permutations of multi-output functions[J].Wuhan University Journal of Natural Sciences.2006, 11(6):1895-1898[11]常祖领, 柯品惠, 莫骄, 温巧燕. F2n 上的正形置换[J]. 北京邮电大学学报, 2006, 29(1): 115-118.Chang Zu-ling, Ke Pin-hui, Mo Jiao, and Wen Qiao-yan. Onorthomorphisms over F2n[J]. Journal of Beijing University ofPosts and Telecommunications, 2006, 29(1): 115-118.[12]任金萍, 吕述望. 正形置换的枚举与计数[J]. 计算机研究与发展, 2006, 43(6): 1071-1075.Ren Jin-ping and L Shu-wang. Enumerations and countingof orthomorphic permutations[J]. Journal of ComputerResearch and Development, 2006, 43(6): 1071-1075.[13]徐海波, 刘海蛟, 荆继武, 杜皎. 一种正形置换的逐位递增构造方法[J]. 中国科学院研究生院学报, 2006, 23(2): 251-256.Xu Hai-bo, Liu Hai-Jiao, Jing Ji-wu, and Du Jiao. Generatingorthomorphisms bit by bit[J]. Journal of the Graduate Schoolof the Chinese Academy of Sciences, 2006, 23(2): 251-256.[14]周建钦. 关于正形置换的构造[J]. 华中科技大学学报(自然科学版), 2007, 35(2): 40-42.Zhou Jian-qin. On the construction of orthomorphicpermutations[J]. J. Huazhong Univ. of Sci. Tech. (NatureScience Edition), 2007, 35(2): 40-42.

施引文献

资源附件(0)

访问统计