密碼體制中的正形置換的構造與記數(shù)
Constructions and enumerations of orthomorphic permutations in cryptosystems
-
摘要: 正形置換在密碼體制中有重要應用,該文在前人工作的基礎上,利用有限群的理論對正形置換的構造和記數(shù)問題進行了討論,特別在正形置換的記數(shù)方面得到了有價值的結果。
-
關鍵詞:
- 密碼體制; 置換; 有限群
Abstract: Orthornorphic permutations have good charateristic in cryptosystems.In this paper, by using of knowledge about finite group to investigate the constructions and enumerations of orthormophic permutations, several results are obtained. -
L. Mittenthal, Block substitutions using orthomorphic mapping.[J]. Advances in Applied Mathematics.1995,16:59-[2]Z. Liu, C. Shu, D. Ye, A method for constructing orthomorphic Permutations of Degree 2m,China Crypt96, Zhengzhou, 1996, 4, 56-59.[3]邢育森,林曉東,楊義先,楊放春,密碼體制中正形置換的構造與記數(shù),通信學報,1999,20(2),27-30.[4]馮登國,劉振華,關于正形置換的構造,通信保密,1996,66(2),61-64.[5]廖勇,盧起駿,仿射正形置換的構造與記數(shù),密碼與信息,1996,(2),23-25.[6]亢保元,王育民,正形置換與正形拉丁方的兩個結果,西安電子科技大學學報,1997,24(3),421-424.[7]亢保元,王育民,線性置換與正形置換,西安電子科技大學學報,1998,25(2),254-256.[8]高等代數(shù)(第二版),北京大學數(shù)學系幾何與代數(shù)教研室代數(shù)小組編,北京,高等教育出版社,1988. -
計量
- 文章訪問數(shù): 2261
- HTML全文瀏覽量: 123
- PDF下載量: 516
- 被引次數(shù): 0