随机置换的有关概率问题  

Probability problems on random permutation

作　　者：张志强[1] 曾本胜[1] 李世取[1] 

机构地区：[1]解放军信息工程大学信息工程学院信息研究系,河南郑州450002

出　　处：《通信学报》2006年第1期45-51,共7页Journal on Communications

基　　金：计算机网络与信息安全教育部重点实验室开放课题基金资助项目(20040108)~~

摘　　要：基于随机选取0,1,…n?1的置换建立了概率模型,求出了这种随机选取意义下置换后Zn中点与原相邻点之间距离(简称距离)的分布律以及距离为a(1≤a≤n?1)的点个数的数学期望与方差,当距离a和置换阶数n互素时,得到了距离为a的点个数的分布律。依据这些结论分析了随机置换的相关密码安全性问题,对在密码设计中采用全距置换的意义提供了新的解释。Based on selecting permutations on 0,1,…n-lrandomly, a probability model were built. In sense of selecting permutations randomly, the distribution of distance which was between one point and its neighbor in Z. （called distance for short） and the mathematic expectation, the variance of number of the points with distance α（l≤α≤n-1） were presented. When distance a and the permutation order n were prime to each other, the distribution of number of the points with distance a was also given. By these results, the cryptographic security of random permutation is analyzed, and a new explication is presented on the significance of choosing quick trickle permutation in cipher designs,

关 键 词：全距置换 概率分布 距离 随机置换 

分 类 号：TN918.1[电子电信—通信与信息系统]