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...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | 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/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|