Key Based Random Permutation (KBRP)
Shakir M. Hussain and Naim M. Ajlouni
DOI : 10.3844/jcssp.2006.419.421
Journal of Computer Science
Volume 2, Issue 5
This study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random permutation comes from the fact that the probability of getting this permutation is 1 out of N! possible permutations. Beside that, the permutation can not be guessed because of its generating method that is depending completely on a given key and size.
© 2006 Shakir M. Hussain and Naim M. Ajlouni. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.