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...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | थीसिस |
| भाषा: | अंग्रेज़ी |
| प्रकाशित: |
2018
|
| विषय: | |
| ऑनलाइन पहुंच: | http://psasir.upm.edu.my/id/eprint/83705/1/FS%202019%2036%20-%20ir.pdf |