(The) $l$-th power diffie-hellman problem and the $l$-th root diffie-hellman problem = $l$-제곱 디피-헬만 문제와 $l$-제곱근 디피-헬만 문제

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 360
  • Download : 0
There are many variants of the computational Diffie-Hellman problem that are necessary to provide security of many cryptographic schemes. Two of them are the square Diffie-Hellman problem and the square root Diffie-Hellman problem. Dongyoung Roh and Sang Geun Hahn proved that these two problems are polynomial-time equivalent under a certain condition [17]. In this paper, we generalize this result. We introduce the $l$-th power Diffie-Hellman problem and the $l$-th root Diffie-Hellman problem and show that these two problems are polynomial-time equivalent for $l=O(\log p)$ under a condition similar to that of [17], where $p$ is the order of the underlying group.
Advisors
Hahn, Sang Geunresearcher한상근researcher
Description
한국과학기술원 :수리과학과,
Publisher
한국과학기술원
Issue Date
2018
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 수리과학과, 2018.2,[i, 22 p. :]

Keywords

Discrete Logarithm Problem▼aComputational Diffie-Hellman Problem▼a$l$-th power DIffie-Hellman problem▼a$l$-th root Diffie-Hellman problem▼aCryptography; 이산 로그 문제▼a계산적 디피-헬만 문제▼a$l$-제곱 디피-헬만 문제▼a$l$-제곱근 디피-헬만 문제▼a암호학

URI
http://hdl.handle.net/10203/264950
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=734341&flag=dissertation
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0