文章基本信息

标题：On Lattice Based Cryptographic Sampling: An Algorithmic Approach
本地全文：下载
作者：Sunder Lal ; Santosh Kumar Yadav ; Kuldeep Bhardwaj 等
期刊名称：BVICAM's International Journal of Information Technology
印刷版ISSN：0973-5658
出版年度：2010
卷号：2
期号：1
出版社：Bharati Vidyapeeth's Institute of Computer Applications and Management
摘要：In this paper we propose a practical lattice based reduction by sampling to avoid any dependence on Schnorr's Geometric Series Assumption. It is a generalization of Schnorr's RSR algorithm. It is also well defined for bases where this algorithm is not applicable. It demonstrates that the sampling reduction can significantly reduce the length of the base vectors. We also propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr. We report the empirical behaviour of these algorithms.
关键词：Sampling algorithm; Best Bound; NTRU Reduction; lattice bases reduction.