Name
Title | ||
|---|---|---|
Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs. |
Abstract | ||
|---|---|---|
We investigate a recently proposed algorithm solving the strong discrete logarithm problem with auxiliary inputs, and show that this algorithm in general is not more efficient than ordinary discrete-logarithm-solving algorithms such as Pollard's rho method, by analyzing a lower bound on the sum of digits of integers. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1090/S0025-5718-2014-02813-5 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
Discrete logarithm problem,(strong) Diffie-Hellman problem,sum of digits | Natural logarithm,Binary logarithm,Mathematical analysis,Baby-step giant-step,Digit sum,Quantities of information,Iterated logarithm,Logarithm,Mathematics,Discrete logarithm | Journal |
Volume | Issue | ISSN |
83 | 288 | 0025-5718 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minkyu Kim | 1 | 22 | 9.55 |
| Jung Hee Cheon | 2 | 1787 | 129.74 |
| In-Sok Lee | 3 | 0 | 0.34 |