Proceedings ArticleDOI
Pell's RSA key generation and its security analysis
T. Chandra Segar,R. Vijayaragavan +1 more
- pp 1-5
Reads0
Chats0
TLDR
Pell's RSA key generation and its security analyses over the standard RSA, N Prime RSA, Dual RSA, and the application of Pell's RSA, Blind signatures, are proposed.Abstract:
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.read more
Citations
More filters
Journal ArticleDOI
An Enhanced and Secured RSA Key Generation Scheme (ESRKGS)
TL;DR: A modified and an enhanced scheme based on RSA public-key cryptosystem is developed which 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 largePrime numbers.
Proceedings ArticleDOI
An assessment framework of intuitionistic fuzzy network for C2B decision making
TL;DR: The aim of the paper is to optimize the C2B model by intuitionistic Fuzzy to resolve multi decision making problems using membership and non-membership attributes which is built to generate the intuitionistic fuzzy priority weighting vector based on minimum distance and similarity measures.
Proceedings ArticleDOI
Analysing the concrete compressive strength using Pearson and Spearman
TL;DR: In this paper, 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 are compared.
Proceedings ArticleDOI
Memory efficient multi key (MEMK) generation scheme for secure transportation of sensitive data over cloud and IoT devices
TL;DR: A new variant of RSA has been proposed called Memory Efficient Multi Key (MEMK) generation scheme, which reuses the RSA scheme with a Diophantine form of the nonlinear equation for memory efficiency and performs well.
Journal ArticleDOI
An efficient public key secure scheme for cloud and IoT security
TL;DR: A strong performance evaluation on standard RSA, Enhanced and Secured RSA Key Generation Scheme ( ESRKGS), and ENPKESS on its key generation, encryption and decryption by varying the N -bit moduli size up to 10K bits is shown.
References
More filters
Journal ArticleDOI
Cryptanalysis of short RSA secret exponents
TL;DR: A cryptanalytic attack on the use of short RSA secret exponents is described, which poses no threat to the normal case of RSA where the secret exponent is approximately the same size as the modulus.
Journal ArticleDOI
A modification of the RSA public-key encryption procedure (Corresp.)
TL;DR: The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored as discussed by the authors.
Journal ArticleDOI
Dual RSA and Its Security Analysis
TL;DR: New variants of an RSA whose key generation algorithms output two distinct RSA key pairs having the same public and private exponents, called dual RSA, can be used in scenarios that require two instances of RSA with the advantage of reducing the storage requirements for the keys.
Proceedings ArticleDOI
Modified RSA Encryption Algorithm (MREA)
TL;DR: This scheme presents a new cryptography algorithm based on additive homomorphic properties called Modified RSA Encryption Algorithm (MREA), which is secure as compared to RSA as it is based on the factoring problem as well as decisional composite residuosity assumptions which is the intractability hypothesis.
Proceedings ArticleDOI
RSA algorithm using modified subset sum cryptosystem
TL;DR: A Modified Subset-Sum over RSA Public key cryptosystem (MSSRPKC) is presented which is secure against Mathematical and brute-force attacks on RSA as well as Shamir attacks.