A comparative S-index in factoring RSA modulus via Lucas sequences
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...
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 |
Similar Items
-
Introducing S-index into factoring RSA modulus via Lucas sequences
by: Abu, Nur Azman, et al.
Published: (2017) -
Cryptanalysis on prime power RSA modulus of the form N=prq
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2016) -
Extending Pollard class of factorable RSA modulus
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2018) -
New directions in factoring the prime power RSA modulus N = prq
by: Shehu, Sadiq, et al.
Published: (2016) -
New vulnerabilities of RSA modulus type N = p²q
by: Nek Abd Rahman, Normahirah, et al.
Published: (2016)