Computing an LLL-reduced basis of the orthogonal lattice

doi:10.1145/3208976.3209013

	Computing an LLL-reduced basis of the orthogonal lattice
	Chen, Jingwei1 ; Stehlé, Damien 2; Villard, Gilles 2
	2018
会议日期	July 16, 2018 - July 19, 2018
会议地点	New York, NY, United states
DOI	10.1145/3208976.3209013
页码	263-270
英文摘要	As a typical application, the Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such bases in input, we propose a new technique for bounding from above the number of iterations required by the LLL algorithm. The main technical ingredient is a variant of the classical LLL potential, which could prove useful to understand the behavior of LLL for other families of input bases. © 2018 Association for Computing Machinery.
会议录	43rd ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2018
语种	英语
内容类型	会议论文
源URL	[http://119.78.100.138/handle/2HOD01W0/7982]
专题	中国科学院重庆绿色智能技术研究院
作者单位	1.Chongqing Key Lab of Automated Reasoning and Cognition, Chongqing Institute of Green and Intelligent Technology, CAS, Chongqing, China; 2.Univ Lyon, ENS de Lyon, CNRS, Inria, Université Claude Bernard Lyon 1, LIP UMR 5668, Lyon; F-69007, France
推荐引用方式 GB/T 7714	Chen, Jingwei,Stehlé, Damien,Villard, Gilles. Computing an LLL-reduced basis of the orthogonal lattice[C]. 见:. New York, NY, United states. July 16, 2018 - July 19, 2018.