Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества

DOI10.4213/MVK217MaRDI QIDQ3381869zbMATH OpenOpenAlexFDO

Authors D. V. Pilshchikov

Publication date 20 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk217

zbMATH Keywords

Hellman methodimage of random setpreimage cardinalitytime memory tradeoff with distiguished points

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3956091
• Images of subset of finite set under iterations of random mappings
• Images of a finite set under iterations of two random dependent mappings
• scientific article; zbMATH DE number 747042
• On the sets of images of k-fold iteration of uniform random mapping
• Limit theorem for the size of an image of subset under compositions of random mappings
• scientific article; zbMATH DE number 3994629
• Random set-mappings and separability of compacta
• On images and pre-images in a graph of the composition of independent uniform random mappings
• Random mappings of sets with restrictions on parameters. II

Cites work

• A comparison of cryptanalytic tradeoff algorithms
• A cryptanalytic time-memory trade-off
• Advances in Cryptology - CRYPTO 2003
• Computer system security. Basic concepts and solved exercises.
• scientific article; zbMATH DE number 1979312 (Why is no real title available?)
• On the limiting mean values in probabilistic models of time-memory-data tradeoff methods
• The cost of false alarms in Hellman and rainbow tradeoffs

Cited in

(12)

• Estimates of the mean size of the subset image under composition of random mappings
• Collisions and incidence of vertices and components in the graph of k-fold iteration of the uniform random mapping
• Images of subset of finite set under iterations of random mappings
• 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
• On a probabilistic approach to the estimation of reliability of the Hellman method
• Distribution of the length of aperiodicity segment in the graph of independent uniform random mappings composition
• On estimations of 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
• On the limiting mean values in probabilistic models of time-memory-data tradeoff methods
• Statistically equivalent mappings of finite sets

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 Q3381869)