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.
Pseudorandom Permutation
Pagnutti, S.;
2002-05-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
