Journal of Applied Mathematics & Bioinformatics

Matrix representation of cryptographic functions

  • Pdf Icon [ Download ]
  • Times downloaded: 1156
  • Abstract

    The Discrete Logarithm and the Diffie-Hellman are two hard computational problems, closely related to cryptography and its applications. The computational equivalence of these problems has been proved only for some special cases. In this study, using LU-decomposition to Vandermonde matrices, we are able to transform the two problems in terms of matrices, thus giving a new perspective to their equivalence. A first study on matrix expressions for the Double and Multiple Discrete Logarithms is also presented.