Title: Transformation of two cryptographic problems in terms of matrices

Authors: E.C. Laskari, G.C. Meletiou, D.K. Tasoulis and M.N. Vrahatis

Abstract:

The Discrete Logarithm and the Diffie-Hellman are two hard computational
problems, highly connected with cryptography and its applications. The
computational equivalence of these problems has been proved only for some
special cases and an important amount of research is dedicated to this
direction. In this study, using LU-decomposition on Vandermonde matrices, we
are able to transform the two problems in terms of matrices. This
transformation gives a new perspective to their equivalence 
and ideas for the generation of new cryptosystems are derived.