Abstract
Pollard's rho method is well-known as an efficient method for solving discrete logarithm problem (DLP). This paper adopts the DLP on the so-denoted G3 over Barreto-Naehrig curve, together with XTR group. Then, this paper shows this idea with the proposed algorithm, and the experimental computation time of solving the DLP is reduced by about 15%.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 |
| Pages | 595-598 |
| Number of pages | 4 |
| Publication status | Published - 2012 |
| Event | 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 - Seoul, Korea, Republic of Duration: Dec 3 2012 → Dec 5 2012 |
Other
| Other | 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 |
|---|---|
| Country | Korea, Republic of |
| City | Seoul |
| Period | 12/3/12 → 12/5/12 |
ASJC Scopus subject areas
- Computer Science Applications
- Software
Cite this
The Pollard's rho method with XTR group on G3 over barreto-naehrig curve. / Takai, Yusuke; Nekado, Kenta; Nogami, Yasuyuki.
Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012. 2012. p. 595-598 6530404.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - The Pollard's rho method with XTR group on G3 over barreto-naehrig curve
AU - Takai, Yusuke
AU - Nekado, Kenta
AU - Nogami, Yasuyuki
PY - 2012
Y1 - 2012
N2 - Pollard's rho method is well-known as an efficient method for solving discrete logarithm problem (DLP). This paper adopts the DLP on the so-denoted G3 over Barreto-Naehrig curve, together with XTR group. Then, this paper shows this idea with the proposed algorithm, and the experimental computation time of solving the DLP is reduced by about 15%.
AB - Pollard's rho method is well-known as an efficient method for solving discrete logarithm problem (DLP). This paper adopts the DLP on the so-denoted G3 over Barreto-Naehrig curve, together with XTR group. Then, this paper shows this idea with the proposed algorithm, and the experimental computation time of solving the DLP is reduced by about 15%.
UR - http://www.scopus.com/inward/record.url?scp=84881127800&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881127800&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84881127800
SN - 9788994364216
SP - 595
EP - 598
BT - Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012
ER -