scientific article; zbMATH DE number 16479
From MaRDI portal
Publication:3973158
Recommendations
Cited in
(95)- Efficient computation of the iteration of functions
- Modified binomial and Poisson distributions with applications in random mapping theory
- Automatic average-case analysis of algorithms
- Shadowing and iterative interpolation for Čebyšev mixing transformations
- Large deviations of combinatorial distributions. II: Local limit theorems
- A calculus for the random generation of labelled combinatorial structures
- On the number of predecessors in constrained random mappings
- Largest component in random combinatorial structures
- Analysis of a randomized rendezvous algorithm
- A model for roundoff and collapse in computation of chaotic dynamical systems
- The asymptotic distribution of the diameter of a random mapping
- Improved generic attacks against hash-based MACs and HAIFA
- The graph structure of Chebyshev polynomials over finite fields and applications
- 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
- On the rank and periodic rank of finite dynamical systems
- On Ramanujan's Q-function
- An iterative construction of irreducible polynomials reducible modulo every prime
- The cost of false alarms in Hellman and rainbow tradeoffs
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- A probabilistic approach to value sets of polynomials over finite fields
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- Cycle structure of random parking functions
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- The component counts of random functions
- Periodic points and tail lengths of split polynomial maps modulo primes
- Unicyclic strong permutations
- Generic attacks on hash combiners
- Rationalizable strategies in random games
- Solving discrete logarithm problems faster with the aid of pre-computation
- The maximal length of 2-path in random critical graphs
- Mod-\(\phi\) convergence: approximation of discrete measures and harmonic analysis on the torus
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?
- Statistical maps. I: Basic properties
- On the heuristic of approximating polynomials over finite fields by random mappings
- Euler's constant: Euler's work and modern developments
- Random mappings with restricted preimages
- Random deterministic automata
- Images of a finite set under iterations of two random dependent mappings
- On moment sequences and mixed Poisson distributions
- Key recovery attacks on iterated Even-Mansour encryption schemes
- Approximations of mappings
- scientific article; zbMATH DE number 4213096 (Why is no real title available?)
- Distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping
- On the sets of images of k-fold iteration of uniform random mapping
- Layers of the graph of k-fold iteration of the uniform random mapping
- Distribution of the length of aperiodicity segment in the graph of independent uniform random mappings composition
- Слои в графе композиции независимых равновероятных случайных отображений
- Statistical maps: A categorical approach
- On the random mapping statistics
- Improving implementable meet-in-the-middle attacks by orders of magnitude
- Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
- Random mappings with exchangeable in-degrees
- On the length of critical orbits of stable quadratic polynomials
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More
- A comparison of cryptanalytic tradeoff algorithms
- Structural transition in random mappings
- Numeration and discrete dynamical systems
- Accelerating Pollard's rho algorithm on finite fields
- Iteration entropy
- Key recovery attack against 2.5-round -Cipher
- Computation of distributions of the numbers of components and cyclic points for random mappings
- Random mappings of sets with restrictions on parameters. I
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- Periodic points of polynomials over finite fields
- 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
- Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications
- Analytic analysis of algorithms
- Expected Maximum Block Size in Critical Random Graphs
- On functional graphs of quadratic polynomials
- Current trends and open problems in arithmetic dynamics
- Periods of iterated rational functions
- Factorial moments for random mappings by means of indicator variables
- Scaling Laws of Associative Memory Retrieval
- Local properties of random mappings with exchangeable in-degrees
- Uniform asymptotics of some Abel sums arising in coding theory
- Parallel random number generator for inexpensive configurable hardware cells
- Generic attack on duplex-based AEAD modes using random function statistics
- Finding many collisions via reusable quantum walks. Application to lattice sieving
- On the distribution of cycle lengths in the graph of k-multiple iteration of the uniform random substitution
- On the deepest cycle of a random mapping
- Random maps with sociological flavor
- Iterated monodromy groups of rational functions and periodic points over finite fields
- Improving generic attacks using exceptional functions
- Fixed points and cycles of parking functions
- Quantum time-space tradeoff for finding multiple collision pairs
- Asynchronous dynamics of isomorphic Boolean networks
- There is no prime functional digraph: Seifert's proof revisited
- Runs in labelled trees and mappings
- On random mapping patterns
- Low-gate quantum golden collision finding
- Statistically equivalent mappings of finite sets
- Functional graphs of polynomials over finite fields
- Success probability of the Hellman trade-off
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973158)
