An efficient RSA cryptosystem by applying cuckoo search optimization algorithm

shree, S. Raja; Chilambuchelvan, A.; Rajesh, M.

doi:10.1002/cpe.4845

Cited by 8 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Formula ( 6) can be proved by induction on j. Indeed, if j = 2, by relation ( 3), one has 6) holds true up to the index (j − 1), then, by relations ( 5) and (7), it is easy to see that…”

Section: Definitions and Main Resultsmentioning

confidence: 99%

“…To counter that, developers have increased key length from one time to another to maintain a high security and privacy to systems that are protected by the RSA. Other countermeasures vary from using multiple public and private keys [3] to enhance and secure the RSA public key cryptosystem (ESRPKC) algorithm using the Chinese remainder theorem [4], from the use of a pair of random numbers and their modular multiplicative inverse [5] to the Cuckoo Search Optimization (CSA) algorithm for securing data integrity in the cloud [6]. For a survey, see Mumtaz et al [7].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Note on the Computation of the Modular Inverse for Cryptography

Bufalo

Orlando

2021

Axioms

View full text Add to dashboard Cite

In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given a and n positive integers, we present the sequence (zj)j≥0, where zj=zj−1+aβj−n, a<n and GCD(a,n)=1. Regarding the above sequence, we show that it is bounded and admits a simple explicit, periodic solution. The main result is that the inverse of a modulo n is given by a−1=⌊im⌋+1 with m=n/a. The computational cost of such an index i is O(a), which is less than O(nlnn) of the Euler’s phi function. Furthermore, we suggest an algorithm for the computation of a−1 using plain multiplications instead of modular multiplications. The latter, still, has complexity O(a) versus complexity O(n) (naive algorithm) or complexity O(lnn) (extended Euclidean algorithm). Therefore, the above procedure is more convenient when a<<n (e.g., a<lnn).

show abstract

“…Formula ( 6) can be proved by induction on j. Indeed, if j = 2, by relation ( 3), one has 6) holds true up to the index (j − 1), then, by relations ( 5) and (7), it is easy to see that…”

Section: Definitions and Main Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Note on the Computation of the Modular Inverse for Cryptography

Bufalo

Orlando

2021

Axioms

View full text Add to dashboard Cite

show abstract

“…Multiplication and addition privacy homomorphism is the two various instances of privacy homomorphism. The mathematical formulations and their respective definitions are described as follows 42 …”

Section: Proposed Gm‐naino Based Rsa Cryptographymentioning

confidence: 99%

Enhancing data security using global mutation based novel artificial immune network optimization in public cloud storage system

Kaliyamoorthy

Ramalingam

2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

During the past few years, several investigations and efforts have undergone to achieve secure data in the cloud. On the other hand, few security problems that arise because of virtualization and multitenancies are communication, isolation, as well as resource management system. Practically, it becomes a troublesome task for the user to attain secure output. Therefore, in this article, a RSA cryptosystem using global mutation‐based novel artificial immune network optimization algorithm is proposed. Here, an optimal key generation is achieved using a global mutation based novel artificial immune network optimization (GM‐NAINO). In addition to this, the data integrity is achieved by enhancing secure data transmission. Finally, seven diverse test functions are employed in evaluating the efficiency of the proposed technique. The experimental analysis are performed and the evaluation results demonstrated that the performances of the proposed technique is better when comparison with other techniques.

show abstract

Section: Rsa Cryptography Algorithmmentioning

confidence: 99%

GM-NAINO: Global Mutation based Novel Artificial Immune Network Optimization for Enhancing Data Security in Public Cloud Storage System

Kaliyamoorthy

2021

Preprint

View full text Add to dashboard Cite

In recent years, numerous research works have been established to obtain secure data in the cloud storage system. But the data privacy regarding information outsourcing on cloud services is considered a crucial problem. In order to provide secure data, it is necessary to encrypt the information before storing it in the public cloud storage system. To provide security and data integrity during encryption and decryption, this paper proposes a global mutation-based novel artificial immune network optimization algorithm for RSA cryptosystem. Here, the Global Mutation Based Novel Artificial Immune Network Optimization (GM-NAINO) Algorithm is employed to attain optimal generation of keys thereby enhancing safe and secure data transmission and improving the data integrity during the transmission of data. Thus, the proposed GM-NAINO based RSA framework provides an effective system in improving data integrity. In addition to this, to determine the effectiveness of the proposed GM-NAINO algorithm seven benchmark functions are utilized in this paper. The performance evaluation and the comparative analysis are carried out and the proposed GM-NAINO based RSA framework outperforms other approaches.

show abstract

An efficient RSA cryptosystem by applying cuckoo search optimization algorithm

Cited by 8 publications

References 19 publications

A Note on the Computation of the Modular Inverse for Cryptography

A Note on the Computation of the Modular Inverse for Cryptography

Enhancing data security using global mutation based novel artificial immune network optimization in public cloud storage system

GM-NAINO: Global Mutation based Novel Artificial Immune Network Optimization for Enhancing Data Security in Public Cloud Storage System

Contact Info

Product

Resources

About