Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420587 | Discrete Applied Mathematics | 2008 | 6 Pages |
Abstract
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 F2nF2n and Koblitz elliptic curves. In this paper, we introduce a reduced representation of LHWP and apply them to attack the relevant cryptosystems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jung Hee Cheon, HongTae Kim,