A cryptanalytic time-memory trade-off

DOI10.1109/TIT.1980.1056220zbMATH Open0436.94016WikidataQ29036614 ScholiaQ29036614MaRDI QIDQ3877553FDOQ3877553

Martin Edward Hellman

Publication date: 1980

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

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

zbMATH Keywords

cryptanalytic time-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60)

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
• Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества
• О множестве образов $k$-кратной итерации равновероятного случайного отображения
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• 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
• О предельных средних значениях в вероятностных моделях методов балансировки времени-памяти-данных
• The Hash Function Family LAKE
• Title not available (Why is that?)
• Bootstrapping for approximate homomorphic encryption
• Efficient dissection of bicomposite problems with cryptanalytic applications
• The cost of false alarms in Hellman and rainbow tradeoffs
• 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
• Proofs of Space
• 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
• A New Algorithm for the Unbalanced Meet-in-the-Middle Problem
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
• Security Analysis of PRINCE
• Mathematical problems in cryptology
• Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
• Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks
• 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.
• A new decryption failure attack against HQC
• New second-preimage attacks on hash functions
• Распределение длины отрезка апериодичности в графе $k$-кратной итерации случайного равновероятного отображения
• 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
• 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
• Tight time-space lower bounds for finding multiple collision pairs and their applications
• Multi-key Security: The Even-Mansour Construction Revisited
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Title not available (Why is that?)
• Tight time-memory trade-offs for symmetric encryption
• Trade-offs between communication throughput and parallel time
• Limit theorem for the size of an image of subset under compositions of random mappings
• Espresso: a stream cipher for 5G wireless communication systems
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Оценка характеристик методов балансировки времени-памяти-данных с помощью производящих функций числа частиц и общего числа частиц в процессе Гальтона - Ватсона
• Title not available (Why is that?)
• A comparison of cryptanalytic tradeoff algorithms
• Исследование сложности метода радужных таблиц с маркерами цепочек
• A Practical Attack on KeeLoq
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• Another Look at Tightness
• Loiss: A Byte-Oriented Stream Cipher
• The Symbiosis between Collision and Preimage Resistance
• О криптографических свойствах алгоритмов, сопутствующих применению стандартов ГОСТ Р 34.11-2012 и ГОСТ Р 34.10-2012
• О среднем значении суммарной длины цепочек, вычисляемых при дополнительных проверках в методе балансировки с особыми точками
• 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
• Схемы выработки общего ключа на основе линейных группоидов
• 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 Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU
• Analysis of the Parallel Distinguished Point Tradeoff
• Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
• 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?)
• On building fine-grained one-way functions from strong average-case hardness
• Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation

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)