2015
DOI: 10.1016/j.jisa.2014.10.004
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced and Secured RSA Key Generation Scheme (ESRKGS)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0
1

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 64 publications
(40 citation statements)
references
References 8 publications
0
28
0
1
Order By: Relevance
“…Thangavel et al also proposed a modified and enhanced scheme based on RSA public-key cryptosystem using four prime numbers [12]. The value of N, which is a product of the four prime numbers determine the value of E, D. Additionally, the computation of E is not direct, where in order to determine the value of E1, the values of e1 and e2 must be obtained.…”
Section: An Enhanced and Secured Rsa Key Generation Scheme (Esrkgs)mentioning
confidence: 99%
See 2 more Smart Citations
“…Thangavel et al also proposed a modified and enhanced scheme based on RSA public-key cryptosystem using four prime numbers [12]. The value of N, which is a product of the four prime numbers determine the value of E, D. Additionally, the computation of E is not direct, where in order to determine the value of E1, the values of e1 and e2 must be obtained.…”
Section: An Enhanced and Secured Rsa Key Generation Scheme (Esrkgs)mentioning
confidence: 99%
“…"Only the value of n is kept as public and private component, this means that an attacker with the knowledge of n cannot determine all the primes which are the basis for finding the value of N, and subsequently D" [12]. The parameter E1 also helps in increasing the complexity of the system [12]. Below is a summary of the algorithm The enhanced RSA was implemented using the Java BigInteger Library function.…”
Section: An Enhanced and Secured Rsa Key Generation Scheme (Esrkgs)mentioning
confidence: 99%
See 1 more Smart Citation
“…This section involves the work done by various researchers in the field of RSA [4] proposed a modified RSA key generation algorithm which uses four primes instead of two primes and thereby increasing the time needed to find these primes. While increasing the security, the key generation time of the proposed algorithm is higher than original RSA.…”
Section: Related Workmentioning
confidence: 99%
“…Another practical PKC was found by ElGamal in 1985 which was introduced in [4]. Many other PKCs were introduced by many authors which can be seen in [5], [6], [7], [8], [9], and [10]. In many of these PKCs, the integers modulo n was used where n is a certain integer.…”
Section: Introductionmentioning
confidence: 99%