Accelerating Pollard’s Rho Algorithm on Finite Fields

به نام خدا

Title: Accelerating Pollard’s Rho Algorithm on Finite Fields

Authors: Jung Hee Cheon, Jin Hong , and Minkyu Kim

Abstract: Most generic and memory efficient algorithms for solving the discrete logarithm problem construct a certain random graph consisting of group element nodes and return the solution when a collision is found among the graph nodes. In this work, we develop a technique for traveling through the random graph with- out fully computing each node and also provide an extension to the distinguished point collision detection method that is suitable for this new situation. Concrete constructions of this technique for multiplicative subgroups of the finite fields are given. Our implementations confirm that the proposed technique provides practical speedup over existing algorithms.   

Publish Year: 2012

Publisher: Journal of Cryptography - Journal of Springer

Number of Pages: 48

موضوع: میدانهای متناهی، جبر مجرد، رمزنگاری

مشاهده صحفه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر


ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

/ 0 نظر / 21 بازدید