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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf
Published: (2015) -
Elliptic curve and its applications in cryptography /
by: Fatin Nabila Abd Latiff
Published: (2016) -
On strongly n-regular and strongly regular rings /
by: Chen, Huey Voon
Published: (2000) -
A modified n-th section line search in conjugate gradient methods for solving unconstrained optimization / Muhammad Imza Fakhri Jinudin
by: Jinudin, Muhammad Imza Fakhri
Published: (2018) -
Comparative analysis of algorithms used in encryption and decryption /
by: Barahim, Ala'a Ebrahim Abobaker
Published: (2009)