Public-key cryptography can be claimed as the greatest and an excellent revolution in the field of cryptography. A public-key cryptosystem is used for both confidentiality and authentication. One such public-key cryptosystem is the RSA cryptosystem. In this paper, a modified and an enhanced scheme based on RSA public-key cryptosystem is developed. The proposed algorithm makes use of four large prime numbers which increases the complexity of the system as compared to traditional RSA algorithm which is based on only two large prime numbers. In the proposed Enhanced and Secured RSA Key Generation Scheme (ESRKGS), the public component n is the product of two large prime numbers but the values of Encryption (E) and Decryption (D) keys are based on the product of four large prime numbers (N) making the system highly secured. With the existing factorization techniques, it is possible only to find the primes p and q. The knowledge of n alone is not sufficient to find E and D as they are based on N. The time required for cryptanalysis of ESRKGS is higher than traditional RSA cryptosystem. Thus the system is highly secure and not easily breakable. A comparison is done between the traditional RSA scheme, a recent RSA modified scheme and our scheme to show that the proposed technique is efficient.

An Enhanced and Secured RSA Key Generation Scheme (ESRKGS)

Decision making is a difficult task over the complex, spirited and competitive environment. A variety of research provides diverse notification for individual failure in making logical decisions under certain circumstances by applying normative approaches. In today's competitive market, the advance of technology is closely related to consumer needs for the extraction of good quality products at less cost which is in rarely finding a model in Consumer to Business (C2B). The aim of the paper is to optimize the C2B model by intuitionistic Fuzzy to resolve multi decision making problems. It derives multi criteria decision making to support complex environments in C2B using membership and non-membership attributes which is built to generate the intuitionistic fuzzy priority weighting vector based on minimum distance and similarity measures. This technique classifies the object type as per the customer needs with a ranking in the optimized way make efficient for the customer satisfaction.

An assessment framework of intuitionistic fuzzy network for C2B decision making

Spearman's rank relationship coefficient is a nonparametric (dispersion free) rank measurement. Spearman's coefficient is not a measure of the direct relationship between two factors, as a few ”analysts” proclaim. Pearson's relationship coefficient is the covariance of the two factors separated by the result of their standard deviations. The possibility of the paper is to look at the estimations of Pearson's concrete compressive strength coefficient and Spearman's rank relationship coefficient and in addition their factual hugeness for various arrangements of information depicting provincial records of the financial advancement. In this, the Spearman correlation coefficient is based on the ranked values for each variable rather than the raw data. Spearman correlation is often used to evaluate relationships involving ordinal variables. The Pearson and Spearman's method is compared with the rank coefficient in the concrete compressive strength.

Analysing the concrete compressive strength using Pearson and Spearman

A new variant of RSA has been proposed called Memory Efficient Multi Key (MEMK) generation scheme. For sensitive data, our scheme will aid in exchanging the information between cloud to IoT and IoT to IoT devices. When cryptography belongs to the asymmetric type, then it has public and private keys. For memory efficiency, our scheme reuses the RSA scheme with a Diophantine form of the nonlinear equation. Moreover, our scheme performance comparatively performs well and this mainly due to the use of RSA public key alone. Due to this, our MEMK does not require multiplicative inverse function or Extended Euclid's algorithm. Finally, we have made an experimental result on various phases of MEMK PKC such as key generation, encryption, and decryption by varying the N-bit modulo bits from 1K to 10K.

Memory efficient multi key (MEMK) generation scheme for secure transportation of sensitive data over cloud and IoT devices

An efficient public key secure scheme for cloud and IoT security

In this paper, a new variant of RSA has been proposed whose key generation method is distinct with the standard RSA. Generally the RSA family of variants can be applied at the secured channel to enhance its data trust level on various applications such as E-commerce, Internet applications, etc., The boundary level of the private key has been recommended here, to raise over these variant to stay away from the possibility of getting the Small `d' value either by continuous fraction method of Wiener's attack, or by Coppersmith's lattice based method of Boneh & Durfee attack, or by retrieving the Euler's totient function value by Fermat factorization method. This paper discusses the proposal of Pell's RSA key generation and its security analyses over the standard RSA, N Prime RSA, Dual RSA. Finally the application of Pell's RSA, Blind signatures, are proposed.

T. Chandra Segar

Papers

Pell's RSA key generation and its security analysis