Pages that link to "Item:Q1284011"
From MaRDI portal
The following pages link to Parallel collision search with cryptanalytic applications (Q1284011):
Displaying 50 items.
- Nonlinearities in elliptic curve authentication (Q296311) (← links)
- Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
- 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)
- Computational hardness of IFP and ECDLP (Q505664) (← 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)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- On the cost of ASIC hardware crackers: a SHA-1 case study (Q826307) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Low-gate quantum golden collision finding (Q832353) (← links)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
- Symmetric Hadamard matrices of order 116 and 172 exist (Q890745) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← 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)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Improved generic attacks against hash-based MACs and HAIFA (Q1688402) (← links)
- New second preimage attacks on dithered hash functions with low memory complexity (Q1698640) (← links)
- On the cost of computing isogenies between supersingular elliptic curves (Q1726684) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Research on attacking a special elliptic curve discrete logarithm problem (Q1793291) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- New results on quasi-subfield polynomials (Q1979951) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Algebraic approaches for solving isogeny problems of prime power degrees (Q2027266) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Improved classical cryptanalysis of SIKE in practice (Q2055705) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions (Q2107924) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- Cryptanalysis of full LowMC and LowMC-M with algebraic techniques (Q2129003) (← links)
- The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 (Q2129004) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- A new adaptive attack on SIDH (Q2152168) (← links)
- Generic attacks on hash combiners (Q2188959) (← links)
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem (Q2188960) (← links)
- Cryptanalysis of MD2 (Q2267363) (← links)
