Cover Image

Complete decompositions of dihedral groups and group based key exchange protocol

This research is about the group coverings of subsets of finite non-abelian groups and its application in the field of cryptography. Group coverings of finite abelian groups has been researched over the years and it has many applications in various fields. The popularity of internet has increased ra...

Full description

Saved in:
Bibliographic Details
Main Authors: Huey, Voon Chen, Chang, Seng Sin
Format: Article
Language:English
Published: Penerbit Universiti Kebangsaan Malaysia 2021
Online Access:http://journalarticle.ukm.my/18778/1/31.pdf
http://journalarticle.ukm.my/18778/
https://www.ukm.my/jkukm/volume-333-2021/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-ukm.journal.18778
record_format eprints
spelling my-ukm.journal.187782022-06-10T01:58:35Z http://journalarticle.ukm.my/18778/ Complete decompositions of dihedral groups and group based key exchange protocol Huey, Voon Chen Chang, Seng Sin This research is about the group coverings of subsets of finite non-abelian groups and its application in the field of cryptography. Group coverings of finite abelian groups has been researched over the years and it has many applications in various fields. The popularity of internet has increased rapidly and the application of cryptography become more important as it ensures the privacy and security of the users in the network. A cryptosystem is a structure consisting of several cryptographic primitives. Key exchange protocol is one of the cryptographic primitives that parties used to exchange a shared key. The group covering that we investigate in this paper is the complete decompositions of order t in dihedral group. Let D2n be dihedral group of order 2 for positive integer n≥3. We show some constructions of complete decompositions of D2n of order t for t∈{2,3,…,n}. Since D2n is a non-abelian group, the hardness of the mathematical problems will be increased in designing a secure cryptosystem. By using the computational complete decomposition of dihedral group of order t search problem, two parties key exchange protocol is proposed without sharing any keys directly. Finally, we show that the proposed scheme is a secure communication between the authorized parties and protect the data from being disclosed to the third parties or hackers. Penerbit Universiti Kebangsaan Malaysia 2021 Article PeerReviewed application/pdf en http://journalarticle.ukm.my/18778/1/31.pdf Huey, Voon Chen and Chang, Seng Sin (2021) Complete decompositions of dihedral groups and group based key exchange protocol. Jurnal Kejuruteraan, 33 (3). pp. 733-739. ISSN 0128-0198 https://www.ukm.my/jkukm/volume-333-2021/
institution Universiti Kebangsaan Malaysia
building Tun Sri Lanang Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Kebangsaan Malaysia
content_source UKM Journal Article Repository
url_provider http://journalarticle.ukm.my/
language English
description This research is about the group coverings of subsets of finite non-abelian groups and its application in the field of cryptography. Group coverings of finite abelian groups has been researched over the years and it has many applications in various fields. The popularity of internet has increased rapidly and the application of cryptography become more important as it ensures the privacy and security of the users in the network. A cryptosystem is a structure consisting of several cryptographic primitives. Key exchange protocol is one of the cryptographic primitives that parties used to exchange a shared key. The group covering that we investigate in this paper is the complete decompositions of order t in dihedral group. Let D2n be dihedral group of order 2 for positive integer n≥3. We show some constructions of complete decompositions of D2n of order t for t∈{2,3,…,n}. Since D2n is a non-abelian group, the hardness of the mathematical problems will be increased in designing a secure cryptosystem. By using the computational complete decomposition of dihedral group of order t search problem, two parties key exchange protocol is proposed without sharing any keys directly. Finally, we show that the proposed scheme is a secure communication between the authorized parties and protect the data from being disclosed to the third parties or hackers.
format Article
author Huey, Voon Chen
Chang, Seng Sin
spellingShingle Huey, Voon Chen
Chang, Seng Sin
Complete decompositions of dihedral groups and group based key exchange protocol
author_facet Huey, Voon Chen
Chang, Seng Sin
author_sort Huey, Voon Chen
title Complete decompositions of dihedral groups and group based key exchange protocol
title_short Complete decompositions of dihedral groups and group based key exchange protocol
title_full Complete decompositions of dihedral groups and group based key exchange protocol
title_fullStr Complete decompositions of dihedral groups and group based key exchange protocol
title_full_unstemmed Complete decompositions of dihedral groups and group based key exchange protocol
title_sort complete decompositions of dihedral groups and group based key exchange protocol
publisher Penerbit Universiti Kebangsaan Malaysia
publishDate 2021
url http://journalarticle.ukm.my/18778/1/31.pdf
http://journalarticle.ukm.my/18778/
https://www.ukm.my/jkukm/volume-333-2021/
_version_ 1735387665949261824
score 13.211869

Similar Items