Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem

DOI10.1090/S0025-5718-01-01310-2zbMath0977.68040MaRDI QIDQ2759107

Douglas R. Stinson

Publication date: 10 December 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

discrete logarithm problemsplitting systembaby-step giant-step algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Other designs, configurations (05B30)

Related Items

On generalizations of separating and splitting families, Anonymity in shared symmetric key primitives, Constructions and bounds for \((m,t)\)-splitting systems, The distributions of individual bits in the output of multiplicative operations, New Definition of Density on Knapsack Cryptosystems, Random small Hamming weight products with applications to cryptography, Computing discrete logarithms with the parallelized kangaroo method., Splitting systems and separating systems., Analysis of low Hamming weight products, Computing low-weight discrete logarithms, On splitting and splittable families, On the low Hamming weight discrete logarithm problem for nonadjacent representations, Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace, A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory

Cites Work

• Explicit construction of exponential sized families of k-independent sets
• Perfect hashing
• On Diffie-Hellman Key Agreement with Short Exponents
• On the minimum distance of some quadratic residue codes (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item