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: Robustness features are essential for any black-box or non-black box security mechanism in cryptography. Zero-knowledge proofs is an example of non-black box security mechanism used in ...

ABSTRACT: A hybrid cryptographic system providing digital authentication is described and analyzed in this paper. The proposed cryptosystem incorporates three features: complexity of the discrete ...