A comparative S-index in factoring RSA modulus via Lucas sequences

• Main Authors: Abu, Nur Azman, Abdul Latip, Shekh Faisal, Kamel Ariffin, Muhammad Rezal
• Format: Conference or Workshop Item
• Language: English
• Published: Institute for Mathematical Research, Universiti Putra Malaysia 2016
• Online Access: http://psasir.upm.edu.my/id/eprint/66502/1/Cryptology2016-1.pdf; http://psasir.upm.edu.my/id/eprint/66502/
• Institution: Universiti Putra Malaysia

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 prim...