Some analysis on conjugacy search problem for Diffie-Hellman protocol

Authors

  • S.H. Jusoo Centre for Mathematical Sciences, Universiti Malaysia Pahang, Lebuh Persiaran Tun Khalil Yaakob, 26300 Kuantan, Pahang, Malaysia
  • M.S. Mohamad Centre for Mathematical Sciences, Universiti Malaysia Pahang, Lebuh Persiaran Tun Khalil Yaakob, 26300 Kuantan, Pahang, Malaysia
  • S.A. Sulaiman Centre for Mathematical Sciences, Universiti Malaysia Pahang, Lebuh Persiaran Tun Khalil Yaakob, 26300 Kuantan, Pahang, Malaysia
  • Faisal Mathematics Department, School of Computer Science, Bina Nusantara University, West Jakarta, Indonesia

DOI:

https://doi.org/10.15282/daam.v3i2.8936

Keywords:

Diffie-Hellman protocol, Nonabelian group , Conjugacy search problem

Abstract

The field in nonabelian group-based cryptosystem have gain attention of the researchers as it expected to offers higher security when confronted with quantum computational due to more complex algebraic structures. Hence, this paper intents to give an overview on Diffie-Hellman protocol considering the mathematically hard problem such as the conjugacy search problem in a group G. In this paper we provide examples for G of non abelian group particularly the group of SL(2,3).

Downloads

Published

2022-09-30

Issue

Section

Research Articles