Success probability of the Hellman trade-off

DOI10.1016/J.IPL.2008.12.002MaRDI QIDQ976114zbMATH OpenOpenAlexFDO

Authors Daegun Ma, Jin Hong

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.12.002

zbMATH Keywords

analysis of algorithmscryptographyHellman tabletime memory trade-off

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Nonnumerical algorithms (68W05)

Recommendations

• Winning Rate in the Full-Information Best-Choice Problem
• Game-theoretic probability
• The game-theoretic framework for probability
• Probabilities within optimal strategies for tournament games
• Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin
• On the optimality of the uniform random strategy
• Probabilistic choice and stochastic dominance

Cites work

• scientific article; zbMATH DE number 3915608 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• A cryptanalytic time-memory trade-off
• Advances in Cryptology - CRYPTO 2003
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs

Cited in

(8)

• 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 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 the limiting mean values in probabilistic models of time-memory-data tradeoff methods
• Limit theorem for the size of an image of subset under compositions of random mappings
• On the sets of images of \(k\)-fold iteration of uniform random mapping
• A comparison of cryptanalytic tradeoff algorithms

This page was built for publication: Success probability of the Hellman trade-off

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