Pseudorandom permutation

Authors:
A. De Matteis;S. Pagnutti
Affiliations:
ENEA, Divisione Fisica Applicata, Centro Ricerche Bologna, Via Don Fiammelli 2, I-40129 Bologna, Italy;ENEA, Divisione Fisica Applicata, Centro Ricerche Bologna, Via Don Fiammelli 2, I-40129 Bologna, Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2002

Citing 7
Cited 0

Parallelization of random number generators and long-range correlations

Numerische Mathematik
Controlling correlations in parallel Monte Carlo

Parallel Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A New Pseudo-Random Number Generator

Journal of the ACM (JACM)
Notes on a New Pseudo-Random Number Generator

Journal of the ACM (JACM)
Permutation Generation Methods

ACM Computing Surveys (CSUR)
Algorithm 235: Random permutation

Communications of the ACM

Quantified Score

Hi-index	7.29

Visualization

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.