DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hahn, Sang-Geun | - |
dc.contributor.advisor | 한상근 | - |
dc.contributor.author | Lee, Eon-Kyung | - |
dc.contributor.author | 이언경 | - |
dc.date.accessioned | 2011-12-14T04:39:16Z | - |
dc.date.available | 2011-12-14T04:39:16Z | - |
dc.date.issued | 2001 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=169520&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41838 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 수학전공, 2001.8, [ ii, 35 p. ] | - |
dc.description.abstract | Provable security is an important area in modern cryptography. A cryptographic scheme is said to be provably secure if defeating it can be shown to be essentially as difficult as solving a well-known and supposedly difficult problem. Recently, the conjugacy problem in braid groups has been turned out to be cryptographically useful. In this thesis, we study based on the conjugacy problem two fundamental areas of provably secure cryptographic primitives: one-way functions and pseudorandom generators. The difficulty of inverting a one-way function induces a notion of hard-core predicate. Our results are twofold. On the one hand, we view the conjugacy problem as a one-way function. To apply this problem to provably secure schemes, we describe formally the conjugacy problem as a collection of one-way functions in terms of the theory of computation. For this one-way function collection we present a hard-core predicate showing that it inherits the difficulty of solving the conjugacy problem. On the other hand, we view the decisional Ko-Lee problem, a variant of the conjugacy problem, as a computationally infeasible problem. To apply this to provably secure schemes, we describe formally the decisional Ko-Lee assumption in terms of the theory of computation. From this, we construct two practical pseudorandom schemes: a pseudorandom generator and a pseudorandom synthesizer. And then we show that they are provably as secure as the decisional Ko-Lee assumption. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Hard-core predicate | - |
dc.subject | One-way function | - |
dc.subject | Braid group | - |
dc.subject | Cryptology | - |
dc.subject | Pseudorandom generator | - |
dc.subject | 유사난수 생성기 | - |
dc.subject | 가장 어려운 지시자 | - |
dc.subject | 일방향 함수 | - |
dc.subject | 땋임군 | - |
dc.subject | 암호학 | - |
dc.title | (A) study of provably secure pseudo-random generator and hard-core predicate | - |
dc.title.alternative | 안전성이 증명 가능한 유사난수 생성기와 Hard-core Predicate에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 169520/325007 | - |
dc.description.department | 한국과학기술원 : 수학전공, | - |
dc.identifier.uid | 000975823 | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.localauthor | 한상근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.