Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428146
DOI10.1007/b11817zbMath1122.94393OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428146
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Related Items (43)
The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 ⋮ Comparison of perfect table cryptanalytic tradeoff algorithms ⋮ DAHash: distribution aware tuning of password hashing costs ⋮ Random oracles and non-uniformity ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Analysis of Rainbow Tables with Fingerprints ⋮ О среднем значении суммарной длины цепочек, вычисляемых при дополнительных проверках в методе балансировки с особыми точками ⋮ The function-inversion problem: barriers and opportunities ⋮ A comparison of cryptanalytic tradeoff algorithms ⋮ An analysis of chain characteristics in the cryptanalytic TMTO method ⋮ Optimal retrieval in puzzle‐based storage with heuristic search and tabulation ⋮ 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 ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ The query-complexity of preprocessing attacks ⋮ Quantum time/memory/data tradeoff attacks ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ The cost of false alarms in Hellman and rainbow tradeoffs ⋮ On estimations of distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping ⋮ 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 ⋮ Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers ⋮ Success probability of the Hellman trade-off ⋮ New Distinguishers Based on Random Mappings against Stream Ciphers ⋮ Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU ⋮ 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 ⋮ Password hashing and preprocessing ⋮ Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2 ⋮ Analysis of the Parallel Distinguished Point Tradeoff ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Analysis of the perfect table fuzzy rainbow tradeoff ⋮ Model-Based Security Engineering: Managed Co-evolution of Security Knowledge and Software Models ⋮ Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
This page was built for publication: Advances in Cryptology - CRYPTO 2003
