The following pages link to Random mapping statistics (Q3973158):
Displaying 50 items.
- Images of a finite set under iterations of two random dependent mappings (Q314215) (← links)
- On moment sequences and mixed Poisson distributions (Q315389) (← links)
- Key recovery attacks on iterated Even-Mansour encryption schemes (Q321305) (← links)
- A comparison of cryptanalytic tradeoff algorithms (Q380959) (← links)
- Structural transition in random mappings (Q405093) (← links)
- Numeration and discrete dynamical systems (Q411444) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications (Q517716) (← links)
- Runs in labelled trees and mappings (Q776318) (← links)
- On random mapping patterns (Q788742) (← links)
- Low-gate quantum golden collision finding (Q832353) (← links)
- Statistically equivalent mappings of finite sets (Q891102) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- Success probability of the Hellman trade-off (Q976114) (← links)
- Efficient computation of the iteration of functions (Q1006085) (← links)
- Modified binomial and Poisson distributions with applications in random mapping theory (Q1110209) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Shadowing and iterative interpolation for Čebyšev mixing transformations (Q1201071) (← links)
- Large deviations of combinatorial distributions. II: Local limit theorems (Q1296622) (← links)
- A calculus for the random generation of labelled combinatorial structures (Q1334654) (← links)
- On the number of predecessors in constrained random mappings (Q1375862) (← links)
- Largest component in random combinatorial structures (Q1381824) (← links)
- Analysis of a randomized rendezvous algorithm (Q1398376) (← links)
- A model for roundoff and collapse in computation of chaotic dynamical systems (Q1404631) (← links)
- The asymptotic distribution of the diameter of a random mapping (Q1608730) (← links)
- Improved generic attacks against hash-based MACs and HAIFA (Q1688402) (← links)
- The graph structure of Chebyshev polynomials over finite fields and applications (Q1727357) (← links)
- Estimates of the mean size of the subset image under composition of random mappings (Q1741464) (← links)
- Limit theorem for the size of an image of subset under compositions of random mappings (Q1744358) (← links)
- On the rank and periodic rank of finite dynamical systems (Q1784274) (← links)
- On Ramanujan's \(Q\)-function (Q1894389) (← links)
- An iterative construction of irreducible polynomials reducible modulo every prime (Q1946103) (← links)
- The cost of false alarms in Hellman and rainbow tradeoffs (Q1960220) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- A probabilistic approach to value sets of polynomials over finite fields (Q2011489) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- Cycle structure of random parking functions (Q2111199) (← links)
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution (Q2119677) (← links)
- The component counts of random functions (Q2144523) (← links)
- Periodic points and tail lengths of split polynomial maps modulo primes (Q2163037) (← links)
- Unicyclic strong permutations (Q2179491) (← links)
- Generic attacks on hash combiners (Q2188959) (← links)
- Rationalizable strategies in random games (Q2278915) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- The maximal length of 2-path in random critical graphs (Q2336998) (← links)
- Mod-\(\phi\) convergence: approximation of discrete measures and harmonic analysis on the torus (Q2656655) (← links)
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (Q2670933) (← links)
- Statistical maps. I: Basic properties (Q2777542) (← links)
- On the heuristic of approximating polynomials over finite fields by random mappings (Q2828372) (← links)
- Euler's constant: Euler's work and modern developments (Q2849016) (← links)
