文件名称：LLL algorithms
文件大小：7.48MB
文件格式：PDF
更新时间：2021-03-21 09:26:59
lattice reduction; algorithm; cryptography
Computational aspects of geometry of numbers have been revolutionized by the Lenstra–Lenstra–Lov´asz lattice reduction algorithm (LLL), which has led to breakthroughs in fields as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testified by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction.