Using P Systems to Solve the Discrete Logarithm Problem Used in Diffie-Hellman Key Exchange Protocol

Free registration required

Executive Summary

The discrete logarithm problem has been used as the basis of several cryptosystems, especially the Diffie-Hellman key exchange protocol. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper presents a P system with active membranes and strong priority to solve the discrete logarithm problem used in Diffie-Hellman key exchange protocol. To the best of the authors' knowledge, it's the first time to solve the problem using P systems.

  • Format: PDF
  • Size: 195.8 KB