A modified LLL reduction algorithm and its application to NTRU cryptanalysis
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 100 === In 1982, Lenstra, Lenstra and Lovasz invented a basis reduction algorithm, abbreviated LLL algorithm, which has been proven a polynomial-time algorithm that solves the shortest vector problem (SVP) and the closest vector problem (CVP) on lattices. These two p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24734176248500613783 |