Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1996)
Optimization of time-memory trade-o cryptanalysis and its application to DES
John McSweeney, B. Pittel (2008)
Expected coalescence time for a nonuniform allocation processAdvances in Applied Probability, 40
M. Hellman (1980)
A cryptanalytic time-memory trade-offIEEE Trans. Inf. Theory, 26
Avinash Dalal, E. Schmutz (2002)
Compositions of Random Functions on a Finite SetElectron. J. Comb., 9
(1978)
Random allocations
P. Oechslin (2003)
Making a Faster Cryptanalytic Time-Memory Trade-Off
B. Harris (1960)
PROBABILITY DISTRIBUTIONS RELATED TO RANDOM MAPPINGSAnnals of Mathematical Statistics, 31
(1990)
Randommapping statistics
A. Zubkov, O. Shibanov (2009)
Time required to unify all particles in the scheme of equiprobable allocation into a sequence of cell layersMathematical Notes, 85
(2014)
Estimation of the characteristics of time-memory-data tradeo methods via generating functions of the number of particles and the total number of particles in the Galton-Watson process”,Mat
H. Rubin, R. Sitgreaves (1954)
PROBABILITY DISTRIBUTIONS RELATED TO RANDOM TRANSFORMATIONS OF A FINITE SET
Gil McVean
The coalescent
V. Stepanov (1969)
On the Distribution of the Number of Vertices in Strata of a Random TreeTheory of Probability and Its Applications, 14
Daegun Ma, Jin Hong (2009)
Success probability of the Hellman trade-offInf. Process. Lett., 109
Abstract Let N be a set of N elements and F 1 , F 2 ,... be a sequence of random independent equiprobable mappings N → N. For a subset S 0 ⊂ N, |S 0 | = n, we consider a sequence of its images S k = F k (. . . F 2 (F 1 (S 0 )) . . .), k = 1, 2... , and a sequence of their unions Ψ k = S 1 ⋃ ... ⋃ S k , k = 1, 2 ... An approach to the exact computation of distribution of |S k | and |Ψ k | for moderate values of N is described. Two-sided inequalities for M|S k | and M|Ψ k | such that upper bound are asymptotically equivalent to lower ones for N, n, k → ∞, nk = o(N) are derived. The results are of interest for the analysis of time-memory tradeoff algorithms.
Discrete Mathematics and Applications – de Gruyter
Published: Jun 1, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.