Factorization strategies of N = pq and N = pʳq and relation to its decryption exponent bound
The major RSA underlying security problems rely on the difficulty of factoring a very large composite integer N into its two nontrivial prime factors of p and q in polynomial time, the ability to solve a given Diophantine equation ed = 1 + kφ (N) where only the public...
Saved in:
Main Author: | Abubakar, Saidu Isah |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/83705/1/FS%202019%2036%20-%20ir.pdf http://psasir.upm.edu.my/id/eprint/83705/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Successful cryptanalytic attacks upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2019) -
A new simultaneous diophantine attack upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2018) -
New cryptanalytic attack on RSA modulus N = pq using small prime difference method
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2019) -
Classification of Moufang Loops of Odd Order pq3.
by: Balasingam Gnanaraj, Andrew Rajah
Published: (2014) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015)