A cryptanalytic time-memory trade-off
From MaRDI portal
Publication:3877553
DOI10.1109/TIT.1980.1056220zbMATH Open0436.94016WikidataQ29036614 ScholiaQ29036614MaRDI QIDQ3877553FDOQ3877553
Authors: Martin Edward Hellman 
Publication date: 1980
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Cited In (only showing first 100 items - show all)
- The higher-order meet-in-the-middle attack and its application to the Camellia block cipher
- An analysis of chain characteristics in the cryptanalytic TMTO method
- Optimal indexes for sparse bit vectors
- Succinct representations of permutations and functions
- Success probability of the Hellman trade-off
- Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
- Random oracles and non-uniformity
- Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers
- New proofs for NMAC and HMAC: security without collision resistance
- Flatness and structural analysis as a constructive framework for private communication
- Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- Improving implementable meet-in-the-middle attacks by orders of magnitude
- A new algorithm for the unbalanced meet-in-the-middle problem
- Security analysis of \textsc{Prince}
- Estimates of the mean size of the subset image under composition of random mappings
- A practical attack on KeeLoq
- The full cost of cryptanalytic attacks
- 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
- The Hash Function Family LAKE
- Bootstrapping for approximate homomorphic encryption
- Efficient dissection of bicomposite problems with cryptanalytic applications
- The cost of false alarms in Hellman and rainbow tradeoffs
- Practical cryptanalysis of full Sprout with TMD tradeoff attacks
- Generic cryptographic weakness of \(k\)-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128
- Differential cryptanalysis of DES-like cryptosystems
- A Meet-in-the-Middle Attack on 8-Round AES
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- DES-GENERATED CHECKSUMS FOR ELECTRONIC SIGNATURES
- Multi-key security: the Even-Mansour construction revisited
- Internal state recovery of Espresso stream cipher using conditional sampling resistance and TMDTO attack
- Probability to meet in the middle
- An approach for stream ciphers design based on joint computing over random and secret data
- Key recovery attacks on iterated Even-Mansour encryption schemes
- The memory-tightness of authenticated encryption
- Ranks of ideals in inverse semigroups of difunctional binary relations
- Improved Time-Memory Trade-Offs with Multiple Data
- Mathematical problems in cryptology
- Cryptanalysis of MDC-2
- Title not available (Why is that?)
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- A new decryption failure attack against HQC
- New second-preimage attacks on hash functions
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Tradeoff Cryptanalysis of Memory-Hard Functions
- On the limiting mean values in probabilistic models of time-memory-data tradeoff methods
- Improved Meet-in-the-Middle Attacks on Reduced-Round DES
- Provable security against generic attacks on stream ciphers
- Title not available (Why is that?)
- Collisions and incidence of vertices and components in the graph of \(k\)-fold iteration of the uniform random mapping
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- Title not available (Why is that?)
- The symbiosis between collision and preimage resistance
- Another look at tightness
- Trade-offs between communication throughput and parallel time
- Limit theorem for the size of an image of subset under compositions of random mappings
- On parallel computations in implementation of the meat-in-the-middle attack
- On the sets of images of \(k\)-fold iteration of uniform random mapping
- Espresso: a stream cipher for 5G wireless communication systems
- Title not available (Why is that?)
- A comparison of cryptanalytic tradeoff algorithms
- Исследование сложности метода радужных таблиц с маркерами цепочек
- A Practical Attack on KeeLoq
- Proofs of space
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- Loiss: A Byte-Oriented Stream Cipher
- Generic Attacks on Symmetric Ciphers
- Solving discrete logarithm problems faster with the aid of pre-computation
- On building fine-grained one-way functions from strong average-case hardness
- Non-uniformity and quantum advice in the quantum random oracle model
- Comparison of perfect table cryptanalytic tradeoff algorithms
- Revisiting time-space tradeoffs for function inversion
- The query-complexity of preprocessing attacks
- Square reflection cryptanalysis of 5-round Feistel networks with permutations
- Quantum time/memory/data tradeoff attacks
- A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a
- Title not available (Why is that?)
- Analysis of the perfect table fuzzy rainbow tradeoff
- Optimizing a password hashing function with hardware-accelerated symmetric encryption
- On time-space lower bounds for finding short collisions in sponge hash functions
- Title not available (Why is that?)
- A highly secure stream cipher based on analog-digital hybrid chaotic system
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Panther: a sponge based lightweight authenticated encryption scheme
- Time/memory/data tradeoffs for variants of the RSA problem
- Analysis of the Parallel Distinguished Point Tradeoff
- 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 cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
- Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
- On the mean value of the total length of chains computed during the additional checkings in the tradeoff method with distinguished points
- Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
- Time-memory trade-off attack on the GSM A5/1 stream cipher using commodity GPGPU (extended abstract)
- Title not available (Why is that?)
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
- Title not available (Why is that?)
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)
