Secured Data Transmission Using Elliptic Curve Cryptography
International Journal of Innovative Research in Computer and Communication Engineering
Secured data transmission using elliptic curve cryptography can be defined as transmission of data. This paper proposes an survey about Secured data transmission using elliptic curve cryptography. The main problem in existing system is security issues in transmitting data between source and the destination. After the survey on various literature papers, we are concluding a new way, that increases security considerations of the network using AODV algorithm for transfer of data and to increment
... e efficiency of AODV algorithm using ECC(Elliptic Curve Cryptography). Efficiency, and reliability will be increased for each transmission of data, While enclosing the proposed method by using the ECC algorithm which allow itself to encrypt and decrypt the data that is to be transferred and performs the active classification, we are concluding that the Secured data transmission using elliptic curve cryptography provide a efficiency higher than DSDV when compared with AODV.A computer network, or simply a network, is a collection of computers and other hardware interconnected by communication channels that allow sharing of resources and information. Using a network, people can communicate efficiently and easily via email, instant messaging, chat rooms, telephone, video telephone calls, and video conferencing. In a network environment, authorized users may access data and information stored on written for the client process, which initiates the communication, and for the server process, which waits for the communication to be initiated. Both endpoints of the communication flow are implemented as network sockets; hence network programming is basically socket programming.Networks are often classified by their physical or organizational extent or their purpose. Usage, trust level, and access rights differ between these types of networks. nodes area unit unbroken mounted. Therefore, owners will calculate their best costs severally and at the same time. Associate owner might receive magnified or decreased (or zero) fraction of the arrival rate and revenue. The algorithm starts with the at first elite nodes and within the iterations the nodes within the set. In every iteration, every owner sends its new value, that returns the (new) arrival rate fraction and therefore the updated aggregated info required to calculate the best price for consecutive iteration. Note that during this situation the broker is not concerned in evaluation selections. This situation will be viewed as a non-cooperative game among call manufacturers (owners). The state for the sport could be a strategy profile with the property that no owner will increase its expected revenue by dynamic its value given the opposite owners' costs. In different words a strategy profile could be a same equilibrium if no owner will profit by deviating unilaterally from its value to a different possible one. a vital question is whether or not this algorithmic program will converge to the Nash equilibrium during this algorithmic program, each owner iteratively adjusts its value to the new best value until no owner will receive additional revenue by unilaterally changing its value (e.g., the Nash equilibrium is reached). That is, the expected revenues for the set of nodes used for load equalisation all stay a similar because the previous iteration. The only known results regarding the convergence to the Nash equilibrium area unit for distributed load equalisation algorithms with linear and strictly increasing link prices. The convergence proof for quite 2 players with general value functions remains associate open down side. The authors of, Have incontestable exploitation simulation experiments that their distributed load equalisation algorithms converge to the Nash equilibrium in distributed systems and procedure grids.