Abstract:
Non-abelian group based Cryptography is a field which has
become a latest trend in research due to increasing vulnerabilities
associated with the abelian group based cryptosystems which are
in use at present and the interesting algebraic properties associated
that can be thought to provide higher security. When developing
cryptographic primitives based on non-abelian groups, the
researchers have tried to extend the similar layouts associated with
the traditional underlying mathematical problems and assumptions
by almost mimicking their operations which is fascinating even to
observe. This survey contributes in highlighting the different
analogous extensions of traditional assumptions presented by
various authors and a set of open problems. Further, suggestions
to apply the Hamiltonian Cycle/Path Problem in a similar direction
is presented
