Probability to meet in the middle
Journal of 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
Improving the parallelized Pollard lambda search on anomalous binary curves
Mathematics of Computation
On random walks for Pollard's Rho method
Mathematics of Computation
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
The Maximum of a Random Walk and Its Application to Rectangle Packing
The Maximum of a Random Walk and Its Application to Rectangle Packing
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
A Low-Memory Algorithm for Point Counting on Picard Curves
Designs, Codes and Cryptography
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Speeding Up the Pollard Rho Method on Prime Fields
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
On the distribution of the coefficients of normal forms for Frobenius expansions
Designs, Codes and Cryptography
Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
A non-uniform birthday problem with applications to discrete logarithms
Discrete Applied Mathematics
| Hi-index | 0.00 |
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to the general multidimensional DLP. An important component of the algorithm is a multidimensional pseudorandom walk which we analyse thoroughly in the 1 and 2 dimensional cases as well as giving some discussion for higher dimensions.