The elliptic curve discrete logarithm problem (ECDLP) lies at the heart of modern public-key cryptography. It concerns the challenge of determining an unknown scalar multiplier given two points on an ...

Abstract: The discrete logarithm problem has been used as the basis of several cryptosystems. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper ...

A team of French mathematicians and computer scientists has made an important advancement in the field of algorithms for breaking cryptographic codes. In a certain class of problem, the new algorithm ...

ABSTRACT: This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DLP onto several DLPs of smaller ...

Abstract: The present study investigates the difficulty of solving the mathematical problem, namely DLP (Discrete Logarithm Problem) for ephemeral keys. DLP is the basis for many public key ...

In this paper, we first define the quantum discrete logarithm problem (QDLP)which is similar to classical discrete logarithm problem. But, this problem cannot be solved by Shor's quantum algorithm.

Add a description, image, and links to the discrete-logarithm-problem topic page so that developers can more easily learn about it.