Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 이향숙 | - |
dc.contributor.author | 정경미 | - |
dc.creator | 정경미 | - |
dc.date.accessioned | 2016-08-26T04:08:19Z | - |
dc.date.available | 2016-08-26T04:08:19Z | - |
dc.date.issued | 2015 | - |
dc.identifier.other | OAK-000000110973 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/212559 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000110973 | - |
dc.description.abstract | Security analysis on the NTRUEncrypt public key cryptosystem is mainly based on the hardness of lattice problems in a special form of lattices, called Coppersmith-Shamir basis. In this thesis, we present our Coppersmith-Shamir basis customized lattice reduction algorithm to find a short vector which can be work as a decryption key. Since Coppersmith-Shamir basis has ideal lattice like structure in the bottom part, we applied our Simplified Reuse technique to that part and obtained the improved complexity compared to the LLL algorithm.;NTRUEncrypt라는 암호시스템에서의 안전성 분석은 쿠퍼스미스-샤미르라고 불리는 기저로 생성되는 래티스에서의 어려운 문제에 기반을 두고 있다. 이 논문에서는 쿠퍼스미스-샤미르 기저에 맞춰진 lattice basis reduction 알고리즘을 제안하였다. 이 알고리즘은 쿠퍼스미스-샤미르 기저가 밑의 절반 부분에서 아이디얼 래티스 모양을 갖는 특성을 이용하여 Simplified Reuse technique을 적용하였고, 기존에 제안된 LLL 알고리즘보다 개선된 복잡도를 얻게 되었다. | - |
dc.description.tableofcontents | 1 Introduction 1 2 Lattice 3 2.1 Lattice Problems 11 2.2 Ideal Lattice 12 3 The NTRUEncrypt Cryptosystem 15 3.1 The NTRU Public Key Cryptosystem 16 3.2 Mathematical Hard Problems Underlying NTRU 19 3.3 NTRU Key Recovery Problem as a Hard Problem in Lattice 22 4 Basis Reduction Algorithms 25 4.1 LLL Algorithm 28 4.2 LLL Algorithm for Ideal Lattice 36 5 Main Results 42 5.1 Overview 42 5.2 Our Algorithm 43 5.3 Comparison with LLL 46 5.4 NTRU Key Recovery Attack with Our Algorithm 50 6 Conclusion and Further Works 54 References 55 국문초록 58 | - |
dc.format | application/pdf | - |
dc.format.extent | 1449816 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.subject.ddc | 500 | - |
dc.title | An Improved Attack Algorithm on NTRU Using Modified Reuse Technique | - |
dc.type | Master's Thesis | - |
dc.format.page | v, 58 p. | - |
dc.contributor.examiner | 김상집 | - |
dc.contributor.examiner | 이윤진 | - |
dc.contributor.examiner | 이향숙 | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 2015. 2 | - |