scientific article

Andrew M. Odlyzko, Philippe Flajolet

Publication date: 26 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

generating functions Random mappings diameter of a random mapping

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Related Items

One-dimensional cellular automata with random rules: longest temporal period of a periodic solution ⋮ A calculus for the random generation of labelled combinatorial structures ⋮ Low-gate quantum golden collision finding ⋮ Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude ⋮ On Ramanujan's $Q$-function ⋮ Images of a finite set under iterations of two random dependent mappings ⋮ The component counts of random functions ⋮ On moment sequences and mixed Poisson distributions ⋮ Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Random Deterministic Automata ⋮ Periodic points and tail lengths of split polynomial maps modulo primes ⋮ Mod-$\phi$ convergence: approximation of discrete measures and harmonic analysis on the torus ⋮ Periodic points of polynomials over finite fields ⋮ On the number of predecessors in constrained random mappings ⋮ Largest component in random combinatorial structures ⋮ A comparison of cryptanalytic tradeoff algorithms ⋮ Unicyclic strong permutations ⋮ Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? ⋮ Generic attacks on hash combiners ⋮ Unnamed Item ⋮ Improved generic attacks against hash-based MACs and HAIFA ⋮ Structural transition in random mappings ⋮ Generic attack on duplex-based AEAD modes using random function statistics ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Analysis of a randomized rendezvous algorithm ⋮ Functional graphs of polynomials over finite fields ⋮ Numeration and discrete dynamical systems ⋮ Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State ⋮ A model for roundoff and collapse in computation of chaotic dynamical systems ⋮ An iterative construction of irreducible polynomials reducible modulo every prime ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Random mappings with exchangeable in-degrees ⋮ Scaling Laws of Associative Memory Retrieval ⋮ The cost of false alarms in Hellman and rainbow tradeoffs ⋮ Local properties of random mappings with exchangeable in-degrees ⋮ Automatic average-case analysis of algorithms ⋮ The graph structure of Chebyshev polynomials over finite fields and applications ⋮ Iteration entropy ⋮ Approximations of Mappings ⋮ Key Recovery Attack Against 2.5-Round $$\pi $$ -Cipher ⋮ On estimations of distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping ⋮ ON IMAGES AND PRE-IMAGES IN A GRAPH OF THE COMPOSITION OF INDEPENDENT UNIFORM RANDOM MAPPINGS ⋮ Estimates of the mean size of the subset image under composition of random mappings ⋮ Limit theorem for the size of an image of subset under compositions of random mappings ⋮ Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Shadowing and iterative interpolation for Čebyšev mixing transformations ⋮ On the length of critical orbits of stable quadratic polynomials ⋮ A probabilistic approach to value sets of polynomials over finite fields ⋮ Success probability of the Hellman trade-off ⋮ Uniform asymptotics of some Abel sums arising in coding theory ⋮ Parallel random number generator for inexpensive configurable hardware cells ⋮ On the rank and periodic rank of finite dynamical systems ⋮ Rationalizable strategies in random games ⋮ Analytic analysis of algorithms ⋮ Вычисление распределений характеристик чисел компонент и циклических точек случайного отображения ⋮ Efficient computation of the iteration of functions ⋮ Распределение длины отрезка апериодичности в графе $k$-кратной итерации случайного равновероятного отображения ⋮ О множестве образов $k$-кратной итерации равновероятного случайного отображения ⋮ Слои в графе $k$-кратной итерации равновероятного случайного отображения ⋮ Распределение длины отрезка апериодичности в графе композиции независимых равновероятных случайных отображений ⋮ Слои в графе композиции независимых равновероятных случайных отображений ⋮ Expected Maximum Block Size in Critical Random Graphs ⋮ On Functional Graphs of Quadratic Polynomials ⋮ On the heuristic of approximating polynomials over finite fields by random mappings ⋮ Preimage Attacks on One-Block MD4, 63-Step MD5 and More ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Runs in labelled trees and mappings ⋮ Current trends and open problems in arithmetic dynamics ⋮ Euler’s constant: Euler’s work and modern developments ⋮ Large deviations of combinatorial distributions. II: Local limit theorems ⋮ The maximal length of 2-path in random critical graphs ⋮ Time-space tradeoffs and short collisions in Merkle-Damgård hash functions ⋮ Cycle structure of random parking functions ⋮ Periods of iterated rational functions ⋮ The asymptotic distribution of the diameter of a random mapping