政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/131400

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113303/144284 (79%)
Visitors : 50800046 Online Users : 655

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/131400

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/131400

Title:	An Efficient Algorithm for Shortest Vector Problem
Authors:	曾一凡 Tseng, Yi-Fan Chuang, Yu-Lun Fan, Chun-I
Contributors:	資科系
Keywords:	Shortest vector problem;algorithm analysis;optimization theory;lattice;lattice-based cryptography
Date:	2018
Issue Date:	2020-09-02 09:12:25 (UTC+8)
Abstract:	Lattice is widely used in cryptography since it has potential for defending quantum attacks. One of the significant problems in such cryptography is the shortest vector problem (SVP). This problem is to find the non-zero shortest vector in lattice. The SVP is an NP-hard problem under randomized reductions proven by Ajtai, and many cryptosystems are secure under the assumption that SVP is hard, such as NTRU. On the other hand, some primitives of lattice-based cryptography require relatively short vectors. In this paper, we propose a new SVP algorithm that can be performed in time complexity O(n 3 ). We also prove that the Hermite factor of the proposed algorithm is polynomial-bounded.
Relation:	IEEE Access, Vol.6, pp.61478-61487
Data Type:	article
DOI 連結:	https://doi.org/10.1109/ACCESS.2018.2876401
DOI:	10.1109/ACCESS.2018.2876401
Appears in Collections:	[資訊科學系] 期刊論文

Files in This Item:

File	Description	Size	Format
63.pdf		4617Kb	Adobe PDF2	362	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...