Vol. 17 No.3 | pp.1-7.

Cycle Detection in Discrete Logarithm Using a Queue

Abstract This paper proposes a discrete logarithm algorithm that largely reduces execution times of Pollard's Rho and Brent's algorithm in obtaining from . The proposed algorithm can be distinguished from the conventional Brent’s algorithm by three major features: it sets an initial value as in lieu of ; replaces pointer with for a Queue the size 10; and detects collision of instead of . This Queue method has reduced the execution time of Pollard's Rho algorithm with by , and that of Brent's algorithm with by .
1|2|3|4
Copyright © The Institute of Internet, Broadcasting and Communication. All rights reserved.
Address : 610 Dongbu Sunville, #99-6 GaRak-dong, SongPa-gu, Seoul, Korea | Tel : +82-2-407-7718, +82-70-7404-7718, Fax : + 82-2-407-7716 E-mail: iibc@iibc.kr