A general result is proved for constructions which use a pseudo-random function (PRF) with a “small” domain to build a PRF with a “large” domain. This result is used to analyse a new block-cipher ...

In contrast to [7,17], by introducing slightly stronger definitions of random attractor and repeller, we characterize attractor–repeller pair decompositions and Morse decompositions for random ...