Probabilistic analysis of elementary randomizers

Authors:
Josef Pieprzyk
Affiliations:
Department of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 3
Cited 0

How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
On the construction of a random number generator and random function generators

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
How to construct pseudorandom permutations from single pseudorandom functions

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, elementary randomizers based on random functions and the DES structure are examined. First, it is proved that the randomizer with three different random functions produces the outputs which are independent and uniformly distributed random variables. Next, randomizers based on two different random functions are considered and it is shown that their statistical properties depend upon the order of the functions used in them. Finally, it is proved that the randomizer with a single random function gives outputs which are statistically related.