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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/58179/1/103-120.pdf http://psasir.upm.edu.my/id/eprint/58179/ http://einspem.upm.edu.my/journal/fullpaper/vol11saugust/103-120.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|