:: The Journal of the Institute of Internet, Broadcasting and Communication ::, Vol.17 No.6 | (2017) pp.19~25
다중 초기치 Pollards's Rho 소인수분해 알고리즘
Abstract
본 논문은 비트코인 채굴에 필요한 SHA-256 암호 해시 값(n)을 구성하는 2개의 소수(p,q)를 빠르게 해독하는 소인수분해법을 다룬다. 본 논문에서는 Pollard's Rho 소인수분해 알고리즘의 수행횟수를 월등히 감소시킨 알고리즘을 제안하였다. Rho(p) 알고리즘은 (Xo,Yo)=(2,2) 초기치에 대해 Xi=X²-1+1(modᥒ)과 y²i-+1](modᥒ)을 계산하여 1
This paper deals with integer factorization of two prime p,q of SHA-256 secure hash value n for Bit coin mining. This paper proposes an algorithm that greatly reduces the execution time of Pollard's rho integer factorization algorithm. Rho(p) algorithm computes Xi=X²-1+1(modᥒ) and y²i-+1](modᥒ) for intial values (Xo,Yo)=(2,2) to find the factor 1
Integer factorization,Greatest common divider (gcd),Pollard rho algorithm
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
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