Pages that link to "Item:Q2759107"
From MaRDI portal
The following pages link to Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (Q2759107):
Displayed 15 items.
- On generalizations of separating and splitting families (Q311557) (← links)
- Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
- The distributions of individual bits in the output of multiplicative operations (Q892279) (← links)
- Analysis of low Hamming weight products (Q947106) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- Computing discrete logarithms with the parallelized kangaroo method. (Q1408372) (← links)
- Splitting systems and separating systems. (Q1428538) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Anonymity in shared symmetric key primitives (Q2638423) (← links)
- Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace (Q2790057) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- On splitting and splittable families (Q5080923) (← links)
- A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents (Q5445461) (← links)