Pell's RSA key generation and its security analysis

Segar, T. Chandra; Vijayaragavan, R.

doi:10.1109/icccnt.2013.6726659

Cited by 36 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed Modified RSA (MDSA) algorithm is examined on varying bit sizes of input. Performance of original RSA algorithm by Rivest, Shamir, and Adleman [17,18] are shown in Table 1. Also the performance of Modified RSA (MDSA) scheme in terms of encryption time and decryption is shown in Table 2.…”

Section: Performance Evaluationmentioning

confidence: 99%

An efficient and secure data storage in cloud computing using modified RSA public key cryptosystem

Kumar

Shafi

2020

IJECE

View full text Add to dashboard Cite

<span lang="EN-US">Cloud Computing is the ability to improve the utility or train new human resources without investing in new infrastructure, or add capabilities to existence without the latest software licensing. It expanded the capabilities of Information Technology (IT). From the past few years, cloud computing has developed from a good business concept in the best rising sectors of the IT industry. But more information on individuals and companies was put in the cloud, and concerns began to think about how secure the cloud environment was. Despite cloud surrounding structures, enterprise users still do not want to expand their business in the cloud. Security reduces the growth of cloud computing and continues to spread the market with complexity with data privacy and data protection. The security of cloud computing has constantly been an significant aspect of improved quality of service from cloud service providers. Data storage in the cloud has a problem related to data security. However, cloud computing construct many new security challenges which have not been well examine. In order to ensure that the user's data in the cloud is secure, we have proposed an effective mechanism with a distinctive feature of data integrity and privacy. This paper focusing on problems relating to the cloud data storage techniques and security in virtual environment. We recommend a method for providing data storage and security in cloud using public key Cryptosystem, which uses the concept of the modified RSA algorithm to provide better security for the data stored in the cloud. </span>

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

An efficient and secure data storage in cloud computing using modified RSA public key cryptosystem

Kumar

Shafi

2020

IJECE

View full text Add to dashboard Cite

show abstract

“…Thus the security is increased by three levels instead of two levels in RSA making it difficult for attackers. S e g a r and V i j a y a r a g a v a n [27] developed a new approach where generation of keys is based on Pell's equation, which makes use of the roots of Diophantine equation. They also proposed and analysed its complexity with RSA variants.…”

Section: Rsa Variantsmentioning

confidence: 99%

Key Generation Using Generalized Pell’s Equation in Public Key Cryptography Based on the Prime Fake Modulus Principle to Image Encryption and Its Security Analysis

Raghunandan

Aithal

Shetty

et al. 2020

Cybernetics and Information Technologies

View full text Add to dashboard Cite

RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent. In this paper the concept of fake modulus and generalized Pell’s equation is used for enhancing the security of RSA. Using generalized Pell’s equation it is explored that public key exponent depends on several parameters, hence obtaining private key parameter itself is a big challenge. Fake modulus concept eliminates the distribution of common modulus, by replacing it with a prime integer, which will reduce the problem of factorization. It also emphasizes the algebraic cryptanalysis methods by exploring Fermat’s factorization, Wiener’s attack, and Trial and division attacks.

show abstract

“…The depth of these trees is unbalanced and overlapping, hence the performance is reduced in the multi-structure indexing methods. The various types of indexing and the query process sing are mentioned in [38] and further consideration in spatio-temporal is security mentioned in [34][35][36][37] these papers are mentioned various advanced security features. The PPFI [26], MSMON [32], PPFN* [33] and D-Tree [28] are the main past, present and future data prediction indexing methods and these methods are considered as comparison purpose.…”

Section: Related Workmentioning

confidence: 99%

DTNH Indexing Method: Past Present and Future Data Prediction for Spatio-Temporal Data

John¹,

S²,

Rajesh³

2017

IJIES

View full text Add to dashboard Cite

Indexing methods are developed to effectively process user queries in many real-time and moving object management applications. The existing spatial data updating indexing methods are based on the Integrated binary Tree, R-Tree, R*-Tree, Oct-Tree, Quad-Tree, Grid-Tree and Hex-Tree. The depth of these trees is unbalanced and overlapping, hence the performance is reduced in the multi-structure indexing methods. D-Tree (Decompose -Tree) based multi-structure spatio-temporal index method is proposed to find the present, past and future data. The new multistructural model called DTNH-Tree used to find the present, past and future data. It consists of D-Tree, TB*-Tree, NTTree and hash table. The D-Tree indexing is used to get the spatial data and manage the moving objects in the road network. A set of TB*-Tree is used to index the history of moving object on road networks. A set of NT -Trees is used to manage the current position of the recently updated data and find present data of the moving objects. NT-Tree indexes the present and future information of the moving objects. Finally the set of hash tables is used for updating the data continuously. The proposed multi-structure indexing method supports different types of query processing compared to the existing indexing methods. Experimental results exhibits better updation and query performance compared to the MSMON-Tree and PPF*-Tree.

show abstract

Pell's RSA key generation and its security analysis

Cited by 36 publications

References 9 publications

An efficient and secure data storage in cloud computing using modified RSA public key cryptosystem

An efficient and secure data storage in cloud computing using modified RSA public key cryptosystem

Key Generation Using Generalized Pell’s Equation in Public Key Cryptography Based on the Prime Fake Modulus Principle to Image Encryption and Its Security Analysis

DTNH Indexing Method: Past Present and Future Data Prediction for Spatio-Temporal Data

Contact Info

Product

Resources

About