Pseudorandom permutation

摘要

A number-theoretical approach to the permutation of a sequence of objects performed by means of a linear congruential generator of pseudorandom numbers is presented. A sufficient condition is found for obtaining permutations with the property that each object definitely abandons its initial position. Since cryptography is among the possible applications, the generator performing the inverse transformation is also given.