Discrete-Log With Compressible Exponents
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
Mathematics of Computation
Random small hamming weight products with applications to cryptography
Discrete Applied Mathematics - Special issue on the 2000 com2MaC workshop on cryptography
A note on discrete logarithms with special structure
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Fast batch verification of multiple signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Hard instances of the constrained discrete logarithm problem
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
A new baby-step giant-step algorithm and some applications to cryptanalysis
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Parameterized splitting systems for the discrete logarithm
IEEE Transactions on Information Theory
| Hi-index | 0.10 |
Hoffstein and Silverman suggested a use of Low Hamming Weight Product (LHWP) to compute a random power in a group or a multiple of an element in a ring. It reduces the computation of powers in a group with fast endomorphisms such as the Galois field F"2"^"n and Koblitz elliptic curves. In this paper, we introduce a reduced representation of LHWP and apply them to attack the relevant cryptosystems.