The document proposes an elliptic curve cryptographic (ECC) based group key establishment protocol for mobile ad hoc networks. ECC allows for smaller key sizes than traditional public key methods like RSA, making it suitable for resource constrained mobile devices. The proposed Group Key Management Protocol (GKMP) would use ECC to efficiently establish and distribute a shared group key for mobile ad hoc networks, handling changes in network topology like nodes joining or dropping out of the group. The protocol aims to satisfy security requirements for asynchronous and dynamic mobile ad hoc networks in an efficient manner.

1. Project Proposal Presentation Research Methodology Gayan Jayasinghe 2007/MCS/024

2. Introduction Never Lasting Problem of a man kind Never Satisfy Spreading not only to IT but to all visual/tangible/intangible objects in real life What is it? Security We use “ cryptography ” Can we talk about any IT solutions with out Security? Standalone, networks, mobile networks Mobile Ad hoc network security Ad hoc nature What are the limitations

3. Gap that tries to fill “ Elliptic Curve Cryptographic (ECC) based Group Key Establishment Protocol for Mobile Ad hoc networks” Mobile Ad hoc Network √ Group Key Management? ECC, alien ?? Group Key Management Protocol (GKMP) Establishment of the shared key in mobile ad-hoc groups . Compute the group key based on their individual contributions providing verifiable trust relationship between participants

4. Group Key Management Protocol Dropping Node A Symmetric Key Diffe Hellman Key Exchange Keep track of live nodes Key Distribution Use of Efficient Data Structures Different Key Dropping Node A

5. Elliptic Curve Cryptography (ECC) Small Devices can’t bare huge keys Failure of PKI No more RSA, DSA in mobile devices But we need the same strength Small key but same strength No more RSA, DSA on mobiles The explosive growth in the use of mobile and wireless devices demands a new generation of PKI schemes that has to accommodate limitations on power and bandwidth, at the same time, to provide an adequate level of security for such devices.

6. Elliptic Curve Cryptography (ECC) Solution is ECC Its security comes from the elliptic curve logarithm, which is the DLP (Discrete Logarithm Problem) in a group defined by points on an elliptic curve over a finite field. This results in a dramatic decrease in key size. ECC offers equivalent security with smaller key sizes resulting in faster computations, lower power consumption, as well as memory and bandwidth savings. While these characteristics make ECC especially appealing for mobile devices, they can also alleviate the computational burden.

7. Defend ECC right candidate Mathematically proved unbreakable Stronger than any other in Cryptographic History Require little processing and memory power GKMP Suggest a protocol which satisfies Ad hoc requirements Asynchronous/Dynamic topology acceptable Efficient Key Distribution Problem of Key Size and key generation It is solved Computer Science proof of concept Able to cover all requirements Technically feasible solution