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/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|