Results 1 
3 of
3
Random Mapping Statistics
 IN ADVANCES IN CRYPTOLOGY
, 1990
"... Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of ..."
Abstract

Cited by 101 (6 self)
 Add to MetaCart
Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis. In particular, an open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping. The same approach is applicable to a larger class of discrete combinatorial models and possibilities of automated analysis using symbolic manipulation systems ("computer algebra") are also briefly discussed.
On the Iteration of Certain Quadratic Maps over GF(p)
"... We consider the properties of certain graphs based on iteration of the quadratic maps x ! x and x ! x 2 over a finite field GF(p). ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We consider the properties of certain graphs based on iteration of the quadratic maps x ! x and x ! x 2 over a finite field GF(p).
On the iteration of certain quadratic maps over GF (p)
"... We consider the properties of certain graphs based on iteration of the quadratic maps x → x2 and x → x2 − 2 over a finite field GF (p). ..."
Abstract
 Add to MetaCart
(Show Context)
We consider the properties of certain graphs based on iteration of the quadratic maps x → x2 and x → x2 − 2 over a finite field GF (p).