DocumentCode :
3085453
Title :
Experimantal Analysis of Cheon´s Algorithm Against Pairing-Friendly Curves
Author :
Izu, Tetsuya ; Takenaka, Masahiko ; Yasuda, Masaya
Author_Institution :
Fujitsu Labs. Ltd., Kawasaki, Japan
fYear :
2011
fDate :
22-25 March 2011
Firstpage :
90
Lastpage :
96
Abstract :
The discrete logarithm problem (DLP) is one of the familiar problem on which some cryptographic schemes rely. In 2006, Cheon proposed an algorithm for solving DLP with auxiliary input which works better than conventional algorithms. In this paper, we show our experimental results of Cheon´s algorithm on a pairing-friendly elliptic curve defined over GF(3127). It is shown that the algorithm combined with the kangaroo method has an advantage over that combined with the baby-step giant-step method in the sense that the required time and space are smaller. Then, for the algorithm combined with the kangaroo-method, speeding-up techniques are introduced. Based on our experimental results and the speeding-up techniques, we evaluate the required time and space for some pairing-friendly elliptic curves curves. As results, a portion of pairing-friendly elliptic curves can be analyzed by Cheon´s algorithm at reasonable cost.
Keywords :
public key cryptography; Cheon algorithm; GF(3127); baby step giant step method; cryptography; discrete logarithm problem; kangaroo method; pairing friendly elliptic curve; speeding up technique; Complexity theory; Elliptic curve cryptography; Elliptic curves; Equations; Generators; Mathematical model; Cheon´s algorithm; Discrete logarithm problem (DLP); experimental results; pairing-friendly elliptic curve on GF(3^127);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications (AINA), 2011 IEEE International Conference on
Conference_Location :
Biopolis
ISSN :
1550-445X
Print_ISBN :
978-1-61284-313-1
Electronic_ISBN :
1550-445X
Type :
conf
DOI :
10.1109/AINA.2011.37
Filename :
5763374
Link To Document :
بازگشت