PKC For Wireless Mesh Network Using ECC Algorithm

 LITERATURE Review:

A critical requirement for security in WMN is the

authentication of a new user who is trying to join the

network. This paper, they present a new authentication

scheme based on a combination of techniques, such as

zone-based hierarchical topology structure, virtual

certification authority (CA), off-line CA, identity-based

cryptosystem and multi-signature.

For maintaining security in network along with proper

authentication PKC is the most useful and reliable method

got invented. PKC can be done with many cryptographic

algorithms where key storage is constraint, but Elliptic

Curve Cryptography can removed this barrier as the RSA

algorithm requires that the key length be at least 1024 bits

for long term security which is not compatible with the

Devices having less Storage & Bandwidth. Instead, ECC is

more and more considered as an attractive public-key

cryptosystem for mobile/wireless environments where ECC

is especially useful for mobile devices, which are typically

limited in terms of their CPU, power, and network

connectivity however, it seems that 160 bits are sufficient

for elliptic curve cryptographic functions.

In 1976, Whitefield Diffie & Martin E. Hellman

introduces new Approach for mutual Authentication and for

security purpose of Cryptography. Due to PKC i.e Public 

Key Cryptography two users who wish to communicate can

it is must that they both should have a common key at both

the ends.

Taher Elgamal, introduces PKC based on Discrete

Algorithms in 1985, He stated a public key cryptosystem

and a signature scheme based on the difficulty of

computing discrete logarithms over finite fields. The

systems are only described in GF(p). introduces a new

digital signature scheme that depends on the difficulty of

computing discrete logarithms over finite fields. It is not yet

proved that breaking the system is equivalent to computing

discrete logarithms.

In 1998, M. Aydos, B. Sunar, and C . K. Koc proposed

an authentication and key agreement protocol for wireless

communication based on elliptic curve cryptographic

techniques. With The use of elliptic curve cryptographic

techniques provide greater security using fewer bits,

resulting in a protocol which requires low computational

overhead, and thus, making it suitable for wireless and

mobile communication systems, including smartcards and

handheld devices. After defining ECC in their

paper they proposed extended work of ECC as Elliptic

Curve Digital Signature Algorithm.

Kaleemullah Khan, and Muhammmad Akbar in 2006,

introduces New methodology for secure authentication

technique, with light over-heads that can be conveniently

implemented for the ad-hoc nodes forming clients of an

integrated WMN, thus facilitating their inter-operability.

The proposed authentication scheme is based on using

EAP-TTLS (Tunnelled Transport Layer Security) over

PANA. EAP-TTLS provides flexibility in using any of the

authentication protocols i.e. Password Authentication

Protocol (PAP), Challenge Handshake authentication

Protocol (CHAP), or Message Digest 5 (MD5) etc. The

EAP-TTLS extends EAP-TLS to exchange additional

information between client and server by using secure

tunnel established by TLS negotiation.

In 2009, Ranbir Soram, introduces a New Secure

communication model specially for Cellular

Communication. He investigated the security loopholes in

SMS banking and propose a system to make mobile SMS

banking secure using Elliptic Curve Cryptosystem(ECC).

His ECC module receives the text messages from the

clients/banks and processes them and sends the output back

to the banks/users as and when required. This ECC Banking

module provides secure data encryption and decryption

using public key cryptography .The technology is perfectly

secure and GPRS is not mandatory. He introduces ECC

Using the real numbers for cryptography have a lot of

problem as it is very difficult to store them precisely in

computer memory and predict how much storage will be

needed for them. The difficulty can be solved by using

Galois fields. In a Galois field, the number of elements is

finite. Since the number of elements if finite, we can find a

unique representation for each of them, which allows us to

store and handle the elements in an efficient way. Galois

showed that the number of elements in a Galois field is

always a positive prime power, pn and is denoted by

GF(pn). Two special Galois fields are standard for use in

Elliptic Curve cryptography. They are GF(p) when n=1 and

GF(2n) when p=2.

R. Rajaram Ramasamy, M. Amutha Prabakar, M. Indra

Devi, and M. Suguna in 2009, introduces ECC Algorithm

using Knapsack Algorithm. They presented the

implementation of ECC by first transforming the message

into an affine point on the EC, and then applying the

knapsack algorithm on ECC encrypted message over the

finite field GF(p). In ECC we normally start with an affine

point called Pm(x,y). This point lies on the elliptic curve. In

this paper we have illustrated encryption/decryption

involving the ASCII value of the characters constituting the

message, and then subjecting it to the knapsack algorithm.

They compared their algorithm with RSA algorithm and

show that our algorithm is better due to the high degree of

sophistication and complexity involved. It is almost

infeasible to attempt a brute force attack.

In year 2012, Peng Xiao, Jingsha H2 and Yingfang Fu

proposed effective distributed key management scheme for

the establishment of a secure WMN in this paper, which is

based on several technologies, such as ad hoc network

model, ECC, (t, n) threshold cryptographic, verifiable secret

sharing. He introduces the method that all mesh nodes need

to acquire a legal certificate from the offline CA, which is

supported by an ISP or network carrier. And as there is

no CA or administrator center online in the backbone mesh

networks, n mesh routers with higher performance will

form a virtual CA and group key management (GKM) to

manage the keys using the (t, n) threshold cryptographic

method.

In 2013, Merad BOudia Omar Rafiq and Feham

Mohammad had proposed Fast & Secure Implementation of

ECC algorithm using Concealed Data Aggregation.

Because of which a System just needs 1.29 seconds for

encryption & Decryption as well .

In 2014, Ravi Kishore Kodali introduces

Implementation of ECC with Hidden Generator Point in

Wireless Sensor Networks. He proposes a technique for

ECC with a hidden generator point in order to overcome the

MIM (Man In Middle) attack. He used Three different

algorithms based on the distribution of points on the elliptic

cure (EC), using a different generator point for each

encrypted message and selecting different generator points

for each session is discussed.

Conclusion

In this world of technology peer to peer communication

is Very essential area as more and more applications are

coming out, the destination of this promising technology,

saying WMNs, will be well-performed, secure, and widespread

wireless connection. This paper can be used to give

a baseline for building a tight security for wireless mesh

networks. Public-key cryptography is feasible for wireless

mesh network security applications including access control.

With more and more applications coming out, the

destination of this promising technology, saying WMNs,

will be well-performed, secure, and wide-spread wireless

connection. ECC-based access control scheme in wireless

mesh network the protocol for the network to authorize a

user to access the network. Implementation of ECC on

primary field performance will increase substantially. In

future it is possible to further reduce the running time by

using more refined and careful programming. Public-key

cryptography is feasible for wireless mesh network security

applications including access control.