The square root Diffie–Hellman problem |
| |
Authors: | Dongyoung Roh Sang Geun Hahn |
| |
Institution: | 1.National Institute for Mathematical Sciences,Daejeon,Republic of Korea;2.Korea Advanced Institute of Science and Technology,Daejeon,Republic of Korea |
| |
Abstract: | Many cryptographic schemes are based on computationally hard problems. The computational Diffie–Hellman problem is the most
well-known hard problem and there are many variants of it. Two of them are the square Diffie–Hellman problem and the square
root Diffie–Hellman problem. There have been no known reductions from one problem to the other in either direction. In this
paper we show that these two problems are polynomial time equivalent under a certain condition. However, this condition is
weak, and almost all of the parameters of cryptographic schemes satisfy this condition. Therefore, our reductions are valid
for almost all cryptographic schemes. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|