AbstractA 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
Nonlinear congruential methods are attractive alternatives to the classical linear congruential meth...
We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash funct...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
AbstractIn this paper, we consider one of the two open problems proposed by Pieprzyk [1], i.e., whet...
AbstractFour round Feistel permutation (like DES) is super-pseudorandom if each round function is ra...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Abstract We show how to construct pseudo-random permutations that satisfy a certain cycle restrictio...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
A fresh look at the question of randomness was taken in the theory of computing: A distribution is p...
Abstract. In the cryptographic system a pseudorandom number generator is one of the basic primitives...
We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash funct...
are one of the fundamental primitives for cryptographic protocol design. Most importantly, they prov...
International audienceA secure pseudo-random number generator three-mixer is proposed. The principle...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Nonlinear congruential methods are attractive alternatives to the classical linear congruential meth...
We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash funct...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
AbstractIn this paper, we consider one of the two open problems proposed by Pieprzyk [1], i.e., whet...
AbstractFour round Feistel permutation (like DES) is super-pseudorandom if each round function is ra...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Abstract We show how to construct pseudo-random permutations that satisfy a certain cycle restrictio...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
A fresh look at the question of randomness was taken in the theory of computing: A distribution is p...
Abstract. In the cryptographic system a pseudorandom number generator is one of the basic primitives...
We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash funct...
are one of the fundamental primitives for cryptographic protocol design. Most importantly, they prov...
International audienceA secure pseudo-random number generator three-mixer is proposed. The principle...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Nonlinear congruential methods are attractive alternatives to the classical linear congruential meth...
We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash funct...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
DOI
Add to ORKG