Pages that link to "Item:Q1284011"
From MaRDI portal
The following pages link to Parallel collision search with cryptanalytic applications (Q1284011):
Displayed 38 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Memoryless near-collisions via coding theory (Q663464) (← links)
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- Cycle detection algorithms and their applications (Q690565) (← links)
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Index calculus in class groups of non-hyperelliptic curves of genus three (Q1021239) (← links)
- Computing discrete logarithms with the parallelized kangaroo method. (Q1408372) (← links)
- A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two (Q1607127) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- Cryptanalysis of MD2 (Q2267363) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Cycle detection using a stack (Q2390239) (← links)
- A low-memory algorithm for point counting on Picard curves (Q2491278) (← links)
- Cryptographic implications of Hess' generalized GHS attack (Q2502169) (← links)
- Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order (Q2505361) (← links)
- The GN-authenticated key agreement (Q2572038) (← links)
- On random walks for Pollard's rho method (Q2701566) (← links)
- Keyed/Unkeyed RIPEMD-128, 192, 256 (Q2780810) (← links)
- The parallelized Pollard kangaroo method in real quadratic function fields (Q2781226) (← links)
- Another Look at Tightness (Q2889878) (← links)
- Reducing the Key Size of Rainbow Using Non-commutative Rings (Q2889995) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
- The Latin squares and the secret sharing schemes (Q3085992) (← links)
- On Free-Start Collisions and Collisions for TIB3 (Q3399203) (← links)
- Herding Hash Functions and the Nostradamus Attack (Q3593096) (← links)
- Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
- Improving the parallelized Pollard lambda search on anomalous binary curves (Q4501048) (← links)
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree (Q4827599) (← links)
- Computing discrete logarithms in an interval (Q4912022) (← links)
- Point counting on Picard curves in large characteristic (Q5315429) (← links)
- Weil sum for birthday attack in multivariate quadratic cryptosystem (Q5443564) (← links)
- A Meet-in-the-Middle Collision Attack Against the New FORK-256 (Q5458197) (← links)
- A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography (Q5458200) (← links)