2006Journal of CommunicationsRequires access

Probability problems on random permutation

LI Shi-qu

Open publisher page 0 citations

Abstract

Based on selecting permutations on 0,1,…n?1randomly,a probability model were built.In sense of selecting permutations randomly,the distribution of distance which was between one point and its neighbor in Zn(called distance for short)and the mathematic expectation,the variance of number of the points with distance a(1≤a≤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.

About this research paper

What this paper is about

Based on selecting permutations on 0,1,…n?1randomly,a probability model were built.In sense of selecting permutations randomly,the distribution of distance which was between one point and its neighbor in Zn(called distance for short)and the mathematic expectation,the variance of number of the points with distance a(1≤a≤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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Based on selecting permutations on 0,1,…n?1randomly,a probability model were built.In sense of selecting permutations randomly,the distribution of distance which was between one point and its neighbor in Zn(called distance for short)and the mathematic expectation,the variance of number of the points with distance a(1≤a≤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.

Key concepts: Random permutation, Permutation (music), Mathematics, Pseudorandom permutation, Combinatorics, Cryptography, Point (geometry), Derangement

Related papers

Back to paper searchBrowse research topicsOriginal source
Probability problems on random permutation — Research Paper | ScholarLens