TY - JOUR

T1 - The computational difficulty of solving cryptographic primitive problems related to the discrete logarithm problem

AU - Konoma, Chisato

AU - Mambo, Masahiro

AU - Shizuya, Hiroki

PY - 2005/1

Y1 - 2005/1

N2 - To the authors' knowledge, there are not many cryptosystems proven to be as difficult as or more difficult than the discrete logarithm problem. Concerning problems related to the discrete logarithm problem, there are problems called the double discrete logarithm problem and the e-th root of the discrete logarithm problem. These two problems are likely to be difficult and they have been utilized in cryptographic protocols such as verifiable secret sharing scheme and group signature scheme. However, their exact complexity has not been clarified, yet. Related to the e-th root of the discrete logarithm problem, we can consider a square root of the discrete logarithm problem. Again, the exact complexity of this problem has not been clarified, yet. The security of cryptosystems using these underlying problems deeply depends on the difficulty of these underlying problems. Hence it is important to clarify their difficulty. In this paper we prove reductions among these fundamental problems and show that under certain conditions, these problems are as difficult as or more difficult than the discrete logarithm problem modulo a prime.

AB - To the authors' knowledge, there are not many cryptosystems proven to be as difficult as or more difficult than the discrete logarithm problem. Concerning problems related to the discrete logarithm problem, there are problems called the double discrete logarithm problem and the e-th root of the discrete logarithm problem. These two problems are likely to be difficult and they have been utilized in cryptographic protocols such as verifiable secret sharing scheme and group signature scheme. However, their exact complexity has not been clarified, yet. Related to the e-th root of the discrete logarithm problem, we can consider a square root of the discrete logarithm problem. Again, the exact complexity of this problem has not been clarified, yet. The security of cryptosystems using these underlying problems deeply depends on the difficulty of these underlying problems. Hence it is important to clarify their difficulty. In this paper we prove reductions among these fundamental problems and show that under certain conditions, these problems are as difficult as or more difficult than the discrete logarithm problem modulo a prime.

KW - Discrete logarithm problem

KW - Double discrete logarithm problem

KW - Square root of discrete logarithm problem

KW - e-th root of discrete logarithm problem

UR - http://www.scopus.com/inward/record.url?scp=27544503613&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27544503613&partnerID=8YFLogxK

U2 - 10.1093/ietfec/E88-A.1.81

DO - 10.1093/ietfec/E88-A.1.81

M3 - Article

AN - SCOPUS:27544503613

SN - 0916-8508

VL - E88-A

SP - 81

EP - 88

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 1

ER -