密码学中的全距置换的研究  

On Quick Trickle Permutation Useful for Encipherment in Telecommunication

作　　者：亢保元[1] 王育民[2] 

机构地区：[1]西北工业大学 [2]西安电子科技大学

出　　处：《西北工业大学学报》1998年第4期550-553,共4页Journal of Northwestern Polytechnical University

摘　　要：证明了n为偶数时，n阶全距置换的存在性，进而将全距置换的研究等价为对全距排列的研究，并利用拉丁方给出了全距置换的一个构造方法。Keeping commercial telecommunication messages secret is increasingly important. Encipherment with quick trickle permutation is one way to do it. The existence of any quick trickle permutation to be used must be first proved and a method of its construction is needed. We prove the existence of a quick trickle permutation of order n, provided that n is even.Next, we show that quick trickle permutations are equivalent to quick trickle arrangements;then we apply the definition of quick trickle latin square to constructing quick trickle permutation.

关 键 词：全距置换 拉丁方 排列 密码学 

分 类 号：TN918.2[电子电信—通信与信息系统] O157.4[电子电信—信息与通信工程]