Denis C. K. Wong2024-10-212024-10-212022-10-2810.1142/S1793557123500742https://dspace-cris.utar.edu.my/handle/123456789/3635In this work, we perform an investigation on the hardness of finding complete decompositions of dihedral groups and show an application of complete decomposition by constructing a Diffie–Hellman-type key exchange protocol.Complete decomposition of dihedral groups with application to key exchange protocoljournal-article