Handbook of theoretical computer science (vol. A)
Discrete-Log With Compressible Exponents
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
Mathematics of Computation
Analysis of Low Hamming Weight Products
Discrete Applied Mathematics
On diffie-hellman key agreement with short exponents
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Parameterized splitting systems for the discrete logarithm
IEEE Transactions on Information Theory
Hard instances of the constrained discrete logarithm problem
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Correcting errors in private keys obtained from cold boot attacks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.06 |
Many cryptographic systems assume the computational difficulty of the discrete logarithm (DL) problem. In order to accelerate such practical systems, it was proposed to use logarithms of special structure, such as small Hamming weight. How difficult is the underlying restricted DL problem? By rephrasing Shanks' method we provide a close to square-root algorithm for such problems.