Name
Abstract | ||
|---|---|---|
We show that, for a prime q and a group G, if ord(G) = q
k
r, k>1, and r is smooth, then finding a q
th
root in G, is equivalent to the discrete logarithm problem over G (note that the discrete logarithm problem over the group G reduces to the discrete logarithm problem over a subgroup of order q – see reference [5]). Several publications describe techniques for computing q
th
roots (see [3] and [1]). All have the stated or implied requirement of computing discrete logarithm in a subgroup of order
q.
The emphasis here will be on demonstrating that with a fairly general q
th
root oracle, discrete logarithms in a subgroup of order q may be found, describing the cryptographic significance of this problem, and in introducing two new public key signature
schemes based on it.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-47942-0_11 | ICICS |
Keywords | DocType | ISBN |
Cryptographic Value,qth Root | Conference | 3-540-66682-6 |
Citations | PageRank | References |
2 | 0.61 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheryl L. Beaver | 1 | 19 | 2.59 |
| Peter Gemmell | 2 | 675 | 108.87 |
| Anna M. Johnston | 3 | 7 | 3.32 |
| William D. Neumann | 4 | 47 | 3.84 |