Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김연진 | - |
dc.creator | 김연진 | - |
dc.date.accessioned | 2016-08-25T06:08:41Z | - |
dc.date.available | 2016-08-25T06:08:41Z | - |
dc.date.issued | 2003 | - |
dc.identifier.other | OAK-000000028835 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/181714 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000028835 | - |
dc.description.abstract | In this thesis we study the properties of the braid groups and the cryptosystem based on the conjucacy problems. We also propose new multiparty key agreement protocols on the braid groups which are one or two round based on the Diffie-Hellman Conjugacy problem. Finally we discuss the attacks on the braid group cryptanalysis which is proposed by Cheon -Jun [5].;이 논문에서는 braid groups을 이용한 cryptosystem에 대하여 공부한다. 특히 Diffie-Hellman Conjugacy problem에 기초한 one or two round multiparty key agreement protocols을 제시한다. 그리고 논문지도를 도와주신 이향숙 교수님과 같은 전공인 영란언니, 정민, 호정, 희선이에게 감사를 표한다. | - |
dc.description.tableofcontents | CONTENTS = ⅰ 1. Introduction = 1 2. BRAID GROUPS = 3 2.1 Definitions and properties of the braid groups = 3 2.2 Hard problems on the braid group = 5 3. CRYPTOSYSTEMS ON THE BRAID GROUPS = 8 3.1 The key agreement protocols and public key cryptosystem = 8 3.2 The cryptosystem related with the colored burau group = 11 3.3 The signature scheme based on the conjugacy problems = 15 3.4 The group key agreement protocol on the braid groups = 18 4. New multiparty key agreement protocols = 21 4.1 The one-round tripartite protocol = 22 4.2 The one round group key agreement = 23 4.3 The two round group key agreement protocol = 24 4.4 Analysis of these protocols = 26 5. A polynomial time algorithm for the Diffie-Hellman Conjugacy Problem = 27 5.1 The Lawrence-Krammer representation = 28 | - |
dc.format | application/pdf | - |
dc.format.extent | 1148213 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.subject | cryptosystem | - |
dc.subject | braid groups | - |
dc.subject | Mathematics | - |
dc.title | A cryptosystem using braid groups | - |
dc.type | Master's Thesis | - |
dc.format.page | iii, 38 p. | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 2003. 8 | - |