scispace - formally typeset
Search or ask a question
Author

Kaushal Sultania

Bio: Kaushal Sultania is an academic researcher from VIT University. The author has contributed to research in topics: Key distribution & Key space. The author has an hindex of 2, co-authored 2 publications receiving 45 citations.

Papers
More filters
Proceedings ArticleDOI
04 Jul 2013
TL;DR: This paper proposes a secure algorithm that tries to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm.
Abstract: In symmetric key cryptography the sender as well as the receiver possess a common key. Asymmetric key cryptography involves generation of two distinct keys which are used for encryption and decryption correspondingly. The sender converts the original message to cipher text using the public key while the receiver can decipher this using his private key. This is also called Public Key Cryptography. For every public key there can exist only one private key that can decipher the encrypted text. Security of RSA Algorithm can be compromised using mathematical attack, by guessing the factors of a large number. It may also be compromised if one can guess the private key. In accordance with the mathematical attack, we propose a secure algorithm in this paper. In this algorithm, we try to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm. We also present a comparative analysis of the proposed algorithm with the RSA algorithm.

40 citations

Proceedings ArticleDOI
04 Jul 2013
TL;DR: This paper is proposing pre key distribution scheme for public key cryptography in military communication by establishing secure key arrangement between set of nodes in sensor network to improve performance in term of memory usage, resource consumption, resiliency against node capturing, scalability, resistant against node replication and security in information sharing.
Abstract: The communication in military is vital for distribution of commands, logistical information and proper functionality of all units. It is must to have a secure channel through which critical information is exchanged in real time and privacy of information is maintained. Wireless sensor network can be used in military application for monitoring militant activities like tracking enemies and force protection. Wireless sensor network has set of distributes sensors nodes which are connected to each other. These sensor nodes are low powered, low cost, small in size and can do limited amount of computation. But wireless sensor network is vulnerable to various kinds of attacks like node capturing, eavesdropping in communication links and man in the middle or reply to a message. To ensure security, messages from wireless sensor networks must be encrypted. Many key agreement schemes have been proposed to ensure security but most of them are quite complex. In this paper we are proposing pre key distribution scheme for public key cryptography in military communication by establishing secure key arrangement between set of nodes in sensor network. This will improve performance in term of memory usage, resource consumption, resiliency against node capturing, scalability, resistant against node replication and security in information sharing.

16 citations


Cited by
More filters
Proceedings ArticleDOI
01 Nov 2014
TL;DR: The traditional algorithms, along with the proposed algorithms based on their pros and cons, related to Symmetric and Asymmetric Key Cryptography are surveyed and the importance of both these cryptographic techniques is compared.
Abstract: Network security is an important aspect of information sharing. Attempts have been made to remove various insecurities over internet. For this, many technological implementations and security policies have been developed. The amount of data, transferred, is not a factor. The basic factor is, how much security, the channel provides while transmitting data. Cryptography is one such technique, which allows secure data transmission without losing its confidentiality and integrity. Based on the key distribution, cryptography is further classified into two major types-Symmetric Key Cryptography and Asymmetric Key Cryptography. In this paper, we have surveyed the traditional algorithms, along with the proposed algorithms based on their pros and cons, related to Symmetric and Asymmetric Key Cryptography. We have also compared the importance of both these cryptographic techniques. The proposed algorithms proved to be highly efficient in their respective grounds but there are certain areas that remained open, related to these algorithms, and have not yet been thoroughly discussed. This paper also presents an appropriate future scope related to these open fields.

149 citations

Journal ArticleDOI
01 Feb 2015
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.
Abstract: 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.

66 citations

Proceedings ArticleDOI
01 Sep 2016
TL;DR: In this paper, the authors studied the security issues and security threats in WSNs and gave brief description of some of the protocols used to achieve security in the network and compared the proposed methodologies analytically and demonstrates the findings in a table.
Abstract: Wireless Sensor Networks (WSNs) are formed by deploying as large number of sensor nodes in an area for the surveillance of generally remote locations. A typical sensor node is made up of different components to perform the task of sensing, processing and transmitting data. WSNs are used for many applications in diverse forms from indoor deployment to outdoor deployment. The basic requirement of every application is to use the secured network. Providing security to the sensor network is a very challenging issue along with saving its energy. Many security threats may affect the functioning of these networks. WSNs must be secured to keep an attacker from hindering the delivery of sensor information and from forging sensor information as these networks are build for remote surveillance and unauthorized changes in the sensed data may lead to wrong information to the decision makers. This paper studies the various security issues and security threats in WSNs. Also, gives brief description of some of the protocols used to achieve security in the network. This paper also compares the proposed methodologies analytically and demonstrates the findings in a table. These findings can be used further by other researchers or Network implementers for making the WSN secure by choosing the best security mechanism.

38 citations

Proceedings ArticleDOI
01 Dec 2015
TL;DR: This hybrid Cryptosystem using RSA and Blowfish algorithm is considered for cloud computing where digital signature is must for user authentication and provides features of both symmetric and asymmetric cryptography.
Abstract: Data security has become the major issue now in these days, especially for the use of internet. Now trending, cloud computing needs secure, fast and area efficient cryptographic techniques. Blowfish cryptosystem is one of the strong and fast algorithms used for cryptography. RSA algorithm usually considered for digital signatures. This paper presents a hybrid Cryptosystem using RSA and Blowfish algorithm. This hybrid cryptosystem is considered for cloud computing where digital signature is must for user authentication. So, this technique provides features of both symmetric and asymmetric cryptography. Also, blowfish is unpatented, so this cryptosystem is also cost efficient. The FPGA device Virtex-4 is used for implementation using Xilinx ISE 14.1.

30 citations

Proceedings ArticleDOI
01 Jan 2017
TL;DR: This paper presents a new Hybrid security algorithm for RSA cryptosystem named as Hybrid RSA (HRSA), where computation of "public key" as well as "private key" depends on the value of M, where M is the product of four prime numbers.
Abstract: This paper presents a new Hybrid security algorithm for RSA cryptosystem named as Hybrid RSA (HRSA). Here computation of "public key" (P) as well as "private key" (Q) depends on the value of M, where M is the product of four prime numbers. So complexity involved in factorizing the variable M increases. Another interesting feature about this algorithm is that the computation of P and Q involves the computation of some more intermediate factors which makes the computation more complex. In other existing works, the variable x or M is transferred during encryption and decryption process. However, this approach eliminates the transfer of variable x and M, where x represents the multiplication of two prime numbers a and b. Thus the proposed approach provides more secure path for encryption and decryption process. To substantiate this fact, the "key generation time", "encryption speed" and "decryption speed" of the proposed HRSA have been compared with conventional RSA and ERSA algorithms.

28 citations