This paper compares the speed of Baby-step Giant-step method and Pollard Rho with Brent Cycle Detection method to cause Total Break, which in turn is used to attack Digital Signature Algorithm i.e. forging a signature. This paper also finds out how the free parameter of Digital Signature Algorithm can affect the performance of the two method. This paper will present an empirical result on how the two method would perform under signature forgery scenario. Furthermore, an analysis of how close both method's performance is presented. Also, this paper provides an analysis regarding how the size of free parameter of DSA may affect the overall performance of the two methods. These analysis can provide useful basis for DSA’s parameter security analysis. Moreover, the result presented in this paper can extend to other discrete logarithm problem.
|Number of pages
|Journal of Theoretical and Applied Information Technology
|Published - 31 Dec 2018
- Discrete logarithm
- Number theory