A cryptanalytic time-memory trade-off

DOI10.1109/TIT.1980.1056220MaRDI QIDQ3877553zbMATH OpenWikidataFDO

Authors Martin Edward Hellman

Publication date 1980

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1980.1056220

zbMATH Keywords

cryptanalytic time-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1941130
• scientific article; zbMATH DE number 1979312
• Differential cryptanalysis of DES-like cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Time-memory-processor trade-offs

Cited in

(only showing first 100 items - show all)

• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
• Ranks of ideals in inverse semigroups of difunctional binary relations
• Random oracles and non-uniformity
• Bootstrapping for approximate homomorphic encryption
• Flatness and structural analysis as a constructive framework for private communication
• 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
• How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
• The full cost of cryptanalytic attacks
• Mathematical problems in cryptology
• The cost of false alarms in Hellman and rainbow tradeoffs
• Efficient dissection of bicomposite problems with cryptanalytic applications
• Internal state recovery of Espresso stream cipher using conditional sampling resistance and TMDTO attack
• Collisions and incidence of vertices and components in the graph of k-fold iteration of the uniform random mapping
• Tight time-space lower bounds for finding multiple collision pairs and their applications
• The memory-tightness of authenticated encryption
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a
• On building fine-grained one-way functions from strong average-case hardness
• The function-inversion problem: barriers and opportunities
• Generic attacks on hash combiners
• Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
• Tight time-memory trade-offs for symmetric encryption
• Solving discrete logarithm problems faster with the aid of pre-computation
• Analysis of the perfect table fuzzy rainbow tradeoff
• Optimizing a password hashing function with hardware-accelerated symmetric encryption
• An approach for stream ciphers design based on joint computing over random and secret data
• Generic cryptographic weakness of k-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128
• The higher-order meet-in-the-middle attack and its application to the Camellia block cipher
• Square reflection cryptanalysis of 5-round Feistel networks with permutations
• Comparison of perfect table cryptanalytic tradeoff algorithms
• A new decryption failure attack against HQC
• Unifying presampling via concentration bounds
• scientific article; zbMATH DE number 1583765 (Why is no real title available?)
• scientific article; zbMATH DE number 1618047 (Why is no real title available?)
• Time-memory trade-off attack on the GSM A5/1 stream cipher using commodity GPGPU (extended abstract)
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Practical cryptanalysis of full Sprout with TMD tradeoff attacks
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• DES collisions revisited
• Another look at tightness
• Security analysis of \textsc{Prince}
• A new algorithm for the unbalanced meet-in-the-middle problem
• Loiss: A Byte-Oriented Stream Cipher
• The symbiosis between collision and preimage resistance
• Analysis of the Parallel Distinguished Point Tradeoff
• Analysis of rainbow tables with fingerprints
• New second-preimage attacks on hash functions
• Key recovery attacks on iterated Even-Mansour encryption schemes
• Key agreement schemes based on linear groupoids
• Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества
• 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
• Application of non-associative structures to the construction of public key distribution algorithms
• 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
• Improving implementable meet-in-the-middle attacks by orders of magnitude
• Cryptanalysis of the ``Kindle cipher
• Proofs of space
• Multi-key security: the Even-Mansour construction revisited
• Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
• The Hash Function Family LAKE
• A Meet-in-the-Middle Attack on 8-Round AES
• New Distinguishers Based on Random Mappings against Stream Ciphers
• Cryptanalysis of MDC-2
• DES-GENERATED CHECKSUMS FOR ELECTRONIC SIGNATURES
• scientific article; zbMATH DE number 4072862 (Why is no real title available?)
• A comparison of cryptanalytic tradeoff algorithms
• scientific article; zbMATH DE number 4087589 (Why is no real title available?)
• An analysis of chain characteristics in the cryptanalytic TMTO method
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• A practical attack on KeeLoq
• scientific article; zbMATH DE number 1303123 (Why is no real title available?)
• scientific article; zbMATH DE number 1304288 (Why is no real title available?)
• scientific article; zbMATH DE number 1941130 (Why is no real title available?)
• Succinct representations of permutations and functions
• scientific article; zbMATH DE number 1979312 (Why is no real title available?)
• Performance of symmetric ciphers and one-way hash functions
• scientific article; zbMATH DE number 1504796 (Why is no real title available?)
• Optimal indexes for sparse bit vectors
• Time/memory/data tradeoffs for variants of the RSA problem
• scientific article; zbMATH DE number 1406793 (Why is no real title available?)
• scientific article; zbMATH DE number 1440885 (Why is no real title available?)
• Impact factors involved in cryptoperiod computation in key compromise impersonation scenario
• Espresso: a stream cipher for 5G wireless communication systems
• On the mean value of the total length of chains computed during the additional checkings in the tradeoff method with distinguished points
• scientific article; zbMATH DE number 7301797 (Why is no real title available?)
• On parallel computations in implementation of the meat-in-the-middle attack
• 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
• On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• Generic Attacks on Symmetric Ciphers
• Improved Time-Memory Trade-Offs with Multiple Data
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• Improved Meet-in-the-Middle Attacks on Reduced-Round DES
• A Practical Attack on KeeLoq
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs

This page was built for publication: A cryptanalytic time-memory trade-off

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