Complete Decompositions of Dihedral Groups and Group Based Key Exchange Protocol

This research is about the group coverings of subsets finite non-abelian groups and its application in field cryptography. Group abelian has been researched over years it many applications various fields. The popularity internet increased rapidly cryptography become more important as ensures privacy security users network. A cryptosystem a structure consisting several cryptographic primitives. Key exchange protocol one primitives that parties used to shared key. covering we investigate this paper complete decompositions order t dihedral group. Let D2n be 2 for positive integer n≥3. We show some constructions t∈{2,3,…,n}. Since group, hardness mathematical problems will designing secure cryptosystem. By using computational decomposition search problem, two key proposed without sharing any keys directly. Finally, scheme communication between authorized protect data from being disclosed third or hackers.