Introducing S-index into factoring RSA modulus via Lucas sequences

At any instance in the factoring algorithm, the accumulative result stands independently. In effect, there is no clear direction to manoeuvre whether to go left or right. General Lucas sequences are practically useful in cryptography. In the past quarter century, factoring large RSA modulo into its primes is one of the most important and most challenging problems in computational number theory. A factoring technique on RSA modulo is mainly hindered by the strong prime properties. The success of factoring few large RSA modulo within the last few decades has been due to computing prowess overcoming one strong prime of RSA modulo. In this paper, some useful properties of Lucas sequences shall be explored in factoring RSA modulo. This paper will also introduces the S-index formation in solving quadratic equation modulo N. The S-index pattern is very useful in designing an algorithm to factor RSA modulo. The S-index will add another comparative tool to better manoeuvre in a factoring process. On one hand, it shall remain a theoretical challenge to overcome the strong prime properties. On the other hand, it shall remain a computational challenge to achieve a running time within polynomial time to factor RSA modulo. This paper will propose an avenue to do both using general Lucas sequences.

Preview PDF 103-120.pdf Download (679kB) | Preview Official URL or Download Paper: http://einspem.upm.edu.my/journal/fullpaper/vol11s...

Actions (login required)

View Item