A cryptanalytic time-memory trade-off
From MaRDI portal
Publication:3877553
DOI10.1109/TIT.1980.1056220zbMath0436.94016WikidataQ29036614 ScholiaQ29036614MaRDI QIDQ3877553
Publication date: 1980
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (95)
Another Look at Tightness ⋮ Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ Comparison of perfect table cryptanalytic tradeoff algorithms ⋮ Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude ⋮ Ranks of ideals in inverse semigroups of difunctional binary relations ⋮ Proofs of Space ⋮ Multi-key Security: The Even-Mansour Construction Revisited ⋮ New second-preimage attacks on hash functions ⋮ Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Random oracles and non-uniformity ⋮ Bootstrapping for approximate homomorphic encryption ⋮ An approach for stream ciphers design based on joint computing over random and secret data ⋮ Analysis of Rainbow Tables with Fingerprints ⋮ Is the data encryption standard a group? (Results of cycling experiments on DES) ⋮ Mathematical problems in cryptology ⋮ On building fine-grained one-way functions from strong average-case hardness ⋮ О среднем значении суммарной длины цепочек, вычисляемых при дополнительных проверках в методе балансировки с особыми точками ⋮ The function-inversion problem: barriers and opportunities ⋮ A comparison of cryptanalytic tradeoff algorithms ⋮ Security Analysis of PRINCE ⋮ An analysis of chain characteristics in the cryptanalytic TMTO method ⋮ Generic attacks on hash combiners ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation ⋮ Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ Some results on lightweight stream ciphers Fountain v1 \& lizard ⋮ Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Revisiting time-space tradeoffs for function inversion ⋮ The query-complexity of preprocessing attacks ⋮ Quantum time/memory/data tradeoff attacks ⋮ A highly secure stream cipher based on analog-digital hybrid chaotic system ⋮ Panther: a sponge based lightweight authenticated encryption scheme ⋮ New proofs for NMAC and HMAC: security without collision resistance ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård hash functions ⋮ A practical attack on KeeLoq ⋮ Provable security against generic attacks on stream ciphers ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions ⋮ A new decryption failure attack against HQC ⋮ Generic cryptographic weakness of \(k\)-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128 ⋮ Unifying presampling via concentration bounds ⋮ Succinct representations of permutations and functions ⋮ The higher-order meet-in-the-middle attack and its application to the Camellia block cipher ⋮ The Hash Function Family LAKE ⋮ A Meet-in-the-Middle Attack on 8-Round AES ⋮ The cost of false alarms in Hellman and rainbow tradeoffs ⋮ Square reflection cryptanalysis of 5-round Feistel networks with permutations ⋮ Optimal indexes for sparse bit vectors ⋮ Flatness and structural analysis as a constructive framework for private communication ⋮ Loiss: A Byte-Oriented Stream Cipher ⋮ Estimates of the mean size of the subset image under composition of random mappings ⋮ Оценка характеристик методов балансировки времени-памяти-данных с помощью производящих функций числа частиц и общего числа частиц в процессе Гальтона - Ватсона ⋮ О предельных средних значениях в вероятностных моделях методов балансировки времени-памяти-данных ⋮ О криптографических свойствах алгоритмов, сопутствующих применению стандартов ГОСТ Р 34.11-2012 и ГОСТ Р 34.10-2012 ⋮ Limit theorem for the size of an image of subset under compositions of random mappings ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers ⋮ Trade-offs between communication throughput and parallel time ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications ⋮ Success probability of the Hellman trade-off ⋮ New Distinguishers Based on Random Mappings against Stream Ciphers ⋮ Internal state recovery of espresso stream cipher using conditional sampling resistance and TMDTO attack ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU ⋮ Improved Meet-in-the-Middle Attacks on Reduced-Round DES ⋮ A Practical Attack on KeeLoq ⋮ Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks ⋮ Cryptanalysis of MDC-2 ⋮ Collisions and incidence of vertices and components in the graph of \(k\)-fold iteration of the uniform random mapping ⋮ Схемы выработки общего ключа на основе линейных группоидов ⋮ Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества ⋮ Распределение длины отрезка апериодичности в графе $k$-кратной итерации случайного равновероятного отображения ⋮ Исследование сложности метода радужных таблиц с маркерами цепочек ⋮ О множестве образов $k$-кратной итерации равновероятного случайного отображения ⋮ Использование неассоциативных структур для построения алгоритмов открытого распределения ключей ⋮ Об одном теоретико-вероятностном подходе к обоснованию надежности метода Хеллмана ⋮ Распределение длины отрезка апериодичности в графе композиции независимых равновероятных случайных отображений ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks ⋮ The Symbiosis between Collision and Preimage Resistance ⋮ Analysis of the Parallel Distinguished Point Tradeoff ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Unnamed Item ⋮ Analysis of the perfect table fuzzy rainbow tradeoff ⋮ Optimizing a password hashing function with hardware-accelerated symmetric encryption ⋮ Time-space tradeoffs and short collisions in Merkle-Damgård hash functions ⋮ How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps. ⋮ Differential cryptanalysis of DES-like cryptosystems ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited ⋮ A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a
This page was built for publication: A cryptanalytic time-memory trade-off
