Overall optimization of the enumeration approach for the LWE problemLWE문제 열거방식 공격법의 통합적인 최적화
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Hahn, Sanggeun | - |
| dc.contributor.advisor | 한상근 | - |
| dc.contributor.author | Kim, Seongkwang | - |
| dc.date.accessioned | 2019-09-03T02:44:59Z | - |
| dc.date.available | 2019-09-03T02:44:59Z | - |
| dc.date.issued | 2018 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=867950&flag=dissertation | en_US |
| dc.identifier.uri | http://hdl.handle.net/10203/266415 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2018.2,[ii, 23 p. :] | - |
| dc.description.abstract | Learning with errors (LWE) problem is an well-known problem for lattice cryptography. After Lindner and Peikert suggested an attack using bounded distance decoding (BDD) problem [LP11], it has been studied as one of the most practical ways to solve the LWE problem. We revisit the numerical optimization [GNR10] to optimize the BDD approach with pruned enumeration for solving LWE problem. Numerical minimization also takes the lattice reduction, enumeration radius, and subdimension into consideration. | - |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | LWE▼aBDD approach▼anumerical optimization▼apruned enumeration | - |
| dc.subject | LWE▼aBDD 공격▼a수치적 최적화▼apruned enumeration | - |
| dc.title | Overall optimization of the enumeration approach for the LWE problem | - |
| dc.title.alternative | LWE문제 열거방식 공격법의 통합적인 최적화 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 325007 | - |
| dc.description.department | 한국과학기술원 :수리과학과, | - |
| dc.contributor.alternativeauthor | 김성광 | - |
- Appears in Collection
- MA-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.