Akshay Atrey | Georgia Institute of Technology (original) (raw)

Uploads

Papers by Akshay Atrey

Research paper thumbnail of An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

International journal of Computer Networks & Communications, 2010

Research paper thumbnail of A Novel And Efficient Algorithm To Enhance The Complexity Of Elliptic Curve Cryptography

In this paper, we propose a novel and efficient way to improve the computational complexity of th... more In this paper, we propose a novel and efficient way to improve the computational complexity of the Elliptic Curve Cryptography [ECC] algorithm. ECC is a public key cryptography system, where the underlying calculations are performed over elliptic curves. The security of ECC is based on solving the Elliptic Curve Discrete Logarithm Problem [EDCLP]. We propose an algorithm to double the computational complexity of the conventional algorithm. The proposed algorithm generates two ECDLP opposed to one problem that was generated by the conventional algorithm being used till now. With the same key size, the proposed algorithm provides more security when compared to public key cryptography systems like RSA and ECC. It can be implemented efficiently in even less time when compared to ECC. The paper discuses the underlying protocol and proves how the enhancement in security and reduction in implementation time is achieved, thereby making it well suited for wireless communication.

Research paper thumbnail of A Novel And Efficient Algorithm To Enhance The Complexity Of Elliptic Curve Cryptography

Research paper thumbnail of An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

Computing Research Repository, 2010

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving... more Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm.

Research paper thumbnail of An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

International journal of Computer Networks & Communications, 2010

Research paper thumbnail of A Novel And Efficient Algorithm To Enhance The Complexity Of Elliptic Curve Cryptography

In this paper, we propose a novel and efficient way to improve the computational complexity of th... more In this paper, we propose a novel and efficient way to improve the computational complexity of the Elliptic Curve Cryptography [ECC] algorithm. ECC is a public key cryptography system, where the underlying calculations are performed over elliptic curves. The security of ECC is based on solving the Elliptic Curve Discrete Logarithm Problem [EDCLP]. We propose an algorithm to double the computational complexity of the conventional algorithm. The proposed algorithm generates two ECDLP opposed to one problem that was generated by the conventional algorithm being used till now. With the same key size, the proposed algorithm provides more security when compared to public key cryptography systems like RSA and ECC. It can be implemented efficiently in even less time when compared to ECC. The paper discuses the underlying protocol and proves how the enhancement in security and reduction in implementation time is achieved, thereby making it well suited for wireless communication.

Research paper thumbnail of A Novel And Efficient Algorithm To Enhance The Complexity Of Elliptic Curve Cryptography

Research paper thumbnail of An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

Computing Research Repository, 2010

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving... more Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm.

Log In