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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Conference or Workshop Item |
| اللغة: | English |
| منشور في: |
Institute for Mathematical Research, Universiti Putra Malaysia
2016
|
| الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/66502/1/Cryptology2016-1.pdf http://psasir.upm.edu.my/id/eprint/66502/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|