Estimates of the mean size of the subset image under composition of random mappings

DOI10.1515/DMA-2018-0029MaRDI QIDQ1741464zbMATH OpenOpenAlexFDO

Authors A. M. Zubkov, A. A. Serov

Publication date 3 May 2019

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2018-0029

zbMATH Keywords

compositions of random mappingstime-memory tradeoff method

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Central limit and other weak theorems (60F05)

Recommendations

• Images of subset of finite set under iterations of random mappings
• Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества
• Limit theorem for the size of an image of subset under compositions of random mappings
• Images of a finite set under iterations of two random dependent mappings
• scientific article; zbMATH DE number 16479

Cites work

• A comparison of cryptanalytic tradeoff algorithms
• A cryptanalytic time-memory trade-off
• Advances in Cryptology - CRYPTO 2003
• Distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping
• Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton-Watson process
• scientific article; zbMATH DE number 3727274 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 1199736 (Why is no real title available?)
• scientific article; zbMATH DE number 1235881 (Why is no real title available?)
• scientific article; zbMATH DE number 3026527 (Why is no real title available?)
• Images of a finite set under iterations of two random dependent mappings
• Images of subset of finite set under iterations of random mappings
• Limit theorem for the size of an image of subset under compositions of random mappings
• The cost of false alarms in Hellman and rainbow tradeoffs

Cited in

(6)

• Limit theorem for the size of an image of subset under compositions of random mappings
• Collisions and incidence of vertices and components in 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
• Слои в графе композиции независимых равновероятных случайных отображений
• On images and pre-images in a graph of the composition of independent uniform random mappings
• Chair of Mathematical Statistics and Random Processes

This page was built for publication: Estimates of the mean size of the subset image under composition of random mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741464)