Parallel collision search with cryptanalytic applications
From MaRDI portal
Publication:1284011
DOI10.1007/PL00003816zbMath0992.94028OpenAlexW2008272678WikidataQ56388136 ScholiaQ56388136MaRDI QIDQ1284011
Michael J. Wiener, Paul C. van Oorschot
Publication date: 22 September 2002
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00003816
cryptanalysisdiscrete logarithmmeet-in-the-middle attackfinding collisionparallel collision searchPollard's rho-method
Related Items (only showing first 100 items - show all)
New algorithm for the elliptic curve discrete logarithm problem with auxiliary inputs ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Improvements to RSA key generation and CRT on embedded devices ⋮ On the cost of ASIC hardware crackers: a SHA-1 case study ⋮ Another Look at Tightness ⋮ Improving ECDLP Computation in Characteristic 2 ⋮ Reducing the Key Size of Rainbow Using Non-commutative Rings ⋮ The Supersingular Isogeny Problem in Genus 2 and Beyond ⋮ How to meet ternary LWE keys ⋮ Cryptanalysis of full LowMC and LowMC-M with algebraic techniques ⋮ The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 ⋮ On index calculus algorithms for subfield curves ⋮ Low-gate quantum golden collision finding ⋮ Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) ⋮ Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Nonlinearities in elliptic curve authentication ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach ⋮ A new approach for finding low-weight polynomial multiples ⋮ A new adaptive attack on SIDH ⋮ Cycle detection using a stack ⋮ Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox ⋮ Point counting on Picard curves in large characteristic ⋮ Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree ⋮ Improved algorithm for the isogeny problem for ordinary elliptic curves ⋮ On the Isogeny Problem with Torsion Point Information ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Time-Memory Trade-Offs for Near-Collisions ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Symmetric Hadamard matrices of order 116 and 172 exist ⋮ Generic attacks on hash combiners ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Improved generic attacks against hash-based MACs and HAIFA ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ Unnamed Item ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ New second preimage attacks on dithered hash functions with low memory complexity ⋮ Computing discrete logarithms with the parallelized kangaroo method. ⋮ B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion ⋮ Oblivious pseudorandom functions from isogenies ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Reduced memory meet-in-the-middle attack against the NTRU private key ⋮ Improved Pollard rho method for computing discrete logarithms over finite extension fields ⋮ On random walks for Pollard's rho method ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ Memoryless near-collisions via coding theory ⋮ A low-memory algorithm for finding short product representations in finite groups. ⋮ New results on quasi-subfield polynomials ⋮ Анализ сложности алгоритма параллельного поиска “золотой” коллизии ⋮ Computational hardness of IFP and ECDLP ⋮ Computing low-weight discrete logarithms ⋮ NTRU prime: reducing attack surface at low cost ⋮ Computing discrete logarithms in an interval ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Cycle detection algorithms and their applications ⋮ An algorithmic framework for the generalized birthday problem ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm ⋮ A low-memory algorithm for point counting on Picard curves ⋮ Cryptanalysis of MD2 ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Herding Hash Functions and the Nostradamus Attack ⋮ Keyed/Unkeyed RIPEMD-128, 192, 256 ⋮ The parallelized Pollard kangaroo method in real quadratic function fields ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Weil sum for birthday attack in multivariate quadratic cryptosystem ⋮ Algebraic approaches for solving isogeny problems of prime power degrees ⋮ Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Research on attacking a special elliptic curve discrete logarithm problem ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94 ⋮ A Meet-in-the-Middle Collision Attack Against the New FORK-256 ⋮ A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography ⋮ Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ The Latin squares and the secret sharing schemes ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ Improved classical cryptanalysis of SIKE in practice ⋮ Index calculus in class groups of non-hyperelliptic curves of genus three ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks ⋮ On Free-Start Collisions and Collisions for TIB3 ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ The GN-authenticated key agreement ⋮ Improving the parallelized Pollard lambda search on anomalous binary curves ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two ⋮ MaD0
This page was built for publication: Parallel collision search with cryptanalytic applications
