文章基本信息

标题：Performance Analysis of Parallel Pollard's Rho Factoring Algorithm
本地全文：下载
作者：Anjan K Koundinya ; Harish G,Srinath N K ; Raghavendra G E 等
期刊名称：International Journal of Computer Science & Information Technology (IJCSIT)
印刷版ISSN：0975-4660
电子版ISSN：0975-3826
出版年度：2013
卷号：5
期号：2
页码：157
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box ciphersuites where the cipher algorithm is based on number theory. The origin of the problem is from DiscreteLogarithmic Problem which appears under the analysis of the cryptographic algorithms as seen by acryptanalyst. The integer factorization algorithm poses a potential in computational science too, obtainingthe factors of a very large number is challenging with a limited computing infrastructure. This paperanalyses the Pollard’s Rho heuristic with a varying input size to evaluate the performance under a multicoreenvironment and also to estimate the threshold for each computing infrastructure.
关键词：Pollard’s Rho; Brent’s Implementation; Monte-Carlo Algorithm; Integer Factorization;Discrete Log;Problem.