Analysis of efficient random permutations generation for security applications

摘要: In this paper, random permutation generation algorithms namely, Fisher-Yates algorithm, its variant Sattolo algorithm and Josephus are discussed. Both chaos non-chaos based approaches have been analyzed compared. Their efficiency has tested against three criteria: no ideally fixed points, un-separated pairs shift factor greater than one third the degree of permutation. A should successfully satisfy above criteria. Incorporating chaotic behavior increases randomness generated Chaotic maps used for key-dependent deterministic behavior. The ones attracting more attention as they produce less predictive permutations. slight change in input parameters prompt a significant resulting outcome thereby making it suitable security applications. performance test done on samples consisting 10000, 50000 100000 each sample, every individual (I) elements (II) 100,000 elements. experimental results demonstrate that chaos-based approach outperforms other generates efficient