ArticlePDF Available

Abstract

By taking two distinct Diophantine equations with distinct large prime numbers and two different coordinates , two secret keys are generated at the same time so that two users can encrypt their messages / plaintext. Hence two sets of public key exponents with one set of private key exponents were the result of proposed algorithm.
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21869
ISSN: 0975-766X
ANALYZING THE STRENGTH OF PELL’S RSA
Chandrasegar T1, Senthilkumar M1, R.Silambarasan2, Carlos Becker Westphall 3
1Assistant Professor (Senior), SITE school, VIT University, India
2M.Tech Student ,SITE School, VIT University, Vellore, India.
3Professor, Federal University of Santa Catarina, Departamento de Informática e Estatística
Florianópolis, Santa Catarina, Brazil.
Email: mosenkum@gmail.com
Abstract
By taking two distinct Diophantine equations with distinct large prime numbers and two different co-ordinates, two
secret keys are generated at the same time so that two users can encrypt their messages / plaintext. Hence two sets of
public key exponents with one set of private key exponents were the result of proposed algorithm.
Keywords: Pell’s equation, Diophantine equation, Public key cryptosystem.
Introduction
The traditional RSA asymmetric key cryptographic system dates to be first in the public key cryptography comprising
public key creation, encrypting original message, private key generation and decrypting the encrypted message. In this
system the selection of prime numbers pairs larger and larger ensures the strong protection to cipher text from the third
parties in cracking back to original plaintext with means of different attacking schemes in the existing literature
including continued fraction method private key retrieval, Euclidean and extended Euclidean division algorithm method
of tracking private key are some with few. Continued fraction constraint of private key value less than that of modular
value to the power constant is admissible only when the two distinct prime numbers are limited to certain bit length.
When this bit length increased the retrieval process with continued fraction method would lead to longer time for
computing. Same scenario holds true for extended Euclidean division method as well. Next with RSA cryptography
method only one user can make encryption (or) in other lines, user’s single message only able to encrypt at the time.
Albeit holds this fine as far as the asymmetric key cryptography, the time and cost computing raised the issue which
tended further study in this regime. As an instance either of public key generation (or) private key generation cost only
can be made less also in time, by making large variations to one another. There hence give rise the study of re-balanced
RSA where encryption key and decryption key are balanced with respect to the aspects of time and cost followed by the
Chinese Remainder Theorem method of private key tracing from RSA and led to RSA-CRT Likewise in the different
direction first method of dual key generation by taking small public key exponent at one time and small private key
exponent on the other led to Dual RSA key generation where the results are provisioned with Lattice based breaking
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21870
system and analyzed to re-balanced RSA and RSA-CRT. The similar kind of producing two public keys by the simple
linear equations such as Diophantine equation what under influence called Pell’s equation is explained in this work. This
algorithm does not four sets of equations and two sets of co-ordinates system as in Dual RSA. Rather by simply taking
two Diophantine equations the two sets of secret keys are produced thence two users at a time can encrypt their message.
The proposed algorithm is proved with the help of numerical example calculations.
Literature Survey
In [1] taking four straight lines (linear equations) with two co-ordinates are comprised to give four set of prime numbers
name yp 1 ;q 1 ;p 2 ;q 2 and iterated until q 2 satisfies for the prime numbers albeit other three too need to be prime.
From these four prime numbers where x0 sandy 0s are chosen in such a way that two instances of public and private keys
were the result. Exactness of the key generation in either case were verified through Dual RSA equations form its key. In
[2] trailing the method of Euclidean algorithm, modified trial division method is employed in the private key generation
which back from the known modulus value and public key as prime numbers be-come larger extent this method helped
in encrypting digital data’s.
In [3] the encryption key generation is explained in the means of prime pairs selected for Euler’s totient function
calculation followed by system modulus computation. This leads to public key generation study in terms of prime
numbers and primitive roots. In [4] Knapsack problem with Merkle-Hellman number theoretic concepts are employed in
public key exponent calculation and showed the hardness of breaking back of private key. Defined their strong ability of
scheme against various known attacks including brute force. In[5] Prime number selection procedure in public key from
modulus of system and totient function of Euler computation are further extended and studied and proved the proposed
system secure against Shamir attacks. In [6] library function in C++ comprising encryption key generation and
groupware technique in encapsulation method described in encrypting and decrypting files stored in windows platform.
In [7] n carry array is used in the calculation of public key when the prime numbers are larger and proved the efficiency
in digital signature along with class lib in C++ were given. In [8] Pell’s equation first introduced in RSA cryptography in
key generation and management by fixing threshold value and proved there scheme is strong against coalition attack.
In [9] secret key generation from Pell’s equation by taking the roots of Diophantine equation for the constant prime is
proposed and analyzed its complexity with N-prime RSA, Dual RSA dn traditional RSA. Crypt analysis of Fermat’s
attack, Weiner’s continued fraction and extended Euclidean method were compared along with numerical examples. In
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21871
thick communication, two Diophantine equations are taken at a time and showed two secret key sets along with private
key exponent set. Proposed system/ algorithm makes two different users to encrypt their messages and send while
receiver receives two cipher texts and decrypt to original text with single private key set, thus the proposed scheme
makes the communication to one receiver to two senders at a time. While in other go, the sender can encrypt their two
different messages with two secret keys and communicate with receiver and receiver performs as explained earlier. The
proposed algorithm is explained with numerical example to prove its efficiency.
Proposed Work
Prof Pell studied the Diophantine equation of the form y2 dx 2 = 1. For the given positive values d the x and y values
should be found which satisfying the governing equation. One such solution is ford= 61, x and y has values
respectively2261590and1776319041.In this work the secret key generation is based on the above mentioned Diophantine
but he d values are chosen as prime number in due course positive prime integers. The proposed algorithm takes two
Diophantine equations and followed by selection of two distinct prime integers for d and then values of x0s and y0s
which satisfying Pell’s equation. Detailed proposed system is given in algorithm 1.
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21872
Therefore output of algorithm 1 produces two set of public keys are obtained namely(
1;d;P;X1;N)and(2;d;Q;X2;N) with the private key(e3;N).Continuing in same way Dual RSA is further expanded to
generate one more pair set of instance in key, the following algorithm variant to Dual RSA is proposed and takes the
following form
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21873
Hence the output of algorithm 2 is(e;N1 =p 1 q 1 ;n 2 = p 2 q 2 ;n 3 = p 3 q 3) and (d;p1;q1;p2;q2;p3;q3). Also it was
found that algorithm 2 satisfies the three simultaneous equation so called key equations for variation of Dual RSA key
generation.
Numerical Examples
Proposed system algorithm 1 is verified by taking numerical examples such as with respect to first Diophantine equation
when P = 7the prime number the values satisfying are X1= 3and Y1= 8. For the second Diophantine equation when
prime number Q= 11satisfies for X2= 3and Y2= 10where the first three steps are cover. From step 4 of algorithm 1
taking a = 13and b = 17givesN = 221and -(N) = 192. From step 5 the e value is taken as e= 5. From Eqs (1) and (2) of
algorithm 1 calculations yields 1= 39552and 2= 40100 which satisfies Eqs (3) and (4) respectively. From step 9 the d
values found to be d= 77. From Eqs (5) and (6) values of s1 and s2 are calculated and yielding s1= 149and s2 = 149.
Considering the plaintext M= 19, step11 gives the cipher text C= 15and in turn step 12 retracts original message M=
19from Eqs (7) and (8) respectively. Therefore two set of public keys are (39552;77;7;3;221) and (40100;77;11;3;221).
Along with the private key set(53;221).Example of proposed algorithm 2 takes, for x1= 20 and x2= 9if step 1 of
algorithm 2 gives p1 =181 which is prime number. For y2 = 12 is step 2 yields p2= 241which is prime. For y1= 8 in step
3 gives p3 = 73which is prime. From step 4 q1= 97which is prime number. Step 5 takes e = 7and d = 12343where k1=
2is taken satisfying step 5. Then from steps 6 and 7 the values are q2= 19and q3= 41both are prime. Therefore output of
algorithm 2 is (7;17557;4579;2993) and (12343;181;97;241;19;73;41). From this example it can be verified that three
key equations are satisfied with above values similar to that of Dual RSA two key equations.
Conclusion
Upon this communication two algorithms are pro-posed in key generating scheme for RSA crypto-graphic system. While
the Pell’s RSA key generation produces single pair of key, an variant in aspects of two sets production in key generation
by considering two distinct Pell’s equations the strength is further improved to one step. Presented numerical example
proves the efficiency of designed system also makes two users to encrypt their data. It can be further expanded by
considering simultaneous Pell’s system of equations in key generating where n users able to cipher their data
concurrently.
Alternate to the Dual RSA scheme of key generation, further k values were considered and designed the so called trivial
RSA one step ahead to Dual RSA where three instances of RSA are generated which improves the security than that of
IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 21869-21874 Page 21874
Dual RSA. In the pipeline working of variant of Dual RSA the trivial RSA algorithm 2 is explained and proved with
numerical example. Also believed which can be further developed by taking n number of k 0 s and hence multiple
instances of RSA well be deployed as algorithm 2.
References
1. H.-M. Sun, Mu-En. Wu, W-C. Tang and M. J. Hinek. ”Dual RSA and its security analysis.”IEEE Trans. Inf. Theory.
Vol. 33,No. 8, pp 2922-2933, 2007.
2. Palchaudhury. Modified Trail division for Implementation ofRSA Algorithm with Large Integers Int. J. Advanced
Network-ing and Applications Volume: 01, Issue: 04, Pages: 210-216 , 2009
3. Ravi Shankar Dhakar, Amit Kumar Gupta, Prashant Sharma Modified RSA Encryption Algorithm (MREA) pgno:
426-429advance Advanced Computing & Communication Technolo-gies (ACCT), 2012, ISBN: 978-1-4673-0471-9
4. Sonal Sharma, Prashant Sharma, Ravi Shankar Dhakar, RSAAlgorithm Using Modified Subset Sum Cryptosystem
Pgno:457-461, Computer and Communication Technology (ICCCT),2011, ISBN: 978-1-4577- 1385-9
5. H. C. WILLIAMS, A Modification of the RSA Public-Key Encryption Procedure pgno: 726-729, IEEE transaction
on In-formation Theory.
6. Suli Wang, Ganlai Liu, File encryption and decryption system based on RSA algorithm pgno: 797-800,
Computational and Information Sciences (ICCIS), 2011 , ISBN: 978-1-4577-1540-2.
7. Ying-yu Cao, Chong Fu, An Efficient Implementation of RSA Digital Signature Algorithm, pgno: 100-103,
Intelligent Computation Technology and Automation (ICICTA), 2008,ISBN:978-0-7695-3357-5
8. Sarma, K.V.S.S.R.; Kumar, G.S.K.; Avadhani, P.S., Threshold cryptosystem using Pells equation,pgno: 413-416,
Information Technology: New Generations (ITNG), 2011, ISBN: 978-1-61284-427-5.
9. Chandra Segar. T and Vijayaragavan. R.”Pell’s RSA key gener-ation and its security analysis.” Int conference of
Computing, Communications and Networking Technologies (ICCNT), pp 1-5, 2013.
... At present Public Key Cryptography (PKC) [6], [8], [10], [13], [16], [18] assumes a fundamental part in a few zones, for example, Banking, Online buying, E-mail, and so forth., Due to this, there is the high danger of getting assault [9], [19] through by speculating the notable RSA mystery keys from general society type. A portion of the ongoing variations of RSA as for their execution investigation [3], [5], [11], [12], [14], [17], [19], [20], [22] and memory requirements of key [7]. A portion of the PKC are suited for multi-key age plot [20], [21], [23], [24] for proficient sharing of data among the substances like IoT and Cloud registering. ...
Article
Full-text available
Internet of Things (IoT) will be an essential piece of our lives in the following couple of years. It will be found as immediate specialist co-op in our surroundings through the associated sensor based systems. Indeed, even in a roundabout way, it will serve us in a few structures as esteem included administrations over the cell stages. With the IoT frameworks that make utilization of information in reality, the information accumulation from gadgets can likewise be an objective of cyber attacks. Gadget to Device interchanges (D-2-D) in IoT was imagined along different conventions, for example, Constrained Access Protocol (CoAP).Its significant worries in the arrangement of IoT is to guarantee for security of gadgets and D-2-D interchanges. In addition, present correspondence conventions for IoT are without reliability highlights. It is a result of this that countermeasures in view of encryption are as of now picking up in significance. There is a need of a strong cryptosystem for D-2-D in IoT. In this exploration paper, we present an encryption procedure which is referred to as EPEB as a security answer for IoT. In this technique we utilize preparing bits for information encryption and decoding. In collector end key isn't known so we would crypt be able to gadgets information utilizing distinctive keys and scramble bundle per bit.
... A touch of the past procedures to figure the decisions in setting of their relationship of basic worth is Spearman [6], [45] Analytical Hierarchical Process (AHP) [8], [10] and Traveling Salesman Problem (TSP) [33]. The test information's among various substances [14], [16], [23], [25], [27], [29], [31], [37] among the patient's and genius joint effort and decision demonstrate [40] are directed by late secured structures [18], [20], [24], [26], [28], [30], [32], [34], [36], [39], [41]. To have trust and shock guaranteeing late fundamental structures [43], [46], [47], [49], [51], [53] are existed. ...
... A part of the past strategies to guess the decisions in perspective of their relationship of value is Spearman [4], [43] Analytical Hierarchical Process (AHP) [4], [6], [8] and Traveling Salesman Problem (TSP) [31]. The test information's among various substances [10], [12], [19], [21], [23], [25], [27], among the cryptographic attributes are dealt with by late secured systems [18], [20], [24], [26], [28], [30]. ...
... Of all these methods proposed due to the constraints of the requirements the algorithms that were proposed may fail to meet the necessary requirement and may not be proper for encrypting. Some of the recent cryptosystems [3], [8], [15], [16], [17], [19], [20], are proposed to address the security issues. The requirement constraints include the power consumption, complexity, etc. ...
Article
Full-text available
Wireless communication has played a major role from wireless message passing to wireless online money transaction. Due to a vast development in the wireless networking it has eased the many communication works. Though there has been a vast development in the wireless networking there has also been an increase in the cyber-attacks. It has become difficult to authorize a person properly just by using a static password especially in net banking. One time password (OTP) system solves the above issue. Even though the one time password has been used widely for properly authorizing the person's identity there have many ways to steal one time password from the person and using the one time password by the attacker. Hence, this situation leads to development of encrypting OTP. There are many ways of encrypting one time password by due to many constraints on requirement such as power consumption, securely transferring of one time password etc. many algorithms failed to meet the requirement. Thus, in this paper, we are going to produce Linear Rivest, Adi Shamir and Len Adleman algorithm for encrypting the one time password by using public and private keys.
... A part of the past procedures to appraise the decisions in perspective of their relationship of value are Spearman [6], Analytical Hierarchical Process (AHP) [12], [18], [20] and Traveling Salesman Problem (TSP) [43]. The sensitive information's among various substances [24], [26], [33], [35], [37], [29], [31] among the bank stock model are dealt with by late secured strategies [28], [30], [34], [36], [38], [40], [42], [44].. Perceptron: Data is fed into a network of interconnected nodes. These individual nodes are called perceptron's or neurons, and they are the basic unit of a neural network. ...
Article
Full-text available
In this paper, we will use deep neural networks for predicting the bike sharing usage based on previous years usage data. We will use because deep neural nets for getting higher accuracy. Deep neural nets are quite different from other machine learning techniques; here we can add many numbers of hidden layers to improve the accuracy of our prediction and the model can be trained in the way we want such that we can achieve the results we want. Nowadays many AI experts will say that deep learning is the best AI technique available now and we can achieve some unbelievable results using this technique. Now we will use that technique to predict bike sharing usage of a rental company to make sure they can take good business decisions based on previous years data.
... Currently Public Key Cryptography (PKC) [5], [7], [10], [13], [17], [19] plays a vital role in several areas such as Banking, Online purchasing, E-mail, etc., Due to this, there is the high risk of getting attack [9], [20] through by guessing the well-known RSA secret keys from the public exponent. Some of the recent variants of RSA with respect to their performance analysis [2], [4], [11], [12], [15], [18], [20], [21], [23] and memory constraints of key [6]. Some of the PKC are suited for multi-key generation scheme [21], [22], [24], [27] for efficient sharing of information among the entities like IoT and Cloud computing. ...
Article
Full-text available
In this paper, we discussed to reduce costs for delivering a high-quality product in the today's global economy. Control charts technique is used to study the process stability and reduce the number of defects in the software product. Box Plot technique is used to study the information of shape and center of data.This work is limited to the software development cycle which follows the Waterfall or the Classical life cycle model.
Conference Paper
Full-text available
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.
Article
Full-text available
We present new variants of an RSA whose key generation algorithms output two distinct RSA key pairs having the same public and private exponents. This family of variants, 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. Two applications for dual RSA, blind signatures and authentication/secrecy, are proposed. In addition, we also provide the security analysis of dual RSA. Compared to normal RSA, the security boundary should be raised when applying dual RSA to the types of small-d, small-e, and rebalanced-RSA.
Conference Paper
This paper describes a complete set of practical solution to file encryption based on RSA algorithm. With analysis of the present situation of the application of RSA algorithm, we find the feasibility of using it for file encryption. On basis of the conventional RSA algorithm, we use C + + Class Library to develop RSA encryption algorithm Class Library, and realize Groupware encapsulation with 32-bit windows platform. With reference of this Groupware on Net platform, you can realize the window application of encryption operation on any files with RSA algorithm.
Conference Paper
RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring of a large number (modulus) is difficult. In RSA if one can factor modulus into its prime numbers then the private key is also detected and hence the security of the cryptosystem is broken. The Subset-Sum cryptosystem (Knapsack Cryptosystem) is also an asymmetric cryptographic technique. The Merkle-Hellman system is based on the subset sum problem (a special case of the knapsack problem): given a list of numbers and a third number, which is the sum of a subset of these numbers, determine the subset. In general, this problem is known to be NP-complete. However, if the set of numbers (called the knapsack) is superincreasing, that is, each element of the set is greater than the sum of all the numbers before it, the problem is 'easy' and solvable in polynomial time with a simple greedy algorithm. So in this paper 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. This paper also presents comparison between MSSRPKC and RSA cryptosystems in respect of security and performance.
Article
The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored. It may however be possible to break this system without factoring R. A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, then R can be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.
Conference Paper
RSA is the most widely used digital signature algorithm in e-commerce and the complexity of large integer operation is the main factor that affects the efficiency of a RSA system. In this paper, a n carry array based large integer denotation approach is proposed to speed up the large integer calculation in RSA key generation and data encryption/decryption process, so as to improve the efficiency of a RSA system. The RSA digital signature algorithm and its mathematic foundation are discussed in detail and the feasibility of RSA algorithm is proved. An integrated large integer library is built by using C++ and the implementations of Miller-Rabin, extended Euclid and Montgomery algorithms for complex numeric operations in RSA are given.
Conference Paper
This paper analyzed the basic principles of secret sharing in threshold cryptosystem and its superiority considering its application in key management. Combining secret sharing and key management, we present a threshold key management scheme based on PEC(Pell's Equation based Cryptosystem). By utilizing secret sharing and probabilistic encryption algorithm in key generating and distributing, the scheme achieves threshold management of symmetric key and public key certificate. The scheme avoids the misuse of certificate generating and tracing by CA (Certificate Agency) members, renders effective supervision on key management. It prevents coalition attack, intruder-in-middle attack and generalized certificate forgery. We also provide an application case of the threshold key management scheme in key managing and certificate supervision, it further justify the scheme's brevity, security, high efficiency regarding its application in such circumstances as with restricted computation ability, integrated space and limited bandwidth yet requiring for high-speed operation.
  • K V S S R Sarma
  • G S K Kumar
  • P S Avadhani
Sarma, K.V.S.S.R.; Kumar, G.S.K.; Avadhani, P.S., Threshold cryptosystem using Pells equation,pgno: 413-416, Information Technology: New Generations (ITNG), 2011, ISBN: 978-1-61284-427-5.
Modified Trail division for Implementation ofRSA Algorithm with Large Integers Int
  • Palchaudhury
Palchaudhury. Modified Trail division for Implementation ofRSA Algorithm with Large Integers Int. J. Advanced Network-ing and Applications Volume: 01, Issue: 04, Pages: 210-216, 2009
Prashant Sharma Modified RSA Encryption Algorithm (MREA) pgno: 426-429advance Advanced Computing & Communication Technolo-gies (ACCT)
  • Ravi Shankar Dhakar
  • Amit Kumar Gupta
Ravi Shankar Dhakar, Amit Kumar Gupta, Prashant Sharma Modified RSA Encryption Algorithm (MREA) pgno: 426-429advance Advanced Computing & Communication Technolo-gies (ACCT), 2012, ISBN: 978-1-4673-0471-9